Communicating sequential processes
Communicating sequential processes
A classical mind
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
On the expressive power of CSP refinement
Formal Aspects of Computing
SNZI: scalable NonZero indicators
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
An Antichain Algorithm for LTL Realizability
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
PAT: Towards Flexible Verification under Fairness
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Antichains: alternative algorithms for LTL satisfiability and model-checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Model checking hierarchical probabilistic systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Build your own model checker in one month
Proceedings of the 2013 International Conference on Software Engineering
USMMC: a self-contained model checker for UML state machines
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Hi-index | 0.00 |
Refinement checking plays an important role in system verification. It establishes properties of an implementation by showing a refinement relationship between the implementation and a specification. Recently, it has been shown that anti-chain based approaches increase the efficiency of trace refinement checking significantly. In this work, we study the problem of adopting anti-chain for stable failures refinement checking, failures-divergence refinement checking and probabilistic refine checking (i.e., a probabilistic implementation against a non-probabilistic specification). We show that the first two problems can be significantly improved, because the state space of the product model may be reduced dramatically. Though applying anti-chain for probabilistic refinement checking is more complicated, we manage to show improvements in some cases. We have integrated these techniques into the PAT model checking framework. Experiments are conducted to demonstrate the efficiency of our approach.