Results 211 to 220 of about 11,766 (228)

Definable Denotational Semantics

1991
In this chapter we show how an appropriate first-order language can be built up to describe the properties of rP σ 1 -programs. Here we also use the logical tools introduced in Chapter 13, and the method of the development of the required dynamic logics is similar to that used in the previous chapter.
Tamás Gergely, László Úry
openaire   +1 more source

Denotational Semantics

1995
Abstract Designers, implementers, and serious users of a programming language need a complete and accurate understanding of the semantics (the intended meaning) of every construct of that language. The semantic descriptions in reference manuals and language standards are almost always inadequate because they are based primarily on ...
openaire   +1 more source

Extending CSP: denotational semantics

IEE Proceedings - Software, 2003
Modern CSP is an algebra which describes processes which engage in events. Its characteristic comprehensiveness combined with simplicity arises in large part from the fact that it was originally defined by a denotational semantics. This sets it apart from other process algebras.
openaire   +1 more source

Denotational Semantics of IMP

2017
In this chapter we give a more abstract, purely mathematical semantics to IMP, called denotational semantics. The operational semantics is close to the memory-based, executable machine-like view: given a program and a state, we derive the state obtained after the execution of that program.
Roberto Bruni, Ugo Montanari
openaire   +1 more source

Denotational semantics for RTPA

Canadian Conference on Electrical and Computer Engineering, 2005., 2006
Real-time process algebra (RTPA) is designed to deal with a rich set of fundamental real-time processes such as timing, interrupt, concurrency, and event/time-driven. Some of the RTPA processes cannot be described adequately in conventional denotational semantics paradigms. This paper develops a new framework for modeling time and processes in order to
null Xinming Tan, null Yingxu Wang
openaire   +1 more source

Denotational semantics for JSD

Proceedings of Joint 4th International Computer Science Conference and 4th Asia Pacific Software Engineering Conference, 2002
This paper discusses the use of denotational semantics in formalizing the notations of structured methods. Using the Jackson System Development (JSD) method as an example, the techniques of denotational semantics are applied to the JSD notations to give them a formal semantics based on lambda calculus and communicating sequential processes (CSP). A JSD
openaire   +1 more source

Denotational Semantics of HOFL

2017
In this chapter we exploit the domain theory from Chapter 8 to define the (lazy) denotational semantics of HOFL. For each type τ we introduce a corresponding domain (V τ )⊥ which is defined inductively over the structure of τ and such that we can assign an element of the domain (V τ )⊥ to each (closed and typable) term t with type τ.
Roberto Bruni, Ugo Montanari
openaire   +1 more source

Domains for denotational semantics

1982
The purpose of the theory of domains is to give models for spaces on which to define computable functions. The kinds of spaces needed for denotational sematics involve not only spaces of higher type (e.g. function spaces) but also spaces defined recursively (e.g. reflexive domains).
openaire   +1 more source

Foundations of denotational semantics

1980
Chapters I and II of this paper provide an elementary introduction to the mathematical theory underlying the denotational semantic definition techniques described in this volume; the next two chapters discuss some techniques of use in reasoning about such definitions, and Chapter V describes one way of handling the semantics of languages involving ...
openaire   +1 more source

Denotational Semantics

2014
Tobias Nipkow, Gerwin Klein
openaire   +1 more source