Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
International Journal of Parallel Programming
A structural induction theorem for processes
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Handbook of theoretical computer science (vol. B)
Computational logic: essays in honor of Alan Robinson
Computational logic: essays in honor of Alan Robinson
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Unique decomposition of processes
Theoretical Computer Science
Rippling: a heuristic for guiding inductive proofs
Artificial Intelligence
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Deciding observational congruence of finite-state CCS expressions by rewriting
Theoretical Computer Science
PAM: a process algebra manipulator
Formal Methods in System Design
A polynomial algorithm for deciding bisimilarity of normed context-free processes
Theoretical Computer Science
Communicating sequential processes
Communications of the ACM
Communication and Concurrency
The Use of Planning Critics in Mechanizing Inductive Proofs
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Proof Plans for the Correction of False Conjectures
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
A Verification Tool for Value-Passing Processes
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
A Computer-Checked Verification of Milner's Scheduler
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Bounded Retransmission Protocol for Large Data Packets
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Experiments in Automating Hardware Verification Using Inductive Proof Planning
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Checking Verifications of Protocols and Distributed Systems by Computer
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The Concurrency Factory: A Development Environment for Concurrent Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The Use of Explicit Plans to Guide Inductive Proofs
Proceedings of the 9th International Conference on Automated Deduction
Proceedings of the 10th International Conference on Automated Deduction
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The Use of Proof Plans to Sum Series
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Extensions to a Generalization Critic for Inductive Proof
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Planning Equational Verification in CCS
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Predicate Synthesis for Correcting Faulty Conjectures: The Proof Planning Paradigm
Automated Software Engineering
On Process Equivalence = Equation Solving in CCS
Journal of Automated Reasoning
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical communicating systems, including a novel class of problems, which we call VIPS. VIPSs are value-passing, infinite-state, parameterised systems. Existing approaches using model checking over FSSs are insufficient for VIPSs. This is due to their inability both to reason with and about domain-specific theories, and to cope with systems having an unbounded or arbitrary state space.We use the Calculus of Communicating Systems (CCS) (iCommunication and Concurrency. London: Prentice Hall, 1989) to express and specify VIPSs. We take iprogram verification to be proving the program and its intended specification equivalent. We use the laws of CCS to conduct the verification task. This approach allows us to study communicating systems and the data such systems communicate. Automating theorem proving in this context is an extremely difficult task.We provide automated methods for CCS analysis; they are applicable to both FSSs and VIPSs. Adding these methods to the iCLiAiM proof planner (Lecture Notes in Artificial Intelligence, Vol. 449, Springer, 1990, pp. 647, 648), we have implemented an automated verification planner capable of dealing with problems that previously required human interaction. This paper describes these methods, gives an account as to why they work, and provides a short summary of experimental results.