Projection merging

DOI10.1145/325694.325706MaRDI QIDQ5178844zbMATH OpenOpenAlexFDO

Authors Zhendong Su, Manuel Fähndrich, Alexander Aiken

Publication date 17 March 2015

Published in Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/325694.325706

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Projection-Based Algorithm for Consistent and Inconsistent Constraints
• Graph amalgamation under logical constraints
• Computing the number of mergings with constraints
• On mergings in acyclic directed graphs
• Simple conceptual graphs revisited: hypergraphs and conjunctive types for efficient projection algorithms
• A finer reduction of constraint problems to digraphs
• Constraint satisfaction problems for reducts of homogeneous graphs
• Constraint satisfaction problems for reducts of homogeneous graphs
• Projection: a unification procedure for tableaux in conceptual graphs

Cited in

(3)

• Managing the granularity of constraint-based analyses by rule transformation.
• The Complexity of Andersen’s Analysis in Practice
• A Scalable Inclusion Constraint Solver Using Unification

This page was built for publication: Projection merging

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