Sciweavers

183 search results - page 19 / 37
» A new method for compiling schizophrenic synchronous program...
Sort
View
POPL
2004
ACM
15 years 5 months ago
Summarizing procedures in concurrent programs
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...
Shaz Qadeer, Sriram K. Rajamani, Jakob Rehof
BIRTHDAY
1994
Springer
15 years 3 months ago
Generalizing Cook's Transformation to Imperative Stack Programs
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Nils Andersen, Neil D. Jones
IEEEPACT
2009
IEEE
14 years 9 months ago
Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency
Transactional memory is being advanced as an alternative to traditional lock-based synchronization for concurrent programming. Transactional memory simplifies the programming mode...
Takayuki Usui, Reimer Behrends, Jacob Evans, Yanni...
TLDI
2010
ACM
225views Formal Methods» more  TLDI 2010»
15 years 8 months ago
Race-free and memory-safe multithreading: design and implementation in cyclone
We present the design of a formal low-level multi-threaded language with advanced region-based memory management and synchronization primitives, where well-typed programs are memo...
Prodromos Gerakios, Nikolaos Papaspyrou, Konstanti...
SAC
2005
ACM
15 years 5 months ago
Selective method combination in mixin-based composition
A mixin is a reusable module that provides uniform extend modifications to classes. It is an abstract subclass that is composable with a variety of superclasses. In mixinbased co...
Tetsuo Kamina, Tetsuo Tamai