6274 search results - page 282 / 1255 » Proofs, Programs, Processes |
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 ...
194
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...
144
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
153
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
162
click to vote
TPHOL
2007
IEEE
16 years 25 days ago
2007
IEEE
Abstract We present the generic system framework of Isabelle/Isar underlying recent versions of Isabelle. Among other things, Isar provides an infrastructure for Isabelle plug-ins,...