134 search results - page 9 / 27 » Meronymy Extraction Using An Automated Theorem Prover |
LOPSTR
1998
Springer
15 years 4 months ago
1998
Springer
This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedur...
CADE
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
112
click to vote
SP
2002
IEEE
14 years 11 months ago
2002
IEEE
We describe a method for finding security flaws in source code by way of static analysis. The method is notable because it allows a user to specify a wide range of security proper...
119
click to vote
ICFP
2012
ACM
13 years 2 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
CADE
2006
Springer
16 years 2 days ago
2006
Springer
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...