AbstractWe define for a number of concurrent imperative languages both operational and denotational semantic models as fixed points of contractions on complete metric spaces. Next, we develop a general method for comparing different semantic models by relating their defining contractions and exploiting the fact that contractions have a unique fixed point
AbstractComplete partial orders have been used for a long time for defining semantics of programming...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
AbstractTransition systems as proposed by Hennessy and Plotkin are defined for a series of three lan...
We define for a simple concurrent rmperat~ve language both operational and denotat~onal semantic mod...
A comparative semantic study is made of two notions in concurrency, viz. atomicity and action refine...
AbstractThis paper shows the equivalence of two semantics for a version of Concurrent Prolog with no...
This paper develops a denotation and abstract model based on closure operators for concurrent const...
textabstractWe study the semantics of a simple language with concurrency and recursion. Our semantic...
AbstractWe present a brief tutorial on the use of metric spaces in semantics, with special attention...
In de Bakker and Zucker proposed to use complete metric spaces for the semantic definition of progra...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
Abstract. We propose a denotational model for real time concurrent systems, based on the failures mo...
For an abstract programming language both a linear and a branching denotational semantics are develo...
AbstractFor an abstract programming language both a linear and a branching denotational semantics ar...
AbstractWe introduce a technique - that we name continuation semantics for concurrency (CSC) - which...
AbstractComplete partial orders have been used for a long time for defining semantics of programming...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
AbstractTransition systems as proposed by Hennessy and Plotkin are defined for a series of three lan...
We define for a simple concurrent rmperat~ve language both operational and denotat~onal semantic mod...
A comparative semantic study is made of two notions in concurrency, viz. atomicity and action refine...
AbstractThis paper shows the equivalence of two semantics for a version of Concurrent Prolog with no...
This paper develops a denotation and abstract model based on closure operators for concurrent const...
textabstractWe study the semantics of a simple language with concurrency and recursion. Our semantic...
AbstractWe present a brief tutorial on the use of metric spaces in semantics, with special attention...
In de Bakker and Zucker proposed to use complete metric spaces for the semantic definition of progra...
A framework allowing a unified and rigorous definition of the semantics of concurrency is proposed. ...
Abstract. We propose a denotational model for real time concurrent systems, based on the failures mo...
For an abstract programming language both a linear and a branching denotational semantics are develo...
AbstractFor an abstract programming language both a linear and a branching denotational semantics ar...
AbstractWe introduce a technique - that we name continuation semantics for concurrency (CSC) - which...
AbstractComplete partial orders have been used for a long time for defining semantics of programming...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
AbstractTransition systems as proposed by Hennessy and Plotkin are defined for a series of three lan...
DOI
Add to ORKG