Process algebra
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Handbook of logic in computer science (vol. 4)
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Combining Interaction and Automation in Process Algebra Verification
TAPSOFT '91 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD)
PAM: A Process Algebra Manipulator
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Algebraic Proof Assistants in HOL
MPC '95 Mathematics of Program Construction
A generic theorem prover of CSP refinement
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A proof framework for concurrent programs
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by axioms. This is convenient for concrete applications where the rewrite mechanisms of PVS can be exploited. For the verification of theoretical results, often induction principles are needed. They are provided by the second approach where process terms are defined as an abstract datatype with a separate equivalence relation.