Sciweavers

61 search results - page 8 / 13
» Source-Level Proof Reconstruction for Interactive Theorem Pr...
Sort
View
CSL
2004
Springer
13 years 11 months ago
Towards Mechanized Program Verification with Separation Logic
Using separation logic, this paper presents three Hoare logics (corresponding to different notions of correctness) for the simple While language extended with commands for heap acc...
Tjark Weber
CADE
2007
Springer
14 years 7 months ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
MICS
2010
81views more  MICS 2010»
13 years 5 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
CLIMA
2004
13 years 8 months ago
Metareasoning for Multi-agent Epistemic Logics
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
Konstantine Arkoudas, Selmer Bringsjord
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow