Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMay 2008
On the complexity of partially-flow-sensitive alias analysis
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 30, Issue 3Article No.: 13, Pages 1–28https://doi.org/10.1145/1353445.1353447We introduce the notion of a partially-flow-sensitive analysis based on the number of read and write operations that are guaranteed to be analyzed in a sequential manner. We study the complexity of partially-flow-sensitive alias analysis and show that ...
- articleJanuary 2004
On exponential-time completeness of the circularity problem for attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 26, Issue 1Pages 186–190https://doi.org/10.1145/963778.963783Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata theory, such as writing pushdown acceptor and alternating Turing ...
- articleSeptember 2002
The undecidability of associativity and commutativity analysis
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 24, Issue 5Pages 554–565https://doi.org/10.1145/570886.570889Associativity is required for the use of general scans and reductions in parallel languages. Some systems also require functions used with scans and reductions to be commutative. We prove the undecidability of both associativity and commutativity. Thus, ...
- articleJanuary 2000
Undecidability of context-sensitive data-dependence analysis
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 22, Issue 1Pages 162–186https://doi.org/10.1145/345099.345137A number of program-analysis problems can be tackled by transforming them into certain kinds of graph-reachability problems in labeled directed graphs. The edge labels can be used to filter out paths that are not interest: a path P from vertex s to ...
- articleJanuary 1997
Precise flow-insensitive may-alias analysis is NP-hard
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 19, Issue 1Pages 1–6https://doi.org/10.1145/239912.239913Determining aliases is one of the foundamental static analysis problems, in part because the precision with which this problem is solved can affect the precision of other analyses such as live variables, available expressions, and constant propagation. ...
- articleMarch 1995
A worst case of circularity test algorithms for attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 17, Issue 2Pages 228–232https://doi.org/10.1145/201059.201064Although the circularity test problem for attribute grammars (AGs) has been proven to be intrinsically exponential, to date, a worst case for the existing circularity test algorithms has yet to be presented. This note presents a worst-case AG in which ...
- articleSeptember 1994
The undecidability of aliasing
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 16, Issue 5Pages 1467–1471https://doi.org/10.1145/186025.186041Alias analysis is a prerequisite for performing most of the common program analyses such as reaching-definitions analysis or live-variables analysis. Landi [1992] recently established that it is impossible to compute statically precise alias information—...
- articleOctober 1989
Concurrency in heavily loaded neighborhood-constrained systems
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 11, Issue 4Pages 562–584https://doi.org/10.1145/69558.69560Let G be a connected undirected graph in which each node corresponds to a process and two nodes are connected by an edge if the corresponding processes share a resource. We consider distributed computations in which processes are constantly demanding ...
- articleOctober 1987
Efficient algorithms for automatic construction and compactification of parsing
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 9, Issue 4Pages 543–566https://doi.org/10.1145/29873.29876Several computational problems about grammars are studied. Efficient algorithms are presented for the problems of (1) determining, for a given semantic grammar, if there exists a related parsing grammar in some specified grammar class, and (2) finding ...
- articleOctober 1980
The Activity of a Variable and Its Relation to Decision Trees
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 2, Issue 4Pages 580–595https://doi.org/10.1145/357114.357120The construction of sequential testing procedures from functions of discrete arguments is a common problem in switching theory, software engineering, pattern recognition, and management. The concept of the activity of an argument is introduced, and a ...
- articleOctober 1979
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 1, Issue 2Pages 245–257https://doi.org/10.1145/357073.357079A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from ...