1005 search results - page 90 / 201 » Patterns for Refinement Automation |
DAC
2003
ACM
14 years 8 months ago
2003
ACM
We describe a technique for verifying that a hardware design correctly implements a protocol-level formal specification. Simulation steps are translated to protocol state transiti...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...