Generating data flow analysis algorithms from modal specifications
- 31 October 1993
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 21 (2) , 115-139
- https://doi.org/10.1016/0167-6423(93)90003-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- A framework for construction and evaluation of high-level specifications for program analysis techniquesACM SIGPLAN Notices, 1989
- The ergo support system: an integrated set of tools for prototyping integrated environmentsACM SIGPLAN Notices, 1988
- A fast algorithm for code movement optimisationACM SIGPLAN Notices, 1988
- Automatic verification of finite state concurrent system using temporal logic specificationsPublished by Association for Computing Machinery (ACM) ,1983
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- A denotational framework for data flow analysisActa Informatica, 1982
- Global optimization by suppression of partial redundanciesCommunications of the ACM, 1979
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955