Flow Logic for Process Calculi

• Published in: ACM computing surveys Vol. 44; no. 1; pp. 1 - 39
• Main Authors: Nielson, Hanne Riis, Nielson, Flemming, Pilegaard, Henrik
• Format: Journal Article
• Language: English
• Published: New York, NY Association for Computing Machinery 01.01.2012
• Subjects: Applied sciences; Calculi; Calculus; Codes; Computation; Computer science; control theory; systems; Computer systems performance. Reliability; Data flow analysis; Exact sciences and technology; Logic; Logic programming; Logical, boolean and switching functions; Programming languages; Software; Studies; Surveys; Theoretical computing; Process algebra; Moore family; Theory; Computation code; Abstract interpretation; Logical programming; Languages; Mobile code; pi calculus; Design; Verification Static analysis; Semantics; Static analysis; adequacy; Mobile agent; process calculi; Program behavior; flow logic; Documentation; Program verification; Reachability; subject reduction; Educational software program; Algorithms; Programming language; Data flow analysis; Reliability; Hoare logic
• ISSN: 0360-0300; 1557-7341
• DOI: 10.1145/2071389.2071392

Flow Logic is an approach to statically determining the behavior of programs and processes. It borrows methods and techniques from Abstract Interpretation, Data Flow Analysis and Constraint Based Analysis while presenting the analysis in a style more reminiscent of Type Systems. Traditionally developed for programming languages, this article provides a tutorial development of the approach of Flow Logic for process calculi based on a decade of research. We first develop a simple analysis for the π -calculus; this consists of the specification, semantic soundness (in the form of subject reduction and adequacy results), and a Moore Family result showing that a least solution always exists, as well as providing insights on how to implement the analysis. We then show how to strengthen the analysis technology by introducing reachability components, interaction points, and localized environments, and finally, we extend it to a relational analysis. A Flow Logic is a program logic---in the same sense that a Hoare’s logic is. We conclude with an executive summary presenting the highlights of the approach from this perspective including a discussion of theoretical properties as well as implementation considerations. The electronic supplements present an application of the analysis techniques to a version of the π -calculus incorporating distribution and code mobility; also the proofs of the main results can be found in the electronic supplements.