Sciweavers

7 search results - page 1 / 2
» Verifying the Concept of Union Slices on Java Programs
Sort
View
CSMR
2007
IEEE
13 years 11 months ago
Verifying the Concept of Union Slices on Java Programs
Static program slicing is often proposed for software maintenance-related tasks. Due to different causes static slices are in many cases overly conservative and hence too large to...
Attila Szegedi, Tamás Gergely, Árp&a...
SIGSOFT
2007
ACM
14 years 5 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
SAC
2008
ACM
13 years 4 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
SIGSOFT
2005
ACM
14 years 5 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
ENTCS
2007
134views more  ENTCS 2007»
13 years 4 months ago
Improving the Decompilation of Java Bytecode to Prolog by Partial Evaluation
The interpretative approach to compilation allows compiling programs by partially evaluating an interpreter w.r.t. a source program. This approach, though very attractive in princ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...