Results 161 to 170 of about 481 (199)

Axiomatic semantics of a hardware specification language

[1992] Proceedings of the Second Great Lakes Symposium on VLSI, 2003
Formal hardware design verification is to examine whether a structural specification of a circuit meets its behavioral specification. Despite the progress in formal verification, there is a big gap between hardware designers and verifiers, partially because there are no common specification languages for them to use.
Xin Hua, Hantao Zhang 0001
openaire   +1 more source

An axiomatic semantics for nested concurrency

BIT, 1986
zbMATH 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, 1974
In 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, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Semantically based axiomatics

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

Fen—an axiomatic basis for program semantics

Communications of the ACM, 1973
A 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

Axiomatization of trace semantics for stochastic nondeterministic processes

First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings., 2004
We 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

2005
The 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

1981
The assignments of form EXPσ (tl,...tn):=r have been studied and applied to arrays and pointers.
openaire   +1 more source

Axiomatic Characterisations of Argumentation Semantics

Proceedings of the TwentySecond International Conference on Principles of Knowledge Representation and Reasoning
The evaluation of argument strength lies at the core of any argumentation system. Numerous semantics have been proposed for this purpose, along with a variety of principles (or axioms) that such semantics are expected to satisfy. Most existing semantics in the literature have been analyzed and compared in light of these principles.
openaire   +1 more source