Problems concerning formal semantics for Clock Constraint Specification Language (CCSL) are considered in the paper. CCSL is intended for describing logical time models for real-time embedded systems and the language is a part of UML profile for MARTE. There exist two approaches to introduce a denotational semantics for CCSL. A pure relational subset of CCSL is defined in the paper. The notion ...

Most probabilistic programming languages for Bayesian inference give either operational semantics in terms of sampling, or denotational semantics in terms of measure-theoretic distributions. It is important that we can relate the two, given that practitioners often reason both analytically (e.g., density) as well as algorithmically (i.e., in terms of sampling) about distributions. In this paper...

For a simple probabilistic language we present a semantics based on linear operators on infinite dimensional Hilbert spaces. We show the equivalence of this semantics with a standard operational one and we discuss its relationship with the well-known denotational semantics introduced by Kozen. For probabilistic programs, it is typical to use Banach spaces and their norm topology to model the pr...

This paper investigates three significant questions of Verilog’s operational semantics: soundness, completeness and non-redundancy. Our understanding for these three questions is denotational-based. We provide an operational semantics for Verilog and prove that our operational semantics is sound, complete and non-redundant.

In formal argumentation, grounded semantics is well known for yielding exactly one unique extension. Since grounded semantics has a very sceptical nature, one can ask the question whether it is possible to define a unique extension semantics that is more credulous. Recent work of Dung, Mancarella and Toni proposes what they call ideal semantics, which is a unique extension semantics that is mor...

In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics. We define in this setting an analogue of fair testing equivalence, which we prove fully abstract w.r.t. standard fair testing equivalence. The proof relies on a new algebraic notion called playground, which represents the ‘rule...

This chapter presents a dynamic denotational semantics of the Java programming language. This semantics covers almost the full range of the base language, excluding only concurrency and the API's. A discussion of these limitations is provided in the nal section of the chapter. The abstract syntax described in Chapter 1 tells us how to construct a grammatically correct program. Every syntactical...

A hybrid automaton [16,2] is a digital, real-time system that interacts with an analogue environment. Hybrid automata are ubiquitous in all areas of modern engineering and technology. For example, the (digital) height control of an automobile chassis depends on and influences the (continuous) driving conditions of the vehicle [22]. Hybrid automata typically operate in safety critical areas, suc...

One of the most important problems in the sequence design is to find sequences with good correlation properties. Recently, expect for the binary Pseudo-Random Sequences (PRSs), much progress has been obtained for ternary and p-ary PRSs. In this paper a short survey of p-ary PRSs and their properties is made. As a result their classification is suggested without claiming its full completeness.

A semantics to a small fragment of Java capturing the new memory model (JMM) described in the Language Specification is given by combining operational, denotational and axiomatic techniques in a novel semantic framework. The operational steps (specified in the form of SOS) construct denotational models (configuration structures) and are constrained by the axioms of a configuration theory. The s...