290 search results - page 43 / 58 » Theorem Proving Using Lazy Proof Explication |
FMCAD
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
ECCC
2007
14 years 9 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
110
click to vote
NETWORKS
2011
14 years 10 days ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...