175 search results - page 5 / 35 » Symbolic Model Checking for Asynchronous Boolean Programs |
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
WEA
2005
Springer
14 years 29 days ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
TACAS
2001
Springer
13 years 12 months ago
2001
Springer
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
DATE
2003
IEEE
14 years 23 days ago
2003
IEEE
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...