134 search results - page 4 / 27 » Meronymy Extraction Using An Automated Theorem Prover |
110
click to vote
PLDI
2011
ACM
14 years 17 days ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
IJAIT
2006
14 years 9 months ago
2006
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
CADE
2007
Springer
15 years 3 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...