Sciweavers

1159 search results - page 216 / 232
» Adding Concurrency to a Programming Language
Sort
View
WORDS
2005
IEEE
14 years 1 months ago
An Adaptable Security Framework for Service-based Systems
A major advantage of service-based computing technology is the ability to enable rapid formation of large-scale distributed systems by composing massively available services to ac...
Stephen S. Yau, Yisheng Yao, Zhaoji Chen, Luping Z...
ICLP
1997
Springer
13 years 11 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
ENTCS
2008
70views more  ENTCS 2008»
13 years 7 months ago
Separate Compilation of Polychronous Specifications
As code generation for synchronous programs requires strong safety properties to be satisfied, compositionality becomes a difficult goal to achieve. Most synchronous languages, su...
Julien Ouy, Jean-Pierre Talpin, Loïc Besnard,...
CP
2007
Springer
14 years 1 months ago
Constructive Interval Disjunction
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
Gilles Trombettoni, Gilles Chabert
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
13 years 11 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira