333 search results - page 41 / 67 » On the complexity of partial order trace model checking |
120
Voted
DLT
2009
14 years 7 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
89
Voted
VLDB
1998
ACM
15 years 1 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
FASE
2009
Springer
15 years 1 months ago
2009
Springer
Model checking tools based on the iterative refinement of predicate abstraction (e.g., Slam and Blast) often feature a specification language for expressing complex behavior rules....
EUROMICRO
2007
IEEE
14 years 11 months ago
2007
IEEE
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The cur...
136
click to vote
BIOWIRE
2007
Springer
15 years 3 months ago
2007
Springer
Epidemics-inspired techniques have received huge attention in recent years from the distributed systems and networking communities. These algorithms and protocols rely on probabili...