61 search results - page 5 / 13 » Testing, abstraction, theorem proving: better together! |
DIAGRAMS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We have developed a diagrammatic logic for theorem proving, focusing on the domain of metric-space analysis (a geometric domain, but traditionally taught using a dry alge...
LICS
2010
IEEE
13 years 5 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
DBPL
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
CAV
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. To determine candidate code fragments, our appro...