Reasoning about higher-order processes

DOI10.1007/3-540-59293-8_196zbMath1496.68211OpenAlexW1540321537MaRDI QIDQ5096732

Roberto M. Amadio, Mads Dam

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_196

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Proving properties of dynamic process networks ⋮ A Logic for Distributed Higher Order π-Calculus ⋮ First-order reasoning for higher-order concurrency ⋮ First–order Semantics for Higher–order Processes

Cites Work

• Unnamed Item
• Unnamed Item
• Modal logics for communicating systems
• Modal logics for mobile processes
• Plain CHOCS. A second generation calculus for higher order processes
• A fully abstract denotational model for higher-order processes
• A modal logic for message passing processes
• A domain equation for bisimulation
• Algebraic laws for nondeterminism and concurrency

This page was built for publication: Reasoning about higher-order processes