Results 201 to 210 of about 5,812 (235)
Some of the next articles are maybe not open access.
An axiomatic semantics for ioco s _ conformance relation
Journal of Logical and Algebraic Methods in Programming, 2018CARLOS Gregorio-Rodríguez +2 more
exaly +2 more sources
An axiomatic semantics for nested concurrency
BIT, 1986zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Semantics and axiomatics of a simple recursive language.
Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74, 1974In this paper, we provide a simple recursive programming language with a semantics and a formal proof system, along the lines of [5], [17] and [23]. We show that the semantics used is the “best” possible if one admits the validity of Algol's copy rule, and that the proof system is complete with respect to the semantics. The definitions and methods used
Bruno Courcelle, Jean Vuillemin
openaire +1 more source
A complete axiomatic semantics of spawning
Distributed Computing, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Fen—an axiomatic basis for program semantics
Communications of the ACM, 1973A formal system is presented which abstracts the notions of data item, function, and relation. It is argued that the system is more suitable than set theory (or its derivatives) for the concise and accurate description of program semantics. It is shown how the system can be used to build composite data types out of simpler ones with the operations of ...
openaire +2 more sources
1988
This paper discusses some fundamental issues related to the construction of semantically based axiomatic proof systems for reasoning about program behavior. We survey foundational work in this area, especially early work of Hoare and Cook on while-programs, and we try to pinpoint the principal ideas contained in this work and to suggest criteria for an
openaire +1 more source
This paper discusses some fundamental issues related to the construction of semantically based axiomatic proof systems for reasoning about program behavior. We survey foundational work in this area, especially early work of Hoare and Cook on while-programs, and we try to pinpoint the principal ideas contained in this work and to suggest criteria for an
openaire +1 more source
Axiomatization of trace semantics for stochastic nondeterministic processes
First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings., 2004We give a complete axiomatization of trace distribution precongruence for probabilistic nondeterministic processes based on a process algebra that includes internal behavior and recursion. The axiomatization is given for two different semantics of the process algebra that are consistent with the alternating model of Hansson and the non-alternating ...
PARMA, Augusto, SEGALA, Roberto
openaire +2 more sources
An axiomatic approach to semantics of specification languages
2005The paper proposes an axiomatic approach to semantics of specification languages. It introduces the notion of a semantical system as a framework to discuss and compare various approaches to specification of (algebraic) data types and to spell out their underlying assumptions.
Johann A. Makowsky, Bernd Mahr
openaire +1 more source
Axiomatic semantics of indirect addressing
1981The assignments of form EXPσ (tl,...tn):=r have been studied and applied to arrays and pointers.
openaire +1 more source
Towards General Axiomatizations for Bisimilarity and Trace Semantics
2021We study general equational characterizations for bisimulation and trace semantics via the respective post-/pre-metaequivalences defined on the ULTraS metamodel. This yields axiomatizations encompassing those appeared in the literature, as well as new ones, for bisimulation and trace equivalences when applied to specific classes of processes.
openaire +1 more source