175 search results - page 3 / 35 » Symbolic Model Checking for Asynchronous Boolean Programs |
CL
2000
Springer
13 years 11 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
AMC
2006
13 years 7 months ago
2006
This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Churc...
CAV
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
SPIN
2000
Springer
13 years 11 months ago
2000
Springer
WLP
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...