@article {CominiTV11sem,
	title = {A Compact Goal-Independent Bottom-Up Fixpoint Modeling the Behavior of tccp},
	number = {DIMI-UD/01/2011/RR},
	year = {2011},
	publisher = {Dipartimento di Matematica e Informatica, U. di Udine},
	abstract = {The Timed Concurrent Constraint Language (tccp in short) is a concurrent logic language based on the simple but powerful concurrent constraint paradigm of Saraswat. In this paradigm, the notion of store-as-value is replaced by the notion of store-as-constraint, which introduces some dierences w.r.t. other approaches to concurrency.
In this work, we present a new compact, bottom-up semantics for the language that is well suited for abstract interpretation based debugging and verication purposes in the context of reactive systems. The defined semantics is shown to be correct w.r.t. the behavior of tccp. 
We also propose a an abstract semantics that allows us to effectively implement debugging algorithms based on abstract interpretation. This semantics keeps the particular strong synchronization characteristic of the language.},
	url = {http://users.dimi.uniud.it/~marco.comini/Papers/BotUpBehaTCCP/BotUpBehaTCCP11.pdf},
	author = {Marco Comini and Laura Titolo and Alicia Villanueva}
}
