1895 search results - page 109 / 379 » Using ATL for Checking Models |
171
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the se...
148
click to vote
ACSD
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Clock gating and operand isolation are two techniques to reduce the power consumption in state-of-the-art hardware designs. Both approaches basically follow a two-step pr...
175
click to vote
TOCL
2011
15 years 1 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
170
click to vote
FOSSACS
2005
Springer
16 years 5 days ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...