366 search results - page 26 / 74 » Model-checking higher-order functions |
103
click to vote
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by in...
ERSHOV
2003
Springer
15 years 5 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
ICALP
2009
Springer
16 years 2 days ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
109
click to vote
GLVLSI
2000
IEEE
15 years 4 months ago
2000
IEEE
Symbolic Model checking is a widely used technique in sequential verification. As the size of the OBDDs and also the computation time depends on the order of the input variables,...
100
click to vote
SBMF
2010
Springer
14 years 6 months ago
2010
Springer
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...