Results 161 to 170 of about 11,408 (204)
, 1994 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fundamenta Informaticae, 1996
This is an essay where the author expresses his views on applied denotational semantics. In the author's opinion, whether a software system has or does not have a sufficiently abstract denotational semantics should be regarded as a pragmatic attribute of the system rather than merely as a mathematical attribute of its description.
openaire +3 more sources
This is an essay where the author expresses his views on applied denotational semantics. In the author's opinion, whether a software system has or does not have a sufficiently abstract denotational semantics should be regarded as a pragmatic attribute of the system rather than merely as a mathematical attribute of its description.
openaire +3 more sources
Proceedings Third IEEE International Workshop on Source Code Analysis and Manipulation, 2004
We show that CPP, the preprocessor of the C language, can be seen as a programming language in which directives are statements, parametrized macros are functions, files are procedures, directories are modules, and command lines are programs. The semantics of CPP can therefore be described using traditional techniques.
openaire +1 more source
We show that CPP, the preprocessor of the C language, can be seen as a programming language in which directives are statements, parametrized macros are functions, files are procedures, directories are modules, and command lines are programs. The semantics of CPP can therefore be described using traditional techniques.
openaire +1 more source
A denotational semantics of $LC2$
Archive for Mathematical Logic, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Continuous Denotational Semantics
1991The development of a programming logic in the scope of classical first -order logic is connected with making the formal notions, used to describe program properties, internal. This can be ensured by defining the definability of these notions in the logic in question.
Tamás Gergely, László Úry
openaire +1 more source
Denotational semantics of concurrency
Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82, 1982A general framework for the denotational treatment of concurrency is introduced. The key idea is the notion of process which is element of a domain obtained as solution of a domain equation in the style as considered previously by Plotkin. We use tools from metric topology as advocated by Nivat to solve this equation, show how operations upon processes
J. W. de Bakker, J. I. Zucker
openaire +1 more source
Definable Denotational Semantics
1991In 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
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
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, 2003Modern 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