Sciweavers

1418 search results - page 270 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
CONCUR
2005
Springer
15 years 5 months ago
Concurrent Clustered Programming
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
Vijay A. Saraswat, Radha Jagadeesan
IFL
2004
Springer
122views Formal Methods» more  IFL 2004»
15 years 5 months ago
Source-Based Trace Exploration
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
Olaf Chitil
SIGSOFT
2003
ACM
15 years 5 months ago
Modeling and validation of service-oriented architectures: application vs. style
Most applications developed today rely on a given middleware platform which governs the interaction between components, the access to resources, etc. To decide, which platform is ...
Luciano Baresi, Reiko Heckel, Sebastian Thöne...
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 4 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
ATAL
2006
Springer
15 years 3 months ago
Convergence analysis for collective vocabulary development
We study how decentralized agents can develop a shared vocabulary without global coordination. Answering this question can help us understand the emergence of many communication s...
Jun Wang, Les Gasser, Jim Houk