77 search results - page 5 / 16 » Logical Interpretation: Static Program Analysis Using Theore... |
POPL
2004
ACM
14 years 8 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
TACS
1994
Springer
13 years 11 months ago
1994
Springer
Abstract Interpretation for Control-Flow Analysis Yan Mei Tang and Pierre Jouvelot CRI, Ecole des Mines de Paris, France Effect systems and abstract interpretation are two methods ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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...