117 search results - page 5 / 24 » Program Extraction from Classical Proofs |
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
KI
2009
Springer
14 years 2 months ago
2009
Springer
When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem prover...
CIE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...