13383 search results - page 87 / 2677 » Abstractions from proofs |
143
click to vote
TAP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...
262
click to vote
FROCOS
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
134
click to vote
LPAR
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
136
Voted
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
129
click to vote
FUIN
2008
15 years 5 months ago
2008
Abstract. Besides the features of a class-based object-oriented language, Java integrates concurrency via its thread-classes, allowing for a multithreaded flow of control. Besides ...