Sciweavers

27 search results - page 3 / 6
» Nominal Domain Theory for Concurrency
Sort
View
FORMATS
2006
Springer
13 years 9 months ago
Concurrent Semantics Without the Notions of State or State Transitions
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
Edward A. Lee
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 23 days ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
LICS
2010
IEEE
13 years 4 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
ECOOP
2007
Springer
13 years 12 months ago
Metaprogramming with Traits
Abstract. In many domains, classes have highly regular internal structure. For example, so-called business objects often contain boilerplate code for mapping database fields to cl...
John H. Reppy, Aaron Turon
ACTA
2004
86views more  ACTA 2004»
13 years 5 months ago
Specification transformers: a predicate transformer approach to composition
Abstract. This paper explores theories that help in (i) proving that a system composed from components satisfies a system specification given only specifications of components and ...
Michel Charpentier, K. Mani Chandy