Proof graphs for parameterised Boolean equation systems

DOI10.1007/978-3-642-40184-8_33MaRDI QIDQ2842127zbMATH OpenOpenAlexFDO

Authors Sjoerd Cranen, Bas Luttik, T. 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)

Recommendations

• Instantiation for Parameterised Boolean Equation Systems
• Invariants for parameterised Boolean equation systems
• Invariants for Parameterised Boolean Equation Systems
• Parameterised Boolean equation systems
• CONCUR 2004 - Concurrency Theory

Cited in

(23)

• A formalisation of consistent consequence for Boolean equation systems
• Producing explanations for rich logics
• Exponential automatic amortized resource analysis
• Parameterised Boolean equation systems
• Solution-Graphs of Boolean Formulas and Isomorphism
• Structural analysis of Boolean equation systems
• Liveness analysis for parameterised Boolean equation systems
• Using SMT for solving fragments of parameterised Boolean equation systems
• Invariants for Parameterised Boolean Equation Systems
• Consistent correlations for parameterised Boolean equation systems with applications in correctness proofs for manipulations
• Static Analysis Techniques for Parameterised Boolean Equation Systems
• scientific article; zbMATH DE number 1538042 (Why is no real title available?)
• Solution-Graphs of Boolean Formulas and Isomorphism1
• scientific article; zbMATH DE number 7599923 (Why is no real title available?)
• An Analytic Propositional Proof System on Graphs
• Analysis of Boolean equation systems through structure graphs
• Fold/unfold transformations for fixpoint logic
• Partial-order reduction for parity games with an application on parameterised Boolean equation systems
• Abstraction in fixpoint logic
• Instantiation for Parameterised Boolean Equation Systems
• Non-deterministic Boolean Proof Nets
• On-the-fly solving for symbolic parity games
• Invariants for parameterised Boolean equation systems

This page was built for publication: Proof graphs for parameterised Boolean equation systems

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