407 search results - page 9 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic veriļ¬cation of software using model checkers from the state space exp...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
PEPM
2010
ACM
14 years 4 months ago
2010
ACM
We present two tools which together allow reasoning about (a substantial subset of) Haskell programs. One is the code generator of the proof assistant Isabelle, which turns speciļ...
ENTCS
2006
13 years 7 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
CADE
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...