77 search results - page 2 / 16 » Partiality and Nondeterminacy in Program Proofs |
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ļ...
POPL
2004
ACM
14 years 7 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...
CADE
1990
Springer
13 years 11 months ago
1990
Springer
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
FMCAD
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive veriļ¬cation of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
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...