Sciweavers

80 search results - page 8 / 16
» Program Extraction from Normalization Proofs
Sort
View
PLDI
2010
ACM
14 years 5 months ago
Type-preserving Compilation for End-to-end Verification of Security Enforcement
A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in th...
Juan Chen, Ravi Chugh, Nikhil Swamy
CADE
2010
Springer
13 years 8 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
NMR
2004
Springer
14 years 1 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
POPL
2006
ACM
14 years 8 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
KBSE
1999
IEEE
13 years 12 months ago
An Integration of Deductive Retrieval into Deductive Synthesis
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...
Bernd Fischer 0002, Jon Whittle