54 search results - page 8 / 11 » Bebop: A Symbolic Model Checker for Boolean Programs |
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 ...
FMCAD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
TOOLS
2000
IEEE
14 years 16 hour ago
2000
IEEE
UML is widely used today for modelling complex systems. However, the tools support capabilities for UML is limited, partially due to its lack of precise semantics. There are some ...
154
click to vote
ICSE
2012
IEEE-ACM
11 years 10 months ago
2012
IEEE-ACM
—We propose an extension of van Lamsweerde’s goal-oriented requirements engineering to the domain of programmable DNA nanotechnology. This is a domain in which individual devic...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...