171 search results - page 14 / 35 » CoSP: a general framework for computational soundness proofs |
137
click to vote
ESOP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
195
Voted
POPL
2004
ACM
15 years 12 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
109
click to vote
TABLEAUX
1999
Springer
15 years 3 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
APLAS
2006
ACM
15 years 5 months ago
2006
ACM
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
103
click to vote
TPHOL
2007
IEEE
15 years 6 months ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...