381 search results - page 39 / 77 » Model Checking Is Static Analysis of Modal Logic |
119
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Recent studies have demonstrated the possibility to build genetic regulatory networks that confer a desired behavior to a living organism. However, the design of these ne...
138
Voted
DAC
2004
ACM
16 years 4 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
140
Voted
CORR
2008
Springer
15 years 3 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...
143
Voted
TOCL
2011
14 years 10 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...
143
Voted
IEEECIT
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract The conversation model captures interactions among the components of a composite web service. A conversation is the global sequence of messages exchanged among the compone...