A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
An Algorithm for Structuring Flowgraphs
Journal of the ACM (JACM)
Communications of the ACM
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Proceedings of a symposium on Compiler optimization
Global common subexpression elimination
Proceedings of a symposium on Compiler optimization
Parsing flowcharts and series-parallel graphs.
Parsing flowcharts and series-parallel graphs.
The program structure tree: computing control regions in linear time
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
On the time overhead of counters and traversal markers
ICSE '81 Proceedings of the 5th international conference on Software engineering
ICSE '81 Proceedings of the 5th international conference on Software engineering
Global data flow analysis by decomposition into primes
ICSE '82 Proceedings of the 6th international conference on Software engineering
The Refined Process Structure Tree
BPM '08 Proceedings of the 6th International Conference on Business Process Management
The refined process structure tree
Data & Knowledge Engineering
The Triconnected Abstraction of Process Models
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Unveiling Hidden Unstructured Regions in Process Models
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Simplified computation and generalization of the refined process structure tree
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Towards a compiler for business-IT systems: a vision statement complemented with a research agenda
CEE-SET'08 Proceedings of the Third IFIP TC 2 Central and East European conference on Software engineering techniques
Business process model abstraction: a definition, catalog, and survey
Distributed and Parallel Databases
| Hi-index | 0.01 |
A parsing method based on the triconnected decomposition of a biconnected graph is presented. The parsing algorithm runs in linear time and handles a large class of flow graphs. The applications of this algorithm to flow analysis and to the automatic structuring of programs are discussed.