1205 search results - page 29 / 241 » Program Extraction from Large Proof Developments |
CADE
2003
Springer
14 years 11 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
LPAR
2004
Springer
14 years 4 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
MICS
2010
13 years 9 months ago
2010
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
ICFP
1997
ACM
14 years 3 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
KDD
2008
ACM
14 years 11 months ago
2008
ACM
Extracting entities (such as people, movies) from documents and identifying the categories (such as painter, writer) they belong to enable structured querying and data analysis ov...