Introduction to the Literature on Semantics

An introduction to the literature on semantics. Included are pointers to the literature on axiomatic semantics, denotational semantics, operational semantics, and type theory

Palaeoecological study of a Weichselian wetland site in the Netherlands suggests a link with Dansgaard-Oeschger climate oscillation

Botanical microfossils, macroremains and oribatid mites of a Weichselian interstadial deposit in the central Netherlands point to a temporary, sub-arctic wetland in a treeless landscape. Radiocarbon dates and OSL dates show an age between ca. 54.6 and 46.6 ka cal BP. The vegetation succession, starting as a peat-forming wetland that developed into a lake, might well be linked with a Dansgaard-Oeschger climatic cycle. We suggest that during the rapid warming at the start of a D-O cycle, relatively low areas in the landscape became wetlands where peat was formed. During the more gradual temperature decline that followed, evaporation diminished; the wetlands became inundated and lake sediments were formed. During subsequent sub-arctic conditions the interstadial deposits were covered with wind-blown sand. Apart from changes in effective precipitation also the climate-related presence and absence of permafrost conditions may have played a role in the formation of the observed sedimentological sequence from sand to peat, through lacustrine sediment, with coversand on top. The Wageningen sequence may correspond with D-O event 12, 13 or 14. Some hitherto not recorded microfossils were described and illustrated

Modular Completeness for Communication Closed Layers

The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL rule cannot be derived from simpler ones. Within a non-modular set-up the CCL rule can be derived however from a simpler independence rule and an analog of the expansion rule for process algebras.\ud Part of this work has been supported by Esprit/BRA Project 6021 (REACT)

Compositional Safety Logics

In this paper we present a generalisation of a promising compositional model-checking technique introduced for finite-state systems by Andersen in [And95] and extended to networks of timedautomata by Larsen et al in [LPY95a, LL95, LPY95b, KLL+97a].In our generalized setting, programs are modelled as arbitrary(possibly infinite-state) transition systems and verified with respectto properties of a basic safety logic. As the fundamentalprerequisite of the compositional technique, it is shown how logicalproperties of a parallel program may be transformed intonecessary and sufficient properties of components of the program.Finally, a set of axiomatic laws are provided useful forsimplifying formulae and complete with respect to validity andunsatisfiability

A theory of normed simulations

In existing simulation proof techniques, a single step in a lower-level specification may be simulated by an extended execution fragment in a higher-level one. As a result, it is cumbersome to mechanize these techniques using general purpose theorem provers. Moreover, it is undecidable whether a given relation is a simulation, even if tautology checking is decidable for the underlying specification logic. This paper introduces various types of normed simulations. In a normed simulation, each step in a lower-level specification can be simulated by at most one step in the higher-level one, for any related pair of states. In earlier work we demonstrated that normed simulations are quite useful as a vehicle for the formalization of refinement proofs via theorem provers. Here we show that normed simulations also have pleasant theoretical properties: (1) under some reasonable assumptions, it is decidable whether a given relation is a normed forward simulation, provided tautology checking is decidable for the underlying logic; (2) at the semantic level, normed forward and backward simulations together form a complete proof method for establishing behavior inclusion, provided that the higher-level specification has finite invisible nondeterminism.Comment: 31 pages, 10figure

Temporal Semantics for Concurrent METATEM

AbstractConcurrentMetateMis a programming language based on the notion of concurrent, communicating objects, where each object directly executes a specification given in temporal logic, and communicates with other objects using asynchronous broadcast message-passing. Thus, ConcurrentMetateMrepresents a combination of the direct execution of temporal specifications, together with a novel model of concurrent computation. In contrast to the notions of predicates as processes and stream parallelism seen in concurrent logic languages, ConcurrentMetateMrepresents a more coarse-grained approach, where an object consists of a set of logical rules and communication is achieved by the evaluation of certain types of predicate. Representing concurrent systems as groups of such objects provides a powerful tool for modelling complex reactive systems. In order to reason about the behaviour of ConcurrentMetateMsystems, we requir a suitable semantics. Being based upon executable temporal logic, objects in isolation have an intuitive semantics. However, the addition of both operational constraints upon the object's execution and global constraints provided by the asynchronous model of concurrency and communication, complicates the overall semantics of networks of objects. It is this, more complex, semantics that we address here, where temporal semantics for varieties of ConcurrentMetateMare provided