Theorem proving graph grammars with attributes and negative application conditions
From MaRDI portal
Publication:2358623
DOI10.1016/j.tcs.2017.04.010zbMath1371.68139OpenAlexW2622763796MaRDI QIDQ2358623
Luciana Foss, Simone André da Costa Cavalheiro, Leila Ribeiro
Publication date: 15 June 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.04.010
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verification of graph grammars using a logical approach
- Linear logic
- Symbolic graphs for attributed graph constraints
- Algebraic approach to single-pushout graph transformation
- Designing the automatic transformation of visual languages
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- A framework for the verification of infinite-state graph transformation systems
- Isabelle/HOL. A proof assistant for higher-order logic
- Two-level reasoning about graph transformation programs
- Fundamentals of algebraic graph transformation
- Modeling and Verifying Graph Transformations in Proof Assistants
- Hoare-Style Verification of Graph Programs
- A General Attribution Concept for Models in ${\cal M}$ -Adhesive Transformation Systems
- AGREE – Algebraic Graph Rewriting with Controlled Embedding
- Verifying Monadic Second-Order Properties of Graph Programs
- Resolution-Like Theorem Proving for High-Level Conditions
- Towards the Verification of Attributed Graph Transformation Systems
- On the Use of Alloy to Analyze Graph Transformation Systems
- Weakest Preconditions for High-Level Programs
- Correctness of high-level transformation systems relative to nested conditions
- The B-Book
- Handbook of Graph Grammars and Computing by Graph Transformation
- Interactive and automated proofs for graph transformations
- Delaying Constraint Solving in Symbolic Graph Transformation
- Handbook of Graph Grammars and Computing by Graph Transformation
- Theorem Proving Graph Grammars: Strategies for Discharging Proof Obligations
- Formal Verification of Graph Grammars using Mathematical Induction
- Specification Patterns for Properties over Reachable States of Graph Grammars
- Towards Critical Pair Analysis for the Graph Programming Language GP 2
- Second Order Logic, Set Theory and Foundations of Mathematics
- Unifying Theories in ProofPower-Z
- An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
- The York Abstract Machine
- Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions
- Formal Methods for Open Object-Based Distributed Systems
This page was built for publication: Theorem proving graph grammars with attributes and negative application conditions
