Communicating sequential processes
Communicating sequential processes
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Communication and concurrency
International Journal of Parallel Programming
Automating recursive type definitions in higher order logic
Current trends in hardware verification and automated theorem proving
Mechanizing programming logics in higher order logic
Current trends in hardware verification and automated theorem proving
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
Using the Adxiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Mechanically Verifying Concurrent Programs with the Boyer-Moore Prove
IEEE Transactions on Software Engineering
Lightweight analysis of operational specifications using inference graphs
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
A mechanized theory of the &pi-calculus in Hol
Nordic Journal of Computing
IEEE Transactions on Software Engineering
From I/O Automata to Timed I/O Automata
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
PVS Embedding of cCSP Semantic Models and Their Relationship
Electronic Notes in Theoretical Computer Science (ENTCS)
The Stable Revivals Model in CSP-Prover
Electronic Notes in Theoretical Computer Science (ENTCS)
Using automatable proof obligations for component-based design checking
ECBS'99 Proceedings of the 1999 IEEE conference on Engineering of computer-based systems
Encoding circus programs in ProofPower-Z
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Mechanization Of Real-Time Linear Csp With Higher Order Logic
Fundamenta Informaticae
| Hi-index | 0.02 |
How a mechanized tool for reasoning about CSP (communicating sequential processes) can be developed by customizing an existing general-purpose theorem prover based on higher-order logic is described. How the trace semantics of CSP operators can be mechanized in higher-order logic is investigated, and how the laws associated with these operators can be proved from their semantic definitions is shown. The resulting system is one in which natural-deduction style proofs can be conducted using the standard CSP laws.