797 search results - page 33 / 160 » Eliminating Proofs from Programs |
128
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framewo...
124
click to vote
ENTCS
2006
15 years 23 days ago
2006
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
132
click to vote
ICFP
2012
ACM
13 years 3 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
KBSE
2008
IEEE
15 years 7 months ago
2008
IEEE
—We describe PTYASM, an enhanced version of the YASM software model checker which uses proof templates. These templates associate correctness arguments with common programming id...
152
click to vote
ESOP
2005
Springer
15 years 6 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 ...