Sciweavers

434 search results - page 67 / 87
» A Distributed and Probabilistic Concurrent Constraint Progra...
Sort
View
SIGSOFT
2002
ACM
14 years 8 months ago
Composable semantics for model-based notations
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...
Jianwei Niu, Joanne M. Atlee, Nancy A. Day
ESOP
2004
Springer
14 years 1 months ago
Linear Types for Packet Processing
Abstract. We present PacLang: an imperative, concurrent, linearlytyped language designed for expressing packet processing applications. PacLang’s linear type system ensures that ...
Robert Ennals, Richard Sharp, Alan Mycroft
POPL
2012
ACM
12 years 3 months ago
Deciding choreography realizability
Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several app...
Samik Basu, Tevfik Bultan, Meriem Ouederni
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
13 years 11 months ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba
PPOPP
2012
ACM
12 years 3 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal