On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel program design: a foundation
Parallel program design: a foundation
Process algebra
Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Forward and backward simulations I.: untimed systems
Information and Computation
Branching bisimilarity is an equivalence indeed!
Information Processing Letters
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Formal verification of a leader election protocol in process algebra
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Specification of abstract data types
Specification of abstract data types
Term rewriting and all that
ACM Transactions on Computational Logic (TOCL)
Translation validation for an optimizing compiler
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
The parallel composition of uniform processes with data
Theoretical Computer Science
Handbook of Process Algebra
FASE '99 Proceedings of the Second Internationsl Conference on Fundamental Approaches to Software Engineering
Simulation as a Correct Transformation of Rewrite Systems
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
TYPES '94 Selected papers from the International Workshop on Types for Proofs and Programs
Traces of I/O-Automata in Isabelle/HOLCF
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Checking Verifications of Protocols and Distributed Systems by Computer
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Invariants in Process Algebra with Data
CONCUR '94 Proceedings of the Concurrency Theory
A Provably Correct Embedded Verifier for the Certification of Safety Critical Software
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Towards Rigorous Compiler Implementation Verification
Collaboration between Human and Artificial Societies, Coordination and Agent-Based Distributed Computing
A Mechanized Proof Environment for the Convenient Computations Proof Method
Formal Methods in System Design
A Prover for the muCRL toolset with applications -- version 0.1
A Prover for the muCRL toolset with applications -- version 0.1
Verification of a sliding window protocol in μCRL and PVS
Formal Aspects of Computing
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
On the Minimisation of Acyclic Models
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Equivalence checking for infinite systems using parameterized Boolean equation systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Design and formal verification of a CEM protocol with transparent TTP
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generally applicable, because it does not require a preprocessing step to eliminate 驴-loops. We prove soundness of our approach and present a set of rules to prove the reachability of focus points. Our method has been formalized and proved correct using PVS. Thus we have established a framework for mechanical protocol verification. We apply this framework to the Concurrent Alternating Bit Protocol.