Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Logic and computation: interactive proof with Cambridge LCF
Logic and computation: interactive proof with Cambridge LCF
Mechanizing CSP Trace Theory in Higher Order Logic
IEEE Transactions on Software Engineering
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
ML for the working programmer
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
A calculus of mobile processes, I
Information and Computation
A calculus of mobile processes, II
Information and Computation
Communication and Concurrency
Experience with Embedding Hardware Description Languages in HOL
Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience
A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
A Theory of Bisimulation for the pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Two case studies of semantics execution in Maude: CCS and LOTOS
Formal Methods in System Design
Specifying Properties of Concurrent Computations in CLF
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coq Library for Verification of Concurrent Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Formalising the π-calculus using nominal logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Combining de Bruijn indices and higher-order abstract syntax in Coq
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Journal of Automated Reasoning
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
The φ-calculus is a process algebra for modelling concurrent systems in which the pattern of communication between processes may change over time. This paper describes the results of preliminary work on a definitional formal theory of the φ-calculus in higher order logic using the HOL theorem prover. The ultimate goal of this work is to provide practical mechanized support for reasoning with the φ-calculus about applications.