1205 search results - page 13 / 241 » Program Extraction from Large Proof Developments |
ICTAC
2004
Springer
14 years 4 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
ICSE
1999
IEEE-ACM
14 years 3 months ago
1999
IEEE-ACM
A program’s object model captures the essence of its design. For some programs, no object model was developed during design; for others, an object model exists but may be out-of...
APLAS
2005
ACM
14 years 4 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
VLDB
1990
ACM
14 years 2 months ago
1990
ACM
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
POPL
2008
ACM
14 years 11 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...