1410 search results - page 8 / 282 » Proving theorems by reuse |
105
click to vote
CADE
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
KI
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In recent years there has been a growing demand for Automated Theorem Proving (ATP) in large theories, which often have more axioms than can be handled effectively as no...
111
click to vote
FROCOS
2005
Springer
15 years 5 months ago
2005
Springer
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
CHARME
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
EPIA
1999
Springer
15 years 4 months ago
1999
Springer
We introduce a resource adaptive agent mechanism which supports the user of an interactive theorem proving system. The mechanism, an extension of 5 , uses a two layered architectur...