Sciweavers

571 search results - page 108 / 115
» Performing causality analysis by bounded model checking
Sort
View
219
Voted
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 7 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
WISEC
2009
ACM
15 years 10 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
16 years 19 days ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
160
Voted
PASTE
2005
ACM
15 years 9 months ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
INLG
2004
Springer
15 years 9 months ago
Resolving Structural Ambiguity in Generated Speech
Ambiguity in the output is a concern for NLG in general. This paper considers the case of structural ambiguity in spoken language generation. We present an algorithm which inserts ...
Chris Mellish