442 search results - page 49 / 89 » Proof Abstraction for Imperative Languages |
153
click to vote
FOSSACS
2009
Springer
16 years 3 days ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
147
click to vote
APLAS
2001
ACM
15 years 9 months ago
2001
ACM
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
142
click to vote
GI
2009
Springer
15 years 10 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...
148
click to vote
TPHOL
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract. How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machinechecked proofs? We propose an initial set of b...
185
Voted
ICFP
2004
ACM
16 years 5 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...