Sciweavers

1724 search results - page 200 / 345
» Models for Concurrency
Sort
View
APLAS
2004
ACM
15 years 3 months ago
Protocol Specialization
Abstract. In component-based programming, the programmer assembles applications from prefabricated components. The assembly process has two main steps: adapting a component by twea...
Matthias Neubauer, Peter Thiemann
ENTCS
2007
105views more  ENTCS 2007»
14 years 10 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
BMVC
2010
14 years 8 months ago
Probabilistic Latent Sequential Motifs: Discovering Temporal Activity Patterns in Video Scenes
This paper introduces a novel probabilistic activity modeling approach that mines recurrent sequential patterns from documents given as word-time occurrences. In this model, docum...
Jagannadan Varadarajan, Rémi Emonet, Jean-M...
APN
2010
Springer
15 years 2 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
CSFW
2005
IEEE
15 years 3 months ago
Achieving Information Flow Security through Precise Control of Effects
This paper advocates a novel approach to the construction of secure software: controlling information flow and maintaining integrity via monadic encapsulation of effects. This ap...
William L. Harrison, James Hook