The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
Concurrent Programming Concepts
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Towards dataflow analysis of communicating finite state machines
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Analysis of timing hazards in Ada programs
CSC '93 Proceedings of the 1993 ACM conference on Computer science
An integrated method for effective behaviour analysis of distributed systems
ICSE '94 Proceedings of the 16th international conference on Software engineering
Context-sensitive synchronization-sensitive analysis is undecidable
ACM Transactions on Programming Languages and Systems (TOPLAS)
High level programming for distributed computing
Communications of the ACM
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tractable Dataflow Analysis for Distributed Systems
IEEE Transactions on Software Engineering
Automata theoretic techniques for modal logics of programs: (Extended abstract)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Specialization of CML message-passing primitives
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.02 |
Data flow analysis is a technique essential to the compile-time optimization of computer programs, wherein facts relevant to program optimizations are discovered by the global propagation of facts obvious locally.This paper extends flow analysis techniques developed for sequential programs to the analysis of communicating, concurrent processes.