AbstractThis paper describes the systematic use of fixpoints for the relational semantics of unboundedly nondeterministic sequential programs. The focus is on analysing the expressiveness of various semantic definitions and of powerdomains including or excluding an ‘error’ element ⊥
AbstractNondeterminism is introduced into an ordinary iterative programming language by treating pro...
A relational semantics is a mapping of programs to relations. We consider that the input-output sema...
AbstractNondeterministic extensions are needed in logic-based languages, such as first-order relatio...
AbstractThis paper describes the systematic use of fixpoints for the relational semantics of unbound...
AbstractAbstract relational algebra is proposed as a practical means to describe the denotational se...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
Much of relational algebra and the underlying principles of relational data-base design have a simpl...
Relational constraint is a new method for fast semantic analysis of computer programs. It starts wi...
The point-free relational calculus has been very successful as a language for discussing general pro...
This paper contains the description of a system for handling semantics of computer programs. The met...
Programming languages with countable nondeterministic choice arecomputationally interesting since co...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
International audienceWe propose the first framework for defining relational program logics for arbi...
We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoi...
A program construct is proposed, for which the assumption of bounded nondeterminism is not natural. ...
AbstractNondeterminism is introduced into an ordinary iterative programming language by treating pro...
A relational semantics is a mapping of programs to relations. We consider that the input-output sema...
AbstractNondeterministic extensions are needed in logic-based languages, such as first-order relatio...
AbstractThis paper describes the systematic use of fixpoints for the relational semantics of unbound...
AbstractAbstract relational algebra is proposed as a practical means to describe the denotational se...
AbstractMuch of relational algebra and the underlying principles of relational database design have ...
Much of relational algebra and the underlying principles of relational data-base design have a simpl...
Relational constraint is a new method for fast semantic analysis of computer programs. It starts wi...
The point-free relational calculus has been very successful as a language for discussing general pro...
This paper contains the description of a system for handling semantics of computer programs. The met...
Programming languages with countable nondeterministic choice arecomputationally interesting since co...
AbstractThe variety of semantical approaches that have been invented for logic programs is quite bro...
International audienceWe propose the first framework for defining relational program logics for arbi...
We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoi...
A program construct is proposed, for which the assumption of bounded nondeterminism is not natural. ...
AbstractNondeterminism is introduced into an ordinary iterative programming language by treating pro...
A relational semantics is a mapping of programs to relations. We consider that the input-output sema...
AbstractNondeterministic extensions are needed in logic-based languages, such as first-order relatio...
DOI
Add to ORKG