A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
A Synergy Between Model-Checking and Type Inference for the Verification of Value-Passing Higher-Order Processes
[chapter]
1998
Lecture Notes in Computer Science
In this paper, we present a formal verification framework for higherorder 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
doi:10.1007/3-540-49253-4_17
fatcat:laam6t24hff4teqodaoxmnsywu