Sciweavers

1210 search results - page 36 / 242
» Formal Techniques for Java Programs
Sort
View
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 2 months ago
Verification of Java Bytecode using Analysis and Transformation of Logic Programs
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
Elvira Albert, Miguel Gómez-Zamalloa, Laure...
WCRE
2000
IEEE
15 years 6 months ago
Understanding the Behavior of Java Programs
To fully understand the underlying architecture of an object-oriented software system, both static and dynamic analyses are needed. Dynamic reverse engineering techniques are espe...
Tarja Systä
CC
2004
Springer
110views System Software» more  CC 2004»
15 years 7 months ago
Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs
In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is efficient yet effective for reducing the number of inter...
Venkatesh Prasad Ranganath, John Hatcliff
RTA
2011
Springer
14 years 4 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
ICSE
2004
IEEE-ACM
16 years 2 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury