493 search results - page 19 / 99 » Bounded LTL Model Checking with Stable Models |
FMCAD
2004
Springer
14 years 1 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
TSE
2011
13 years 2 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
SPIN
2010
Springer
13 years 6 months ago
2010
Springer
In our earlier work we have proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constra...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
CAV
2004
Springer
14 years 1 months ago
2004
Springer