30 search results - page 3 / 6 » Graded-CTL: Satisfiability and Symbolic Model Checking |
105
click to vote
CAV
2000
Springer
15 years 3 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...
127
click to vote
EMSOFT
2008
Springer
15 years 1 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...
CHARME
2001
Springer
15 years 3 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
106
click to vote
CADE
2010
Springer
15 years 21 days ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
FORMATS
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...