Proof Graphs for Parameterised Boolean Equation Systems

DOI10.1007/978-3-642-40184-8_33zbMath1390.68425OpenAlexW1902047993MaRDI QIDQ2842127

Sjoerd Cranen, Bas Luttik, Tim A. C. Willemse

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40184-8_33

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 (5)

Abstraction in Fixpoint Logic ⋮ Exponential automatic amortized resource analysis ⋮ Fold/Unfold Transformations for Fixpoint Logic ⋮ Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems ⋮ Producing explanations for rich logics

This page was built for publication: Proof Graphs for Parameterised Boolean Equation Systems