Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule

DOI10.1016/0890-5401(91)90044-3zbMath0744.68092OpenAlexW2091623384MaRDI QIDQ1183608

Alban Ponse

Publication date: 28 June 1992

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90044-3

zbMATH Keywords

recursiontransition systemHoare logicprocess specification

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Process algebra with guards: Combining hoare logic with process algebra ⋮ Process algebra with four-valued logic

Cites Work

• Recursive process definitions with the state operator
• Ten years of Hoare's logic: A survey. II: Nondeterminism
• Global renaming operators in concrete process algebra
• A calculus of communicating systems
• Ten Years of Hoare's Logic: A Survey—Part I
• Process Algebra
• Logic and structure.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Process expressions and Hoare's logic: Showing and irreconcilability of context-free recursion with Scott's induction rule