97 search results - page 10 / 20 » First-Order LTL Model Checking Using MDGs |
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
ICECCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we summarize parallel algorithms for enumerative model checking of properties formulated in linear time temporal logic (LTL) as well as a fragment of the µcalculus ...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
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...
FATES
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a method for reducing the cost of test generation. A spanning set for a coverage criterion is a set of entities such that exercising every entity in the spannin...