Sciweavers

117 search results - page 9 / 24
» Program Extraction from Classical Proofs
Sort
View
ICFP
2012
ACM
11 years 10 months ago
Proof-producing synthesis of ML from higher-order logic
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...
Magnus O. Myreen, Scott Owens
AAAI
2010
13 years 9 months ago
A Temporal Proof System for General Game Playing
A general game player is a system that understands the rules of unknown games and learns to play these games well without human intervention. A major challenge for research in Gen...
Michael Thielscher, Sebastian Voigt
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
ALT
2004
Springer
14 years 4 months ago
Probabilistic Inductive Logic Programming
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...
Luc De Raedt, Kristian Kersting