Context unification with one context variable

DOI10.1016/j.jsc.2008.10.005zbMath1192.68431OpenAlexW2033770248MaRDI QIDQ1041589

Guillem Godoy, Adrià Gascón, Ashish Kumar Tiwari, Manfred Schmidt-Schauss

Publication date: 3 December 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/22290107/1_s2.0_S0747717109001114_main.pdf

zbMATH Keywords

unificationredundancycontext unificationinterprocedural program analysis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)

Related Items (2)

Unification with Singleton Tree Grammars ⋮ Invariant Checking for Programs with Procedure Calls

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Affine relationships among variables of a program
• Linear unification
• Solvability of context equations with two context variables is decidable
• Stratified Context Unification Is NP-Complete
• Proving termination with multiset orderings
• An Efficient Unification Algorithm
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• On unification of terms with integer exponents
• A Decision Algorithm for Stratified Context Unification
• Linear second-order unification
• On equality up-to constraints over finite trees, context unification, and one-step rewriting
• Automated Deduction – CADE-20
• Assertion Checking Unified
• Automata, Languages and Programming
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• Computing Procedure Summaries for Interprocedural Analysis

This page was built for publication: Context unification with one context variable