<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jorge Sousa Pinto</style></author><author><style face="normal" font="default" size="100%">Pedro Rangel Henriques</style></author><author><style face="normal" font="default" size="100%">Daniela Cruz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">GamaSlicer: an online laboratory for program verification and analysis</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the of the Tenth Workshop on Language Descriptions, Tools and Applications - LDTA</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year><pub-dates><date><style  face="normal" font="default" size="100%">March</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/jsp/files/ldta2010gamaslicervf.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Paphos, Cyprus</style></pub-location><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we present the GamaSlicer tool, which is primarily a semantics-based program slicer that also offers formal verification (generation of verification conditions) and program visualization functionality. The tool allows users to obtain slices using a number of different families of slicing algorithms (\precond-based, \postcond-based, and specification-based), from a correct software component annotated with pre and postconditions (contracts written in JML-annotated Java). Each family in turn contains algorithms of different precision (with more precise algorithms being asymptotically slower). A novelty of our work at the theoretical level is the inclusion of a new, much more effective algorithm for specification-based slicing, and in fact other current work at this level is being progressively incorporated in the tool.&lt;/p&gt;
&lt;p&gt;The tool also generates (in a step-by-step fashion) a set of verification conditions (as formulas written in the SMT-lib language, which enables the use of different automatic SMT provers). This allows to establish the initial correctness of the code with respect to their contracts.&lt;/p&gt;
</style></abstract></record></records></xml>