Termination Analysis for the \pi -Calculus by Reduction to Sequential Program Termination

DOI10.1007/978-3-030-89051-3_15MaRDI QIDQ6488159zbMATH OpenFDO

Authors Takuma Ishikawa, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato, Takeshi Tsukada

Publication date 29 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-89051-3_15

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Termination in a \(\pi\)-calculus with subtyping
• Termination of processes
• Mobile Processes and Termination
• Termination in a -calculus with subtyping
• scientific article; zbMATH DE number 1927554

Cites work

• Automatic Termination Verification for Higher-Order Functional Programs
• Ensuring termination by typability
• Horn clause solvers for program verification
• scientific article; zbMATH DE number 7730636 (Why is no real title available?)
• ICE-based refinement type discovery for higher-order functional programs
• Linearly refined session types
• SMT-based model checking for recursive programs
• Strong normalisation in the \(\pi\)-calculus
• Syntax-guided termination analysis
• Termination in higher-order concurrent calculi
• Termination of processes
• Types for complexity of parallel computation in pi-calculus
• Work analysis with resource-aware session types

Cited in

(5)

• Ensuring termination by typability
• On hierarchical communication topologies in the -calculus
• scientific article; zbMATH DE number 2163050 (Why is no real title available?)
• Useless-code elimination and program slicing for the pi-calculus.
• Excommunication: transforming \(\pi \)-calculus specifications to remove internal communication

This page was built for publication: Termination Analysis for the $$\pi $$-Calculus by Reduction to Sequential Program Termination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488159)