797 search results - page 58 / 160 » Eliminating Proofs from Programs |
PPDP
2010
Springer
14 years 10 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
116
Voted
EMO
2003
Springer
15 years 6 months ago
2003
Springer
This paper introduces an interface specification (PISA) that allows to separate the problem-specific part of an optimizer from the problem-independent part. We propose a view of ...
118
Voted
CADE
2010
Springer
15 years 1 months ago
2010
Springer
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...
111
click to vote
POPL
1995
ACM
15 years 4 months ago
1995
ACM
Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accep...
TPHOL
2007
IEEE
15 years 7 months ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...