77 search results - page 2 / 16 » Logical Interpretation: Static Program Analysis Using Theore... |
POPL
2007
ACM
14 years 5 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
POPL
2005
ACM
14 years 5 months ago
2005
ACM
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
CADE
2002
Springer
14 years 5 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
ISSTA
2012
ACM
11 years 7 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
POPL
2004
ACM
14 years 5 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...