Results 1  10
of
17
Extended ML: Past, present and future
 PROC. 7TH WORKSHOP ON SPECIFICATION OF ABSTRACT DATA TYPES, WUSTERHAUSEN. SPRINGER LNCS 534
, 1991
"... An overview of past, present and future work on the Extended ML formal program development framework is given, with emphasis on two topics of current active research: the semantics of the Extended ML specification language, and tools to support formal program development. ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
An overview of past, present and future work on the Extended ML formal program development framework is given, with emphasis on two topics of current active research: the semantics of the Extended ML specification language, and tools to support formal program development.
Modal logic as a basis for distributed computation
, 2003
"... Trustless Software Dissemination.” In this report, we give a computational interpretation of modal logic in which the modalities necessity (�A) and possibility (♦A) describe locality in a distributed computation. This interpretation is quite natural, given the usual “possible worlds ” semantics unde ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
Trustless Software Dissemination.” In this report, we give a computational interpretation of modal logic in which the modalities necessity (�A) and possibility (♦A) describe locality in a distributed computation. This interpretation is quite natural, given the usual “possible worlds ” semantics underlying modal logic. In our case, the worlds we consider are processes in a spatially distributed configuration. Necessity describes a term that is welltyped anywhere and possibility a term that is welltyped somewhere. Thus typing determines the permissible degree of mobility for terms, in some cases allowing us to create new processes or move terms between existing processes, and in others forbidding mobility. In addition to the purely logical motivations, we present some examples demonstrating how the calculus of modal logic proof terms can be used to write distributed, concurrent programs while preserving safe access to and manipulation of localized resources.
Spatial Logics for Bigraphs
 In Proceedings of ICALP’05, volume 3580 of LNCS
, 2005
"... Abstract. Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, picalculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper)graph for connections. With the aim of describing bigraphical structur ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
Abstract. Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, picalculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper)graph for connections. With the aim of describing bigraphical structures, we introduce a general framework for logics whose terms represent arrows in monoidal categories. We then instantiate the framework to bigraphical structures and obtain a logic that is a natural composition of a place graph logic and a link graph logic. We explore the concepts of separation and sharing in these logics and we prove that they generalise some known spatial logics for trees, graphs and tree contexts. 1
Static BiLog: a Unifying Language for Spatial Structures
 FUNDAMENTA INFORMATICAE??? (200?) 1–20
"... Aiming at a unified view of the logics describing spatial structures, we introduce a general framework, BiLog, whose formulae characterise monoidal categories. As a first instance of the framework we consider bigraphs, which are emerging as a an interesting (meta)model for spatial structures and d ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Aiming at a unified view of the logics describing spatial structures, we introduce a general framework, BiLog, whose formulae characterise monoidal categories. As a first instance of the framework we consider bigraphs, which are emerging as a an interesting (meta)model for spatial structures and distributed calculi. Since bigraphs are built orthogonally on two structures, a hierarchical place graph for locations and a link (hyper)graph for connections, we obtain a logic that is a natural composition of other two instances of BiLog: a Place Graph Logic and a Link Graph Logic. We prove that these instances generalise the spatial logics for trees, for graphs and for tree contexts. We also explore the concepts of separation and sharing in these logics. We note that both the operator ∗ of Separation Logic and the operator  of spatial logics do not completely separate the underlying structures. These two different forms of separation can be naturally derived as instances of BiLog by using the complete separation induced by the tensor product of monoidal categories along with some form of sharing.
Bigraphical Logics for XML
, 2005
"... Bigraphs are emerging as an interesting model that can represent both the picalculus and the ambient calculus. Bigraphs are built orthogonally on two structures: a hierarchical `place' graph for locations and a `link' (hyper)graph for connections. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Bigraphs are emerging as an interesting model that can represent both the picalculus and the ambient calculus. Bigraphs are built orthogonally on two structures: a hierarchical `place' graph for locations and a `link' (hyper)graph for connections.
A decidable extension of hennessymilner logic with spatial operators
, 2006
"... in addition to the modal temporal operators, some modal spatial operators such as the parallel operator φψ (meaning that the current process can be split into a parallel composition QR of a process Q satisfying φ and a process R satisfying ψ), and its adjoint the guarantee operator φ ⊲ ψ, or loca ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
in addition to the modal temporal operators, some modal spatial operators such as the parallel operator φψ (meaning that the current process can be split into a parallel composition QR of a process Q satisfying φ and a process R satisfying ψ), and its adjoint the guarantee operator φ ⊲ ψ, or location operator 1 n[φ] (meaning that the current process is an ambient n[P] and the process P satisfies φ), etc. A formula in a spatial logic describes a property of a particular part of the system at a particular time. These spatial modalities have an intensional flavor, the properties they express being invariant only for simple spatial rearrangements of the system. As the main reason for introducing spatial logics was to provide appropriate techniques for specification and model checking concurrent distributed systems, most of the work done in this field points to decidability problems. The decidability of Dynamic Spatial Logic has been anticipated in [4]. Still, on the best of our knowledge, there is no prove in this direction. In this paper we will provide such a prove underpinning on finite model property. In proving the finite model property for our logic, we used a new congruence on processes the structural bisimulation. A conceptually similar congruence has been proposed in [5], but for static processes only. The structural bisimulation
Logical mobility and locality types
 Logic Based Program Synthesis and Transformation (LOPSTR), LNCS. Springer, 2005. URL http://www.cs.cmu.edu/˜jwmoody/doc/pub/ 2004LOPSTRmobilitylocality.ps. 7.1.1
