Program analysis via graph reachability
- 1 December 1998
- journal article
- Published by Elsevier in Information and Software Technology
- Vol. 40 (11-12) , 701-726
- https://doi.org/10.1016/s0950-5849(98)00093-7
Abstract
No abstract availableThis publication has 78 references indexed in Scilit:
- Slicing programs with arbitrary control-flowPublished by Springer Nature ,2005
- On slicing programs with jump statementsACM SIGPLAN Notices, 1994
- Type inclusion constraints and type inferencePublished by Association for Computing Machinery (ACM) ,1993
- Static type inference in a dynamically typed languagePublished by Association for Computing Machinery (ACM) ,1991
- Implementing regular tree expressionsPublished by Springer Nature ,1991
- Algorithms for Finding Patterns in StringsPublished by Elsevier ,1990
- The parallel complexity of simple chain queriesPublished by Association for Computing Machinery (ACM) ,1987
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- An efficient way to find the side effects of procedure calls and the aliases of variablesPublished by Association for Computing Machinery (ACM) ,1979
- The method of attributes for data flow analysisActa Informatica, 1978