426 search results - page 30 / 86 » Specification, Abduction, and Proof |
183
click to vote
ICCAD
2006
IEEE
16 years 21 days ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
203
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
150
click to vote
JSC
2006
15 years 6 months ago
2006
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
213
click to vote
AMAST
2010
Springer
15 years 1 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...
205
click to vote
KBSE
2000
IEEE
15 years 10 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...