Inter-procedural Two-Variable Herbrand Equalities
From MaRDI portal
Publication:2802449
DOI10.1007/978-3-662-46669-8_19zbMath1335.68066arXiv1410.4416OpenAlexW1531511464MaRDI QIDQ2802449
Stefan Schulze Frielinghaus, Michael Petter, Helmut Seidl
Publication date: 26 April 2016
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.4416
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- The undecidability of the second-order unification problem
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- Inter-procedural Two-Variable Herbrand Equalities
- Algorithmics on SLP-compressed strings: A survey
- Invariant Checking for Programs with Procedure Calls
- Grammar-Based Tree Compression
- Precise interprocedural analysis through linear algebra
- Context Unification is in PSPACE
- Programming Languages and Systems
- Interprocedurally Analyzing Polynomial Identities
- Upper Adjoints for Fast Inter-procedural Variable Equalities
- Static Analysis
- An axiomatic basis for computer programming
- Computing Procedure Summaries for Interprocedural Analysis
This page was built for publication: Inter-procedural Two-Variable Herbrand Equalities
