An Algorithm for Approximating the Satisfiability Problem of High-level Conditions

DOI10.1016/j.entcs.2008.04.075zbMath1283.68211OpenAlexW1980948781MaRDI QIDQ5403460

Karl-Heinz Pennemann

Publication date: 26 March 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.075

zbMATH Keywords

graph transformationhigh-level conditionsweak adhesive HLR categoriesfirst-order satisfiability problemhigh-level programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (5)

Theorem proving graph grammars with attributes and negative application conditions ⋮ Resolution-Like Theorem Proving for High-Level Conditions ⋮ Development of Correct Graph Transformation Systems ⋮ Correctness of high-level transformation systems relative to nested conditions ⋮ Comprehensive systems: a formal foundation for multi-model consistency management

Uses Software

• MiniSat
• Mace4
• FALCON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing finite algebras with FALCON
• Fundamentals of algebraic graph transformation
• Satisfiability of High-Level Conditions
• Weakest Preconditions for High-Level Programs
• Correctness of high-level transformation systems relative to nested conditions
• Graph Transformations
• Graph Transformations
• A machine program for theorem-proving
• Automated Deduction – CADE-19

This page was built for publication: An Algorithm for Approximating the Satisfiability Problem of High-level Conditions