Modal logics for communicating systems
Theoretical Computer Science
Proof systems for satisfiability in Hennessy-Milner logic with recursion
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
A Complete Compositional Model Proof System for a Subset of CCS
Proceedings of the 12th Colloquium on Automata, Languages and Programming
An Interaction-based Language and its Typing System
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Toward a Modal Theory of Types for the pi-Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
From process logic to program logic
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Strong normalisation in the π-calculus
Information and Computation
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Logical reasoning for higher-order functions with local state
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Descriptive and relative completeness of logics for higher-order functions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Sessions and session types: an overview
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
A theory of design-by-contract for distributed multiparty interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Program logics for homogeneous meta-programming
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Program logics for sequential higher-order control
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A unified theory of program logics: an approach based on the π-calculus
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
An observationally complete program logic for imperative higher-order functions
Theoretical Computer Science
Hi-index | 0.00 |
We study an extension of Hennessy-Milner logic for the 茂戮驴-calculus which gives a sound and complete characterisation of representative behavioural preorders and equivalences over typed processes. New connectives are introduced representing actual and hypothetical typed parallel composition and hiding. We study three compositional proof systems, characterising the May/Must testing preorders and bisimilarity. The proof systems are uniformly applicable to different type disciplines. Logical axioms distill proof rules for parallel composition studied by Amadio and Dam. We demonstrate the expressiveness of our logic through verification of state transfer in multiparty interactions and fully abstract embeddings of program logics for higher-order functions.