Results 11  20
of
43
Causality in Membrane Systems
"... Summary. P systems are a biologically inspired model introduced by Gheorghe Păun with the aim of representing the structure and the functioning of the cell. P systems are usually equipped with the maximal parallelism semantics; however, since their introduction, some alternative semantics have been ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Summary. P systems are a biologically inspired model introduced by Gheorghe Păun with the aim of representing the structure and the functioning of the cell. P systems are usually equipped with the maximal parallelism semantics; however, since their introduction, some alternative semantics have been proposed and investigated. We propose a semantics that describes the causal dependencies occurring between the reactions of a P system. We investigate the basic properties that are satisfied by such a semantics. The notion of causality turns out to be quite relevant for biological systems, as it permits to point out which events occurring in a biological pathway are necessary for another event to happen. 1
Structural Operational Semantics as a Basis for Static Program Analysis
 In ACM Computing Surveys
, 1996
"... interpretation was defined originally in terms of flowcharts or dynamic discrete systems [3]. From the usual flowchart operational semantics, a socalled static (or collecting) semantics is derived automatically by attaching to each program point (flowchart arc) the set of contexts (states) that f ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
interpretation was defined originally in terms of flowcharts or dynamic discrete systems [3]. From the usual flowchart operational semantics, a socalled static (or collecting) semantics is derived automatically by attaching to each program point (flowchart arc) the set of contexts (states) that flow to that point during execution. The collecting semantics summarizes "what really happens at runtime," and the goal of an abstract semantics is to compute properties for the program points that describe the concrete context sets. The abstract semantics does so by executing the flowchart with abstract values that represent context properties. The above formulation is simple and effective, but flowcharts suffer major weaknesses which preclude their use as a general framework for static program analysis: they are too lowlevel and they do not enjoy the compositionality property. A subsequent advance was the formulation of abstract interpretation in a compositional manner via denotational s...
Bialgebraic methods in structural operational semantics
 ENTCS
, 2007
"... Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about wellbehaved structural operational specifications. An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various k ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about wellbehaved structural operational specifications. An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this talk, the current state of the art in the area of bialgebraic semantics is presented, and its prospects for the future are sketched. In particular, a combination of basic bialgebraic techniques with a categorical approach to modal logic is described, as an abstract approach to proving compositionality by decomposing modal logics over structural operational specifications. Keywords:
The gamut of dynamic logic
 Handbook of the History of Logic, Volume 6 – Logic and the Modalities in the Twentieth Century
