Context unification with one context variable

Journal of Symbolic Computation

Volumn 45, Issue 2, 2010, Pages 173-193

  Gascón, Adrià ^a   Godoy, Guillem ^a   Schmidt Schauß, Manfred ^b   Tiwari, Ashish ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b GOETHE UNIVERSITY   (Germany)

^c SRI INTERNATIONAL   (United States)

Author keywords

Context unification; Interprocedural program analysis; Redundancy; Unification

Indexed keywords

EID: 70350732584     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2008.10.005     Document Type: Article

References (23)

1. Baader F., and Snyder W. Unification theory. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. I (2001), Elsevier Science 445-532 (Chapter 8)
2. Busatto G., Lohrey M., and Maneth S. Efficient memory representation of XML document trees. Inf. Syst. 33 4 (2008) 456-474
3. Comon H. On unification of terms with integer exponents. Math. Syst. Theory 28 1 (1995) 67-88
4. Dabrowski R., and Plandowski W. On word equations in one variable. MFCS 2002. LNCS vol. 1103 (2002), Springer-Verlag 212-220
5. Dershowitz N., and Manna Z. Proving termination with multiset orderings. Commun. ACM 22 (1979) 465-476
6. Gulwani S., and Necula G.C. A polynomial-time algorithm for global value numbering. Static Analysis Symposium. LNCS vol. 3148 (2004) 212-227
7. Gulwani S., and Tiwari A. Assertion checking unified. Proc. Verification, Model Checking and Abstract Interpretation, VMCAI 2007. LNCS vol. 4349 (2007), Springer 363-377
8. Gulwani S., and Tiwari A. Computing procedure summaries for interprocedural analysis. Proc. European Symp. on Programming, ESOP 2007. LNCS vol. 4421 (2007), Springer 253-267
9. Karr M. Affine relationships among variables of a program. Acta Inform. 6 (1976) 133-151
10. Lassez J.-L., Maher M.J., and Marriott K. Unification revisited. In: Minker J. (Ed). Foundations of Deductive Databases and Logic Programming (1988), Morgan Kaufmann 587-625
11. Levy J. Linear second-order unification. Proc. 7th Intl. Conf. on Rewriting Techniques and Applications, RTA'96. LNCS vol. 1103 (1996) 332-346
12. Levy J., Niehren J., and Villaret M. Well-nested context unification. CADE 2005. LNCS vol. 3632 (2005) 149-163
13. Levy J., Schmidt-Schauß M., and Villaret M. Stratified context unification is NP-complete. Proc. Third Intl. Joint Conf. on Automated Reasoning, IJCAR 2006. LNCS vol. 4130 (2006), Springer 82-96
14. Makanin G. The problem of solvability of equations in a free semigroup. Math. USSR Sbornik 32 2 (1977) 129-198
15. Martelli A., and Montanari U. An efficient unification algorithm. ACM Trans. Program. Lang. Syst. 4 2 (1982) 258-282
16. Müller-Olm M., Rüthing O., and Seidl H. Checking Herbrand equalities and beyond. VMCAI. LNCS vol. 3385 (2005), Springer 79-96
17. Müller-Olm, M., Seidl, H., 2004. A note on Karr's algorithm. In: 31st International Colloquium on Automata, Languages and Programming, pp. 1016-1028
18. Niehren J., Pinkal M., and Ruhrberg P. On equality up-to constraints over finite trees, context unification, and one-step rewriting. CADE-14. LNCS vol. 1249 (1997) 34-48
19. Niehren, J., Pinkal, M., Ruhrberg, P., 1997b. A uniform approach to underspecification and parallelism. In: 35th ACL'97, Madrid, pp. 410-417
20. Paterson M.S., and Wegman M.N. Linear unification. J. Comput. System Sci. 16 (1978) 158-167
21. Schmidt-Schauß M. A decision algorithm for stratified context unification. J. Logic Comput. 12 6 (2002) 929-953
22. Schmidt-Schauß M., and Schulz K.U. On the exponent of periodicity of minimal solutions of context equations. Proc. RTA. LNCS vol. 1379 (1998), Springer-Verlag 61-75
23. Schmidt-Schauß M., and Schulz K.U. Solvability of context equations with two context variables is decidable. J. Symbolic Comput. 33 1 (2002) 77-122