Sciweavers

9 search results - page 1 / 2
» May-Happen-in-Parallel Analysis for Asynchronous Programs wi...
Sort
View
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
11 years 6 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
ASYNC
1997
IEEE
66views Hardware» more  ASYNC 1997»
13 years 8 months ago
Speculative Completion for the Design of High-Performance Asynchronous Dynamic Adders
This paper presents an in-depth case study in highperformance asynchronous adder design. A recent method, called “speculative completion”, is used. This method uses single-rai...
Steven M. Nowick, Kenneth Y. Yun, Ayoob E. Dooply,...
ECOOP
2012
Springer
11 years 6 months ago
Object Initialization in X10
X10 is an object oriented programming language with a sophisticated type system (constraints, class invariants, non-erased generics, closures) and concurrency constructs (asynchron...
Yoav Zibin, David Cunningham, Igor Peshansky, Vija...
SIGMETRICS
1998
ACM
110views Hardware» more  SIGMETRICS 1998»
13 years 8 months ago
LoGPC: Modeling Network Contention in Message-Passing Programs
In many real applications, for example those with frequent and irregular communication patterns or those using large messages, network contention and contention for message proces...
Csaba Andras Moritz, Matthew Frank
SCP
1998
138views more  SCP 1998»
13 years 4 months ago
A Hierarchy of Constraint Systems for Data-Flow Analysis of Constraint Logic-Based Languages
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
Roberto Bagnara