We present a very general technique for deening semantics for programs that use aggregation. We use the technique to extend the well-founded semantics and the valid semantics, both of which were designed to provide semantics for programs with negation, to handle programs that contain possibly recursive use of aggregation. The generalization is based on a simple but powerful idea of aggregation ...

In the present work we examine the causal theory of actions put forward by McCain and Turner [McCain and Turner, 1995] for determining ramifications. Our principal aim is to provide a characterisation of this causal theory of actions in terms of a Shoham-like preferential semantics [Shoham, 1988]. This would have a twofold advantage: it would place McCain and Turner’s theory in perspective, all...

Partial metric spaces were introduced by Matthews in 1994 as a part of the study of denotational semantics of data flow networks. In 2014 Asadi and {it et al.} [New Extension of $p$-Metric Spaces with Some fixed point Results on $M$-metric paces, J. Ineq. Appl. 2014 (2014): 18] extend the Partial metric spaces to $M$-metric spaces. In this work, we introduce the class of $F(psi,varphi)$-contrac...

In the context of security protocols, the so-called Alice&Bob notation is often used to describe the messages exchanged between honest principals in successful protocol runs. While intuitive, this notation is ambiguous in its description of the actions taken by principals, in particular with respect to the conditions they must check when executing their roles and the actions they must take when...

— We study the semantics ofsome nondeterministic languages derivedfrom PCF [8]. In particular we discuss how Milner" s results in [5] can (or cannoi) be applied to obtain models,for our languages, which arefully abstract with respect to the (standard) operational semantics. Résumé. — Nous étudions ici la sémantique de quelques langages non déterministes, dérivés du PCF [8]. En particulier, nous...

Game semantics has been used to interpret both proofs and functional programs: an important further development on the programming side has been to model higher-order programs with state by allowing strategies with “history-sensitive” behaviour. In this paper, we develop a detailed analysis of the structure of these strategies from a logical perspective by showing that they correspond to proofs...

A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for Multiplicative-Additive Linear Logic is proved for this semantics.

In this article, we present a model and a denotational semantics for hybrid systems. Our model is designed so that it may be easily used for modeling large, existing embedded applications, which is a first step toward their validation. The discrete subsystem is modeled by a program written in an extension of an imperative language and the continuous subsystem is modeled by differential equation...

We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators for default reasoning. We extend pcc uniformly over time, to get a synchronous reactive probabilistic programming language, Timed pcc. We describe operational and denotational models for pcc (and Timed pcc). The key feature of ...

We present non-standard denotational specifications of the SSAform and of its conversion processes from and to imperative pro-gramming languages. Thus, we provide a strong mathematicalfoundation for this intermediate code representation language usedin modern compilers such as GCC or Intel CC.More specifically, we provide (1) a new functional approachto SSA, the Static S...