Results 1  10
of
11
Computation orchestration: A basis for widearea computing
 Journal of Software and Systems Modeling
, 2006
"... ..."
(Show Context)
Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement
 In Proceedings of VMCAI
, 2005
"... ..."
(Show Context)
Analyzing Conversations: Realizability, Synchronizability, and Verification
"... Abstract. Conversations provide an intuitive and simple model for analyzing interactions among composite web services. A conversation is the global sequence of messages exchanged among the peers participating to a composite web service. Interactions in a composite web service can be analyzed by inve ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. Conversations provide an intuitive and simple model for analyzing interactions among composite web services. A conversation is the global sequence of messages exchanged among the peers participating to a composite web service. Interactions in a composite web service can be analyzed by investigating the temporal properties of its conversations. Conversations can be specified in a topdown or bottomup manner. In a topdown conversation specification, the set of conversations is specified first, without specifying the individual behaviors of the peers. In a bottomup conversation specification, on the other hand, behavior of each peer is specified separately and the conversation set is defined implicitly as the set of conversations generated by these peers. For both topdown and bottomup specification approaches we are interested in the following: 1) Automatically verifying properties of conversations, and 2) Investigating the effect of asynchronous communication on the conversation behavior. These two issues are closely related since asynchronous
cflCopyright by Prasannaa Thati2000 TOWARDS AN ALGEBRAIC FORMULATION OF ACTORS
"... To my grandfather P.Laxmanna iv ACKNOWLEDGMENTS I would like to thank my advisor, Prof. Gul Agha, for his support and intellectual guidance. A special thanks to him for fostering a flexible research environment which helped me discover my true interests. I am very fortunate to have received the guid ..."
Abstract
 Add to MetaCart
To my grandfather P.Laxmanna iv ACKNOWLEDGMENTS I would like to thank my advisor, Prof. Gul Agha, for his support and intellectual guidance. A special thanks to him for fostering a flexible research environment which helped me discover my true interests. I am very fortunate to have received the guidance of Dr. Carolyn Talcott at Stanford University, where a significant portion of this research was conducted. My warmest thanks to her for making the visit possible, and for the extensive discussions and comments on the initial drafts of this dissertation.
A Concurrent Logical Framework: The Propositional Fragment?
"... which can be summarized as "concurrent computations as monadic expressions". ..."
Abstract
 Add to MetaCart
(Show Context)
which can be summarized as &quot;concurrent computations as monadic expressions&quot;.
Concurrent Composition of Objects in Hidden Logic
, 2003
"... Abstract. An operator _ _ for concurrent composition of objects specified in hidden logicis proposed and the main properties for this operator are proved. Keywords: hidden logic, behavioral specification, concurrent connection, composite objects, communicating objects 1 Introduction Hidden algebra ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. An operator _ _ for concurrent composition of objects specified in hidden logicis proposed and the main properties for this operator are proved. Keywords: hidden logic, behavioral specification, concurrent connection, composite objects, communicating objects 1 Introduction Hidden algebra was introduced in [4, 2] to give algebraic semantics for object paradigms. It distinguishes between visible and hidden sorts in the sense that the equality is interpreted strictly on visible sorts and behaviorally on hidden sorts. In hidden algebra the models only behaviorally satisfy specifications, where behaviorally satisfaction means indistinguishability under experiments.
Mobile Values, New Names, and Secure Communication
"... Abstract We study the interaction of the "new " construct with a rich but common form of (firstorder) communication. This interaction is crucial in security protocols, which are the main motivating examples for our work; it also appears in other programminglanguage contexts. Spec ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract We study the interaction of the &quot;new &quot; construct with a rich but common form of (firstorder) communication. This interaction is crucial in security protocols, which are the main motivating examples for our work; it also appears in other programminglanguage contexts. Specifically, we introduce a simple, general extension of the pi calculus with value passing, primitive functions, and equations among terms. We develop semantics and proof techniques for this extended language and apply them in reasoning about some security protocols. 1 A case for impurity Purity often comes before convenience and even before faithfulness in the lambda calculus, the pi calculus, and other foundational programming languages. For example, in the standard pi calculus, the only messages are atomic names [32]. This simplicity is extremely appealing from a foundational viewpoint, and helps in developing the theory of the pi calculus. Furthermore, ingenious encodings demonstrate that it may not entail a loss of generality: in particular, integers, objects, and even higherorder processes can be represented in the pure pi calculus. On the other hand, this purity has a price. In applications, the encodings can be futile, cumbersome, and even misleading. For example, in the study of programming languages based on the pi calculus (such as Pict [37] or Jocaml [14]), there is little point in pretending that integers are not primitive. The encodings may also complicate static analysis and preclude careful thinking about the implementations of communication. Moreover, it is not clear that satisfactory encodings can always be found. We may ask, for instance, whether there is a good representation of the spi calculus [5] (a calculus with cryptographic operations) in the standard pi calculus; we are not aware of any such representation that preserves security properties without a trusted central process. These difficulties are often circumvented through onthefly extensions. The extensions range from quick punts (&quot;for the next example, let's pretend that we have a datatype of integers&quot;) to the laborious development of new calculi, such as the spi calculus and its variants. Generally, the extensions bring us closer to a realistic programming language or modeling languagethat is not always a bad thing.
Spatial Logic Model Checker User’s Guide version 1.15
, 2009
"... Spatial logics support the specification not only of behavioral properties but also of structural properties of concurrent systems, in a fairly integrated way. Spatial properties arise naturally in the specification of distributed systems. In fact, many interesting properties of distributed systems ..."
Abstract
 Add to MetaCart
(Show Context)
Spatial logics support the specification not only of behavioral properties but also of structural properties of concurrent systems, in a fairly integrated way. Spatial properties arise naturally in the specification of distributed systems. In fact, many interesting properties of distributed systems are inherently spatial, for instance connectivity, stating that there
unknown title
"... 1 Introduction Denotational semantics and domain theory of Scott and Strachey provide a global mathematical setting for sequential computation, and thereby place programming languages in connection with each other; connect with the mathematical worlds of algebra, topology and logic; and inspire prog ..."
Abstract
 Add to MetaCart
(Show Context)
1 Introduction Denotational semantics and domain theory of Scott and Strachey provide a global mathematical setting for sequential computation, and thereby place programming languages in connection with each other; connect with the mathematical worlds of algebra, topology and logic; and inspire programming languages, type disciplines and methods of reasoning.
unknown title
"... 1 Introduction Denotational semantics and domain theory of Scott and Strachey provide a global mathematical setting for sequential computation, and thereby place programming languages in connection with each other; connect with the mathematical worlds of algebra, topology and logic; and inspire prog ..."
Abstract
 Add to MetaCart
(Show Context)
1 Introduction Denotational semantics and domain theory of Scott and Strachey provide a global mathematical setting for sequential computation, and thereby place programming languages in connection with each other; connect with the mathematical worlds of algebra, topology and logic; and inspire programming languages, type disciplines and methods of reasoning.