Coinductive techniques for checking satisfiability of generalized nested conditions
From MaRDI portal
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- A navigational logic for reasoning about graph properties
- Abstractions from proofs
- Adhesive and quasiadhesive categories
- An algorithm for approximating the satisfiability problem of high-level conditions
- Coinductive techniques for checking satisfiability of generalized nested conditions
- Complete Lattices and Up-To Techniques
- Conditional bisimilarity for reactive systems
- Conditional reactive systems
- Correctness of high-level transformation systems relative to nested conditions
- Deriving Bisimulation Congruences for Conditional Reactive Systems
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- Fundamentals of algebraic graph transformation
- Graph Transformations
- scientific article; zbMATH DE number 5604126 (Why is no real title available?)
- scientific article; zbMATH DE number 45228 (Why is no real title available?)
- scientific article; zbMATH DE number 1759615 (Why is no real title available?)
- scientific article; zbMATH DE number 837700 (Why is no real title available?)
- Symbolic model generation for graph properties
- Tableau-based reasoning for graph properties
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
This page was built for publication: Coinductive techniques for checking satisfiability of generalized nested conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859906)