13383 search results - page 28 / 2677 » Abstractions from proofs |
LPAR
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We describe an environment that allows the users of the Theorema system to flexibly control aspects of computer-supported proof development. The environment supports the...
ITP
2010
13 years 12 months ago
2010
ied Denotational Abstract Interpreter (Proof Pearl) David Cachera1 and David Pichardie2 1 IRISA / ENS Cachan (Bretagne), France 2 INRIA Rennes
ITP
2010
14 years 1 months ago
2010
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...
FM
2003
Springer
14 years 3 months ago
2003
Springer
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
AMAST
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...