Context-Free Language Reachability November 18, 1996  Home/Search
Context
Related
| wisc.edu/wpis/papers/tr1330.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisc.edu/wpis/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show the interconvertibility of context-free-language reachability problems and a class of set-constraint problems: given a context-free-language reachability problem, we show how to construct a set-constraint problem whose answer gives a solution to the reachability problem; given a set-constraint problem, we show how to construct a context-free-language reachability problem whose answer gives a solution to the set-constraint problem. The interconvertibility of these two formalisms... (Update)
Similar documents (at the sentence level):
61.7%: Interconvertibility of Set Constraints and Context-Free.. - Melski, Reps (1998) (Correct)
55.0%: Interconvertibility of a Class of Set Constraints and.. - Melski (1999) (Correct)
Active bibliography (related documents): More All
0.5: Program Generation, Termination, and Binding-time Analysis - Jones, Glenstrup (2002) (Correct)
0.0: A Parallel Algorithm for Transitive Closure - Caceres, Song (Correct)
0.0: Fully Dynamic Transitive Closure: Breaking Through the.. - Demetrescu, Italiano (2000) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ reachability-interconvertibility,
author = "Context-Free Language Reachability",
title = "Interconvertibility of Set Constraints and",
url = "citeseer.ist.psu.edu/765339.html" }
Citations (may not include all citations):390 Interprocedural slicing using dependence graphs - Horwitz, Reps et al. - 1990
131 Set-based program analysis - Heintze - 1992
82 A decision procedure for a class of set constraints - Heintze, Jaffar - 1991
59 Demand interprocedural dataflow analysis - Horwitz, Reps et al.
46 Akad'emiai Kiad'o (context) - G'ecseg, Steinby - 1984
14 Boolean matrix multiplication and transitive closure (context) - Fischer, Meyer - 1971
4 Set based analyis of ML programs (context) - Heintze - 1993
2 BTA termination using CFL-reachability - Das, Reps - 1996
Documents on the same site (http://www.cs.wisc.edu/wpis/papers/): More
Program Generalization for Software Reuse: From C to C++ - Siff, Reps (1996) (Correct)
Modular Pointer Analysis - Susan Horwitz And (Correct)
Weighted Pushdown Systems and Weighted Transducers - Lal, Touili, Kidd, Reps (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC