3658 search results - page 543 / 732 » The logic of proofs, semantically |
278
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
145
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We present a tool for automatic generation of packed bitfields and tagged unions for systems-level C, along with automatic, machine checked refinement proofs in Isabelle/HOL. Our a...
171
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
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 ...
140
click to vote
CADE
2003
Springer
16 years 6 months ago
2003
Springer
We make the notion of scope in the -calculus explicit. To that end, the syntax of the -calculus is extended with an end-of-scope operator , matching the usual opening of a scope du...
193
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...