718 search results - page 27 / 144 » Extraction of Structured Programs from Specification Proofs |
127
click to vote
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
122
click to vote
AAAI
2000
15 years 3 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
154
click to vote
IWPC
2003
IEEE
15 years 7 months ago
2003
IEEE
Program comprehension is an important part of software maintenance, especially when program structure is complex and documentation is unavailable or outdated. Data mining can prod...
135
click to vote
ESOP
2008
Springer
15 years 4 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
158
click to vote
VMCAI
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...