Towards the Implementation of a Source-to-Source Transformation Tool for CHR Operational Semantics

A complete and terminating execution model for Constraint Handling Rules

Theory and Practice of Logic Programming ◽

10.1017/s147106841000030x ◽

2010 ◽

Vol 10 (4-6) ◽

pp. 597-610 ◽

Cited By ~ 9

Author(s):

HARIOLF BETZ ◽

FRANK RAISER ◽

THOM FRÜHWIRTH

Keyword(s):

Program Analysis ◽

Operational Semantics ◽

Constraint Handling ◽

Formal Proofs ◽

Analytical Foundation ◽

Source Transformation ◽

Execution Model ◽

Soundness And Completeness

AbstractWe observe that the various formulations of the operational semantics of Constraint Handling Rules proposed over the years fall into a spectrum ranging from the analytical to the pragmatic. While existing analytical formulations facilitate program analysis and formal proofs of program properties, they cannot be implemented as is. We propose a novel operational semantics ω!, which has a strong analytical foundation, while featuring a terminating execution model. We prove its soundness and completeness with respect to existing analytical formulations and we provide an implementation in the form of a source-to-source transformation to CHR with rule priorities.

Download Full-text

Mind Operational Semantics and Brain Operational Architectonics: A Putative Correspondence

The Open Neuroimaging Journal ◽

10.2174/1874440001004010053 ◽

2010 ◽

Vol 4 (1) ◽

pp. 53-69

Author(s):

Giulio Benedetti

Keyword(s):

Operational Semantics

Download Full-text

Specifying and Executing User Agents in an Environment of Reasoning and RESTful Systems Using the Guard-Stage-Milestone Approach

Journal on Data Semantics ◽

10.1007/s13740-021-00123-0 ◽

2021 ◽

Author(s):

Tobias Käfer ◽

Benjamin Jochum ◽

Nico Aßfalg ◽

Leonard Nürnberg

Keyword(s):

Linked Data ◽

Operational Semantics ◽

Workflow Management ◽

Management Systems ◽

Workflow Management Systems ◽

The Web

AbstractFor Read-Write Linked Data, an environment of reasoning and RESTful interaction, we investigate the use of the Guard-Stage-Milestone approach for specifying and executing user agents. We present an ontology to specify user agents. Moreover, we give operational semantics to the ontology in a rule language that allows for executing user agents on Read-Write Linked Data. We evaluate our approach formally and regarding performance. Our work shows that despite different assumptions of this environment in contrast to the traditional environment of workflow management systems, the Guard-Stage-Milestone approach can be transferred and successfully applied on the web of Read-Write Linked Data.

Download Full-text

Persistent Stochastic Non-Interference

Fundamenta Informaticae ◽

10.3233/fi-2021-2049 ◽

2021 ◽

Vol 181 (1) ◽

pp. 1-35

Author(s):

Jane Hillston ◽

Andrea Marin ◽

Carla Piazza ◽

Sabina Rossi

Keyword(s):

Process Algebra ◽

Operational Semantics ◽

Evaluation Process ◽

Decision Algorithm ◽

Secure Systems ◽

Information Flow Security ◽

Structural Operational Semantics ◽

Timing Properties ◽

Functional Point ◽

Security Property

In this paper, we study an information flow security property for systems specified as terms of a quantitative Markovian process algebra, namely the Performance Evaluation Process Algebra (PEPA). We propose a quantitative extension of the Non-Interference property used to secure systems from the functional point view by assuming that the observers are able to measure also the timing properties of the system, e.g., the response time of certain actions or its throughput. We introduce the notion of Persistent Stochastic Non-Interference (PSNI) based on the idea that every state reachable by a process satisfies a basic Stochastic Non-Interference (SNI) property. The structural operational semantics of PEPA allows us to give two characterizations of PSNI: one based on a bisimulation-like equivalence relation inducing a lumping on the underlying Markov chain, and another one based on unwinding conditions which demand properties of individual actions. These two different characterizations naturally lead to efficient methods for the verification and construction of secure systems. A decision algorithm for PSNI is presented and an application of PSNI to a queueing system is discussed.

Download Full-text

Dynamic game semantics

Mathematical Structures in Computer Science ◽

10.1017/s0960129520000250 ◽

2020 ◽

pp. 1-60

Author(s):

Norihiro Yamada ◽

Samson Abramsky

Keyword(s):

Programming Languages ◽

Functional Programming ◽

Operational Semantics ◽

Dynamic Game ◽

Standard Interpretation ◽

Functional Programming Languages ◽

Game Semantics ◽

Wide Range ◽

Cartesian Closed Categories ◽

Cartesian Closed

Abstract The present work achieves a mathematical, in particular syntax-independent, formulation of dynamics and intensionality of computation in terms of games and strategies. Specifically, we give game semantics of a higher-order programming language that distinguishes programmes with the same value yet different algorithms (or intensionality) and the hiding operation on strategies that precisely corresponds to the (small-step) operational semantics (or dynamics) of the language. Categorically, our games and strategies give rise to a cartesian closed bicategory, and our game semantics forms an instance of a bicategorical generalisation of the standard interpretation of functional programming languages in cartesian closed categories. This work is intended to be a step towards a mathematical foundation of intensional and dynamic aspects of logic and computation; it should be applicable to a wide range of logics and computations.

Download Full-text