333 search results - page 58 / 67 » On the complexity of partial order trace model checking |
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous)...
ICSE
2001
IEEE-ACM
13 years 12 months ago
2001
IEEE-ACM
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
SIGSOFT
2000
ACM
13 years 12 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...