Sciweavers

2300 search results - page 290 / 460
» Maximally Concurrent Programs
Sort
View
POPL
2012
ACM
14 years 2 months ago
Deciding choreography realizability
Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several app...
Samik Basu, Tevfik Bultan, Meriem Ouederni
ICFP
2012
ACM
13 years 8 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
286
Voted
POPL
2009
ACM
16 years 7 months ago
Modular code generation from synchronous block diagrams: modularity vs. code size
We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools in the emb...
Roberto Lublinerman, Christian Szegedy, Stavros Tr...
ICC
2007
IEEE
301views Communications» more  ICC 2007»
16 years 23 days ago
Network Lifetime Optimization by Duality Approach for Multi-Source and Single-Sink Topology in Wireless Sensor Networks
—The multi-source and single-sink (MSSS) topology, in wireless sensor networks, is defined as the network topology, where all of nodes can gather, receive and transmit data to t...
Hui Wang, Yuhang Yang, Maode Ma, Xiaomin Wang
ISPASS
2008
IEEE
16 years 25 days ago
An Analysis of I/O And Syscalls In Critical Sections And Their Implications For Transactional Memory
Transactional memory (TM) is a scalable and concurrent way to build atomic sections. One aspect of TM that remains unclear is how side-effecting operations – that is, those whic...
Lee Baugh, Craig B. Zilles