57 search results - page 8 / 12 » Automating Side Conditions in Formalized Partial Functions |
POPL
2010
ACM
14 years 4 months ago
2010
ACM
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...
ELP
1991
13 years 11 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
TPHOL
2003
IEEE
14 years 20 days ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
CSL
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
APLAS
2007
ACM
2007
ACM
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
13 years 11 months ago
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...