A calculus of higher order communicating systems
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Facile: a symmetric integration of concurrent and functional programming
International Journal of Parallel Programming
CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Higher-order concurrent programs with finite communication topology (extended abstract)
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic analysis of shared-memory concurrent languages using abstract model-checking
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A theory of weak bisimulation for core CML
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Model checking mobile processes
Information and Computation
A Semantic Theory for Concurrent ML
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
A Coherent Type System for a Concurrent, Functional and Imperative Programming Language
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
A Theory of Communicating Processes with Value-Passing
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Reasoning about Higher-Order Processes
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
From CML to Process Algebras (Extended Abstract)
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Abstract Interpretation of Small-Step Semantics
Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages
Natural-Semantics-Based Abstract Interpretation (Preliminary Version)
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Programmable verifiers in imperative programming
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
A type system equivalent to a model checker
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
| Hi-index | 0.02 |
In this paper, we present a formal verification framework for higher-order value-passing process algebra. This framework stems from an established synergy between type inference and model-checking. The language considered here is based on a sugared version of an implicitly typed λ-calculus extended with higher-order synchronous concurrency primitives. First, we endow such a syntax with a semantic theory made of a static semantics together with a dynamic semantics. The static semantics consists of an annotated type system. The dynamic semantics is operational and comes as a two-layered labeled transition system. The dynamic semantics is abstracted into a transitional semantics so as to make finite some infinite-state processes. We describe the syntax and the semantics of a verification logic that allows one to specify properties. The logic is an extension of the modal µ-calculus for handling higher-order processes, value-passing and return of results.