Sciweavers

779 search results - page 123 / 156
» A Simple Program Transformation for Parallelism
Sort
View
MFCS
1994
Springer
13 years 11 months ago
A Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Frank S. de Boer, M. van Hulst
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
DMSN
2004
ACM
14 years 1 months ago
Region streams: functional macroprogramming for sensor networks
Sensor networks present a number of novel programming challenges for application developers. Their inherent limitations of computational power, communication bandwidth, and energy...
Ryan Newton, Matt Welsh
ECRTS
2008
IEEE
14 years 2 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander