23 search results - page 3 / 5 » A Formalisation of Smallfoot in HOL |
CADE
2005
Springer
14 years 8 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
FMCO
2009
Springer
13 years 5 months ago
2009
Springer
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing wor...
ENTCS
2007
13 years 7 months ago
2007
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
AISC
2010
Springer
14 years 5 hour ago
2010
Springer
General purpose theorem provers provide sophisticated proof methods, but lack some of the advanced structuring mechanisms found in specification languages. This paper builds on pr...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. A verified compiler is an integral part of every security infrastructure. Previous work has come up with formal semantics for sequential and concurrent variants of Java a...