Sciweavers

192 search results - page 9 / 39
» Using Call Exit Analysis for Logic Program Transformation
Sort
View
SCAM
2003
IEEE
14 years 27 days ago
Unique Renaming of Java Using Source Transformation
This paper presents a flexible way in which a deisgn model extracted from Java programs can remain unified with the source code. Each entity declaration and reference in the Java ...
Xinping Guo, James R. Cordy, Thomas R. Dean
PODS
1989
ACM
129views Database» more  PODS 1989»
13 years 11 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 1 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
LOPSTR
2007
Springer
14 years 1 months ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...
POPL
2005
ACM
14 years 8 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...