245 search results - page 9 / 49 » Efficient Symbolic Model Checking for Process Algebras |
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
ECSA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Architectural description languages are a useful tool for modmplex software systems at a high level of abstraction and, if based on formal methods, for enabling the early...
CL
2000
Springer
15 years 1 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...
ICCAD
2010
IEEE
14 years 7 months ago
2010
IEEE
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
110
click to vote
EMSOFT
2008
Springer
14 years 11 months ago
2008
Springer
Runtime property checking (as implemented in tools like Purify or Valgrind) checks whether a program execution satisfies a property. Active property checking extends runtime check...