Results 61 to 70 of about 188,404 (207)

Operational Semantics of Games

open access: yesCoRR, 2019
We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used widely to reason on the behaviors of systems (not only computational systems) with game theory supported.
openaire   +2 more sources

Inductive assertions and operational semantics [PDF]

open access: yesInternational Journal on Software Tools for Technology Transfer, 2003
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes only the proof obligations that would be produced by a verification condition generator but does not require the definition of a verification condition generation.
openaire   +2 more sources

Formal Semantics of ABN Framework

open access: yes, 2008
This technical document extend upon and give formal meaning to the syntactic definitions presented in [7] and forwards the formal semantics of our argumentation-based negotiation (ABN) dialogue game protocol, which allows agents to argue, negotiate and ...
Karunatillake, Nishan C   +9 more
core   +1 more source

Operational Algorithmic Game Semantics

open access: yes2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2023
We consider a simply-typed call-by-push-value calculus with state, and provide a fully abstract trace model via a labelled transition system (LTS) in the spirit of operational game semantics. By examining the shape of configurations and performing a series of natural optimisation steps based on name recycling, we identify a fragment for which the LTS ...
Benedict Bunting, Andrzej S. Murawski
openaire   +2 more sources

Probabilistic Operational Semantics for the Lambda Calculus [PDF]

open access: yes, 2012
Probabilistic operational semantics for a nondeterministic extension of pure λ-calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values.
DAL LAGO U., ZORZI, Margherita
core   +3 more sources

A Verified Algebra for Linked Data [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
A foundation is investigated for the application of loosely structured data on the Web. This area is often referred to as Linked Data, due to the use of URIs in data to establish links.
Ross Horne, Vladimiro Sassone
doaj   +1 more source

Circuit Implementation of Variable-Order Scaling Fractal-Ladder Fractor with High Resolution

open access: yesFractal and Fractional, 2022
Extensive research has been conducted on the scaling fractal fractor using various structures. The development of high-resolution emulator circuits to achieve a variable-order scaling fractal fractor with high resolution is a major area of interest.
Bo Yu, Yifei Pu, Qiuyan He, Xiao Yuan
doaj   +1 more source

An Operational Semantics for Yul

open access: yes
We present a big-step and small-step operational semantics for Yul -- the intermediate language used by the Solidity compiler to produce EVM bytecode -- in a mathematical notation that is congruous with the literature of programming languages, lends itself to language proofs, and can serve as a precise, widely accessible specification for the language.
Vasileios Koutavas   +2 more
openaire   +3 more sources

Denotational and operational semantics for prolog

open access: yesThe Journal of Logic Programming, 1988
The semantics of PROLOG programs is usually given in terms of the model theory of first-order logic. However, this does not adequately characterize the computational behavior of PROLOG programs. PROLOG implementations typically use a sequential evaluation strategy based on the textual order of clauses and literals in a program, as well as nonlogical ...
Saumya K. Debray, Prateek Mishra
openaire   +1 more source

A trajectory-based strict semantics for program slicing

open access: yes, 2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Weiser (which only considered terminating ones) and, as such, is an accurate ...
Kiss, A   +26 more
core   +1 more source

Home - About - Disclaimer - Privacy