105 search results - page 21 / 21 » Symbolic Model Checking of Non-regular Properties |
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the...
CAV
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
ICCAD
1995
IEEE
13 years 8 months ago
1995
IEEE
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
FC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...