Results 191 to 200 of about 5,812 (235)

The Axiomatic Semantics of PDFD

2008 Japan-China Joint Workshop on Frontier of Computer Science and Technology, 2008
The integration of formal, structured and object-oriented methodology is the focus in the field of software development methodology. SOZL (structured methodology + object-oriented methodology + Z language) is a language that attempts to integrate structured method, object-oriented method and formal method.
Huaikou Miao
exaly   +2 more sources

Axiomatic definitions for data model semantics

Information Systems, 1982
Abstract The axiomatic method, a widely accepted technique for the precise (formal) definition of programming language semantics, is used to define data model semantics. First, a definition of the term “data model” is developed. The strong relationship between database and programming language concepts is discussed.
Michael L Brodie
exaly   +3 more sources

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.
Amgoud, Leila
openaire   +2 more sources

Axiomatic semantics of communicating sequential processes

ACM Transactions on Programming Languages and Systems, 1984
Summary: A simple definition of the axiomatic semantics of Communicating Sequential Processes is presented. The most important aspect of the approach is that it allows dealing with the individual processes of a program in isolation from the other processes. The axiomatic semantics is used to prove the correctness of a program for partitioning sets.
N Soundararajan
exaly   +3 more sources

Axiomatic semantics of projection temporal logic programs

Mathematical Structures in Computer Science, 2010
In this paper, we investigate the axiomatic semantics of the projection temporal logic programming language MSVL. To this end, we employ Propositional Projection Temporal Logic (PPTL) as an assertion language to specify the desired properties. We give a set of state axioms and state inference rules.
Xiaoxiao Yang, Zhenhua Duan, Qian Ma
core   +3 more sources

An empirical and axiomatic comparison of ranking-based semantics for abstract argumentation

Journal of Applied Non-Classical Logics, 2023
International audienceArgumentation is the process of evaluating and comparing a set of arguments. A way to compare them consists in using a ranking-based semantics which rank-order arguments from the most to the least acceptable ones. Recently, a number
Elise Bonzon, Jérôme Delobelle, Sébastien Konieczny   +2 more
exaly   +2 more sources

In Defence of Axiomatic Semantics

2012
Fox, C, Turner, R
exaly   +2 more sources

Axiomatic semantics for compiler verification

Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016
Based on constructive type theory, we study two idealized imperative languages GC and IC and verify the correctness of a compiler from GC to IC. GC is a guarded command language with underspecified execution order defined with an axiomatic semantics. IC is a deterministic low-level language with linear sequential composition and lexically scoped gotos ...
Steven Schäfer, Sigurd Schneider, Gert Smolka   +2 more
openaire   +1 more source

Operational and axiomatic semantics of PCF

Proceedings of the 1990 ACM conference on LISP and functional programming, 1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms for PCF include e-equivalence and the so-called “surjective pairing” axiom for pairs.
Brian T. Howard, John C. Mitchell
openaire   +1 more source

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