English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Situated Simplification

Podelski, A., & Smolka, G. (1997). Situated Simplification. Theoretical Computer Science, 173(1), 235-252.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Podelski, Andreas1, Author           
Smolka, Gert, Author
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-121997
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 519471
Other: Local-ID: C1256104005ECAFC-11AFF70DEB677793C125648A004A8F74-CP:95TCS
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Theoretical Computer Science
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 173 (1) Sequence Number: - Start / End Page: 235 - 252 Identifier: -