34 search results - page 2 / 7 » Automated Theorem Proving in a Simple Meta-Logic for LF |
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
CADE
2003
Springer
14 years 5 months ago
2003
Springer
IsaPlanner is a generic framework for proof planning in the interactive theorem prover Isabelle. It facilitates the encoding of reasoning techniques, which can be used to conjectur...
LICS
1989
IEEE
13 years 8 months ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
CSL
2004
Springer
13 years 9 months ago
2004
Springer
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...
TPHOL
1999
IEEE
13 years 9 months ago
1999
IEEE
Abstract. We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interact...