(Enter summary)
Abstract: this paper. (Update)
Context of citations to this paper: More
...variable in the least solution of Eq . It turns out that the set constraints generated are a variant of those studied in [CP97, TDT00] so that the nonemptiness problem can be solved by a suitable adaptation of standard techniques (section 3) In particular, we give a...
...variable in the least solution of Eq . It turns out that the set constraints generated are a variant of those studied in [CP97,TDT00] so that the nonemptiness problem can be solved by a suitable adaptation of standard techniques (section 3) In particular, we give a...
Cited by: More
Is It Possible to Decide Whether a Cryptographic Protocol Is .. - Common, Shmatikov
(Correct)
Structural Subtyping of Non-Recursive Types is Decidable - Kuncak, Rinard (2003)
(Correct)
Atomic Set Constraints with Projection - Witold Charatonik And (2002)
(Correct)
Similar documents (at the sentence level):
32.1%: Set Constraints with Intersection - Charatonik, Podelski
(Correct)
Active bibliography (related documents): More All
1.4: Set Constraints: a Pearl in Research on Constraints - Pacholski, Podelski (1997)
(Correct)
0.7: The Independence Property of a Class of Set Constraints - Charatonik, Podelski (1996)
(Correct)
0.6: Ezy Mnogo'sciowe W Pewnych Teoriach R'owno'sciowych - Witold Charatonik
(Correct)
Similar documents based on text: More All
1.1: Entailment of Set Constraints is not Feasible - Müller, Niehren (1997)
(Correct)
1.0: Entailment of Atomic Set Constraints is PSPACE-Complete - Niehren, Müller, Talbot (1998)
(Correct)
0.6: Inclusion Constraints over Non-empty Sets of Trees - Müller, Niehren, Podelski (1997)
(Correct)
Related documents from co-citation: More All
23: Set constraints with projections are in NEXPTIME
- Charatonik, Pacholski - 1994
22: A decision procedure for a class of set constraints
- Heintze, Jaffar - 1990
21: Set constraints are the monadic class
- Bachmair, Ganzinger et al. - 1993
BibTeX entry: (Update)
W. Charatonik and A. Podelski. Set constraints with intersection. submitted for publication. http://www.mpi-sb.mpg.de/~podelski/papers/intersection.ps. http://citeseer.ist.psu.edu/381535.html More
@inproceedings{ charatonik97set,
author = "Witold Charatonik and Andreas Podelski",
title = "Set Constraints with Intersection",
booktitle = "Logic in Computer Science",
pages = "362-372",
year = "1997",
url = "citeseer.ist.psu.edu/381535.html" }
Citations (may not include all citations):
207
Flow analysis and optimization of lisp-like structures (context) - Jones, Muchnick - 1979
165
Theoretical Computer Science (context) - Kozen, set - 1996
157
Soft typing with conditional types
- Aiken, Wimmers et al. - 1994
131
Set based program analysis
- Heintze - 1992
113
Akademiai Kiado (context) - ecseg, Steinby - 1984
111
Solving systems of set constraints (context) - Aiken, Wimmers - 1992
105
Records for Logic Programming
- Smolka, Treinen - 1994
102
Tree automata techniques and applications
- Comon, Dauchet et al.
94
Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984
94
A finite presentation theorem for approximating logic progra..
- Heintze, Jaffar - 1990
82
A decision procedure for a class of set constraints
- Heintze, Jaffar - 1991
82
A decision procedure for a class of set constraints
- Heintze, Jaffar - 1990
81
Handbook of Theoretical Computer Science (context) - Thomas - 1990
76
Set constraints are the monadic class
- Bachmair, Ganzinger et al. - 1993
66
Declaration-free type checking (context) - Mishra, Reddy - 1985
63
Automatic computation of data set definitions (context) - Reynolds - 1969
57
A logic programming view of CLP
- Maher - 1993
57
The complexity of set constraints
- Aiken, Kozen et al. - 1993
53
Static type inference in a dynamically typed language
- Aiken, Murphy - 1991
52
Decidability of systems of set constraints with negative con..
- Aiken, Kozen et al. - 1995
50
Solving systems of set constraints with negated subset relat.. (context) - Gilleron, Tison et al. - 1993
45
Haskell overloading is DEXPTIME-complete (context) - Seidl - 1994
44
Set constraints with projections are in NEXPTIME
- Charatonik, Pacholski - 1994
42
Negative set constraints with equality
- Charatonik, Pacholski - 1994
39
Set constraints and set-based analysis
- Heintze, Jaffar - 1994
38
Set constraints with intersection
- Charatonik, Podelski - 1997
36
Logical aspects of set constraints
- Kozen - 1993
34
Solving systems of set constraints using tree automata (context) - Gilleron, Tison et al. - 1993
29
Solving classes of set constraints with tree automata
- Devienne, Talbot et al. - 1997
28
Information and Computation (context) - Comon, Haberstrau et al. - 1994
26
Systems of set constraints with negative constraints are NEX.. (context) - Stefansson - 1994
23
Experience with a type evaluator (context) - Young, O'Keefe - 1988
21
Logic programs as types for logic programs (context) - uhwirth, Shapiro et al. - 1991
21
A feature-based constraint system for logic programming with.. (context) - t-Kaci, Podelski et al. - 1994
21
Set-based analysis of reactive infinite-state systems
- Charatonik, Podelski - 1998
21
A constraint sequent calculus (context) - Lassez, McAloon - 1990
18
applications and future directions (context) - Aiken, Results - 1994
18
Set constraints and logic programming
- Kozen - 1994
17
Set constraints - a pearl in research on constraints
- Pacholski, Podelski - 1997
17
Tarskian set constraints
- McAllester, Givan et al. - 1996
16
Constraint-based query optimization for spatial databases
- Helm, Marriott et al. - 1991
16
Inclusion constraints over non-empty sets of trees
- uller, Niehren et al. - 1997
13
A complete Gentzen-style axiomatization for set constraints
- Cheng, Kozen - 1996
13
Co-definite set constraints
- Charatonik, Podelski - 1998
12
The independence property of a class of set constraints
- Charatonik, Podelski - 1996
11
Entailment of atomic set constraints is PSPACE-complete
- uller, Niehren et al. - 1999
11
Sorted unification using set constraints
- Uribe - 1992
10
Applications of a canonical form for generalized linear cons.. (context) - Lassez, McAloon - 1988
9
Set based analysis of arithmetic (context) - Heintze - 1993
8
Constrained dependencies
- Maher - 1995
8
Entailment and disentailment of order-sorted feature constra.. (context) - t-Kaci, Podelski - 1993
7
trees in set-based program analysis (context) - Charatonik, Podelski et al. - 2000
7
Set constraints in some equational theories (context) - Charatonik - 1998
6
Set-based analysis for logic programming and tree automata
- Devienne, Talbot et al. - 1997
2
Generalized definite set constraints (context) - Talbot, Devienne et al. - 2000
2
Tarskian set constraints are in NEXPTIME
- Mielniczuk, Pacholski - 1998
2
Co-definite set constraints with membership expressions (context) - Devienne, Talbot et al. - 1998
1
Nonemptiness of 1-letter finite automata intersection (context) - Podelski, Voronkov - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-sb.mpg.de/~witold/): More
Solving Set Constraints for Greatest Models - Charatonik, Podelski (1997)
(Correct)
Set-based Error Diagnosis of Concurrent Constraint Programs - Podelski, Charatonik, Müller (1997)
(Correct)
The Independence Property of a Class of Set Constraints - Charatonik, Podelski (1996)
(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