Journal Article
@Article
Artikel in Fachzeitschrift


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor(s)

Author(s):

Podelski, Andreas
Smolka, Gert

dblp
dblp



BibTeX cite key*:

CP:95TCS

Title

Title*:

Situated Simplification

Journal

Journal Title*:

Theoretical Computer Science

Journal's URL:


Download URL
for the article:


Language:

English

Publisher

Publisher's
Name:


Publisher's URL:


Publisher's
Address:


ISSN:


Vol, No, pp, Date

Volume*:

173

Number:

1

Publishing Date:

February 1997

Pages*:

235-252

Number of
VG Pages:


Page Start:


Page End:


Sequence Number:


DOI:


Note, Abstract, ©

Note:

Preliminary Version in Ugo Montanari, editor, Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95). Springer LNCS 976, 1995.

(LaTeX) Abstract:

Testing satisfaction of guards is the essential operation of
concurrent constraint programming ({\footnotesize CCP}) systems. We
present and prove correct, for the first time, an incremental
algorithm for the simultaneous tests of entailment and disentailment
of rational tree constraints to be used in {\footnotesize CCP}
systems with deep guards (\eg, in {\footnotesize AKL} or in Oz).
The algorithm is presented as the {\em simplification\/} of the
constraints which form the (possibly deep) guards and which are {\em
situated\/} at different nodes in a tree (of arbitrary depth). The
nodes correspond to local computation spaces. In this algorithm,
a variable may have multiple bindings (which each represent a
constraint on that same variable in a different node). These may be
realized in various ways. We give a simple fixed-point algorithm
and use it for proving that the tests implemented by another,
practical algorithm are correct and complete for entailment and
disentailment. We formulate the results in this paper for rational
tree constraints; they can be adapted to finite and feature trees.

URL for the Abstract:


Categories,
Keywords:

Constraints, Concurrency, Programming Languages, rational trees

HyperLinks / References / URLs:

http://www.mpi-sb.mpg.de/~podelski

Copyright Message:


Personal Comments:


Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography


BibTeX Entry:

@ARTICLE{CP:95TCS,
AUTHOR = {Podelski, Andreas and Smolka, Gert},
TITLE = {Situated Simplification},
JOURNAL = {Theoretical Computer Science},
YEAR = {1997},
NUMBER = {1},
VOLUME = {173},
PAGES = {235--252},
MONTH = {February},
NOTE = {Preliminary Version in Ugo Montanari, editor, Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95). Springer LNCS 976, 1995.},
}


Entry last modified by Uwe Brahm, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Andreas Podelski
Created
05/01/1997 03:34:23 PM
Revisions
2.
1.
0.

Editor(s)
Uwe Brahm
Uwe Brahm
Andreas Podelski

Edit Dates
02/26/98 04:10:50 PM
09.05.97 14:09:46
01/05/97 15:34:24