Sciweavers

788 search results - page 64 / 158
» Symbolic Equivalence Checking
Sort
View
CONCUR
2000
Springer
13 years 11 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
IJCAI
2001
13 years 9 months ago
Planning as Model Checking for Extended Goals in Non-deterministic Domains
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
Marco Pistore, Paolo Traverso
WETICE
2005
IEEE
14 years 1 months ago
Issues on Decentralized Consistency Checking of Multi-lateral Collaborations
Decentralized consistency checking of multi-lateral collaborations is based on propagating local information to trading partners until a fixed point has been reached. However, wh...
Andreas Wombacher
SIGPLAN
2002
13 years 7 months ago
On-the-fly model checking from interval logic specifications
Future Interval Logic (FIL) and its intuitive graphical representation, Graphical Interval Logic (GIL), can be used as the formal description language of model checking tools to v...
Miguel J. Hornos, Manuel I. Capel
JCSS
2010
102views more  JCSS 2010»
13 years 6 months ago
Matching and alpha-equivalence check for nominal terms
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
Christophe Calvès, Maribel Fernández