, 2006
"... Dynamic logic, broadly conceived, is the logic that analyses change by decomposing actions into their basic building blocks and by describing the results of performing actions in given states of the world. The actions studied by dynamic logic can be of various kinds: actions on the memory state of a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Dynamic logic, broadly conceived, is the logic that analyses change by decomposing actions into their basic building blocks and by describing the results of performing actions in given states of the world. The actions studied by dynamic logic can be of various kinds: actions on the memory state of a computer, actions of a moving robot in a closed world, interactions between cognitive agents performing given communication protocols, actions that change the common ground between speaker and hearer in a conversation, actions that change the contextually available referents in a conversation, and so on. In each of these application areas, dynamic logics can be used to model the states involved and the transitions that occur between them. Dynamic logic is a tool for both state description and action description. Formulae describe states, while actions or programs express state change. The levels of state descriptions and transition characterisations are connected by suitable operations that allow reasoning about pre and postconditions of particular changes.
Verifying distributed systems: the operational approach
, 2009
"... This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated with a stateoftheart verification of a core piece of distributed infrastructure, involving networking, a filesystem, an ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated with a stateoftheart verification of a core piece of distributed infrastructure, involving networking, a filesystem, and concurrent OCaml code. The formalization is in higherorder logic and proof support is provided by the HOL4 theorem prover. Difficult verification problems demand a wide range of techniques. Here these include ground and symbolic evaluation, local reasoning, separation, invariants, Hoarestyle assertional reasoning, rely/guarantee, inductive reasoning about protocol correctness, multiple refinement, and linearizability. While each of these techniques is useful in isolation, they are even more so in combination. The first contribution of this paper is to present the operational approach and describe how existing techniques, including all those mentioned above, may be cleanly and precisely integrated in this setting. The second contribution is to show how to combine verifications of individual library functions with arbitrary and unknown user code in a compositional manner, focusing on the problems of private state and encapsulation. The third contribution is the example verification itself. The infrastructure must behave correctly under arbitrary patterns of host and network failure, whilst for performance reasons the code also includes data races on shared state. Both features make the verification particularly challenging.
Approximation Semantics and Expressive Predicate Assignment for ObjectOriented Programming (Extended Abstract)
"... Abstract. We consider a semantics for a classbased objectoriented calculus based upon approximation; since in the context of LC such a semantics enjoys a strong correspondence with intersection type assignment systems, we also define such a system for our calculus and show that it is sound and com ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. We consider a semantics for a classbased objectoriented calculus based upon approximation; since in the context of LC such a semantics enjoys a strong correspondence with intersection type assignment systems, we also define such a system for our calculus and show that it is sound and complete. We establish the link with between type (we use the terminology predicate here) assignment and the approximation semantics by showing an approximation result, which leads to a sufficient condition for headnormalisation and termination. We show the expressivity of our predicate system by defining an encoding of Combinatory Logic (and so also LC) into our calculus. We show that this encoding preserves predicateability and also that our system characterises the normalising and strongly normalising terms for this encoding, demonstrating that the great analytic capabilities of these predicates can be applied to OO. 1
Modelling Interaction in Agent Systems
 In 14th International Joint Conference in Artificial Intelligence (IJCAI95
, 1995
"... We present a study of the interaction properties of multiagent systems where agents communicate by means of speech act based primitives. We identify a set of basic interaction mechanisms: agent identity, asynchronous message passing, implicit receive primitive, which are closed to those of the actor ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present a study of the interaction properties of multiagent systems where agents communicate by means of speech act based primitives. We identify a set of basic interaction mechanisms: agent identity, asynchronous message passing, implicit receive primitive, which are closed to those of the actor model. Then, we define an actor algebra over actor terms as a basic formalism for multiagent systems. Finally, we show how it is possible to translate a speech act based language (a subset of KQML) into the given algebra. This allows to prove the equivalence of multiagent systems in terms of the equivalence of the corresponding actor terms. multiagent systems
Typed Logics With States
, 1997
"... The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus. It is shown that universal validity of equality for this extended language is decidable (extending a wellknown result of Friedman for typed lambda calculus). T ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The paper presents a simple format for typed logics with states by adding a function for register update to standard typed lambda calculus. It is shown that universal validity of equality for this extended language is decidable (extending a wellknown result of Friedman for typed lambda calculus). This system is next extended to a full fledged typed dynamic logic, and it is illustrated how the resulting format allows for very simple and intuitive representations of dynamic semantics for natural language and denotational semantics for imperative programming. The proposal is compared with some alternative approaches to formulating typed versions of dynamic logics. 1991 Mathematics Subject Classification: 03B15, 03B65, 03B70, 68Q55, 68Q65 1991 Computing Reviews Classification System: D.3.3, F.3.2, I.2.4, I.2.7 Keywords and Phrases: Type theory, compositionality, denotational semantics, dynamic semantics Note: Work carried out under project P4303; paper accepted for publication in the ...
Proving Write Invalidate Cache Coherence with Bisimulations in Isabelle/HOL
"... . The aim of this paper is to advocate the use of bisimulation relations in the verication of innitestate or parameterized systems, and demonstrates the support that generalpurpose theorem provers can oer. A powerful proof technique, known as up to expansion, is discussed and applied in a case stu ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. The aim of this paper is to advocate the use of bisimulation relations in the verication of innitestate or parameterized systems, and demonstrates the support that generalpurpose theorem provers can oer. A powerful proof technique, known as up to expansion, is discussed and applied in a case study about write invalidate cache coherence. This example is of interest, as the system is parameterized in the number of its components, and the bisimulation relation reects the coherence of the caches with the main memory. 1 Introduction In recent years, generalpurpose theorem proving has come to play an important role in the verication of concurrent systems, especially for systems which are too large to be treated fully automatically, or even innite. Yet, if one is not to use the tool as a mere proof checker, some attention has to be spent on the choice of a suitable methodology. (1) Although generalpurpose theorem provers like Isabelle, PVS, or Coq, oer a considerable amount of au...
iRho: an imperative rewriting calculus
, 2008
"... We propose an imperative version of the Rewriting Calculus, a calculus based on pattern matching, pattern abstraction and side effects, which we call iRho. We formulate both a static and bigstep callbyvalue operational semantics of iRho. The operational semantics is deterministic, and immediately ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We propose an imperative version of the Rewriting Calculus, a calculus based on pattern matching, pattern abstraction and side effects, which we call iRho. We formulate both a static and bigstep callbyvalue operational semantics of iRho. The operational semantics is deterministic, and immediately suggests how an interpreter for the calculus may be built. The static semantics is given using a firstorder type system based on a form of product types, which can be assigned to termlike structures (that is, records). The calculus is à la Church, that is, pattern abstractions are decorated with the types of the free variables of the pattern. iRho is a good candidate for the core of a patternmatching imperative language, where a (monomorphic) typed store can be safely manipulated and where fixed points are built into the language itself. Properties such as determinism of the interpreter and subjectreduction have been completely checked using a machineassisted approach with the Coq proof assistant. Progress and decidability of type checking are proved using pen and paper.