"... 1 Introduction and Motivation We claim that modal logic with necessity (2A) and possibility (3A) can serve as the basis of a locationaware type theory for distributed computation. We present a statically typed calculus derived from a natural deduction formulation of S4 modal logic derived, in the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
1 Introduction and Motivation We claim that modal logic with necessity (2A) and possibility (3A) can serve as the basis of a locationaware type theory for distributed computation. We present a statically typed calculus derived from a natural deduction formulation of S4 modal logic derived, in the sense that programs correspond to proof terms, and types to propositions. The modal propositions 2A ("mobile A") and 3A ("remote A") capture spatial properties of terms relevant to distributed computation. Mobility and locality are explicitly recognized, but the particular locations involved remain abstract.
Towards model checking spatial properties with spin
 In Proceedings of the 14th International Workshop on Software Model Checking SPIN’07, Lecture Notes in Computer Science
"... Abstract. We present an approach for the verification of spatial properties with Spin. We first extend one of Spin’s main property specification mechanism, i.e., the lineartime temporal logic LTL, with spatial connectives that allow to restrict the reasoning of the behaviour of a system to some com ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We present an approach for the verification of spatial properties with Spin. We first extend one of Spin’s main property specification mechanism, i.e., the lineartime temporal logic LTL, with spatial connectives that allow to restrict the reasoning of the behaviour of a system to some components of the system only. For instance, one can express whether the system can reach a certain state from which a subset of processes can evolve alone until some property is fulfilled. We give a model checking algorithm for the logic and propose how Spin can be minimally extended to include the algorithm. We also discuss potential improvements to mitigate the exponential complexity introduced by spatial connectives. Finally, we present some experiments that compare our Spin extension with a spatial model checker for the πcalculus. 1
Provably Correct Pervasive Computing Environments
"... The field of pervasive computing has seen a lot of exciting innovations in the past few years. However, there are currently no mechanisms for describing the properties and capabilities of pervasive computing environments in a formal manner. This makes it difficult to prove the correctnesss of a perv ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The field of pervasive computing has seen a lot of exciting innovations in the past few years. However, there are currently no mechanisms for describing the properties and capabilities of pervasive computing environments in a formal manner. This makes it difficult to prove the correctnesss of a pervasive computing environment, i.e. to verify that the environment satisfies certain desired properties. In this paper, we propose a formal model for describing pervasive computing environments based on ambient calculus and the associated ambient logic. The model allows us to state and verify several properties of these environments such as “anywhere anyhow services”, “mobility of devices and applications ” and “contextaware adaptation”. The model allows us to describe the resources present in an environment, the operations that can be performed in the environment, and how users can use the resources in th environment to perform different kinds of activities. As a case study, we shall describe some of the resources and operations supported by the Gaia middleware using this model, and verify an example property of a pervasive computing environment supported by Gaia. 1