Static Analysis Techniques for Parameterised Boolean Equation Systems

DOI10.1007/978-3-642-00768-2_22MaRDI QIDQ3617762zbMATH OpenOpenAlexFDO

Authors Simona Orzan, Wieger Wesselink, T. A. C. Willemse

Publication date 31 March 2009

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00768-2_22

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Instantiation for Parameterised Boolean Equation Systems
• Liveness analysis for parameterised Boolean equation systems
• Verification of reactive systems via instantiation of parameterised Boolean equation systems
• CONCUR 2004 - Concurrency Theory
• Proof graphs for parameterised Boolean equation systems

Cites work

• A coalgebraic representation of reduction by cone of influence
• A lattice-theoretical fixpoint theorem and its applications
• Algebraic Methodology and Software Technology
• Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
• Grammar Analysis and Parsing by Abstract Interpretation
• scientific article; zbMATH DE number 1693039 (Why is no real title available?)
• Instantiation for Parameterised Boolean Equation Systems
• Invariants for Parameterised Boolean Equation Systems
• Model-checking processes with data
• Parameterised Boolean equation systems

Cited in

(15)

• Parity game reductions
• Parameterised Boolean equation systems
• Consistent consequence for Boolean equation systems
• Liveness analysis for parameterised Boolean equation systems
• Using SMT for solving fragments of parameterised Boolean equation systems
• Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
• Abstraction in fixpoint logic
• CONCUR 2004 - Concurrency Theory
• Analysis of Boolean Programs
• Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
• Instantiation for Parameterised Boolean Equation Systems
• Simplifying process parameters by unfolding algebraic data types
• Unfolding state variables improves model checking performance
• Verification of reactive systems via instantiation of parameterised Boolean equation systems
• Invariants for parameterised Boolean equation systems

This page was built for publication: Static Analysis Techniques for Parameterised Boolean Equation Systems

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