Sciweavers

328 search results - page 54 / 66
» Proving Termination of Communicating Programs
Sort
View
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
13 years 6 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
CONCUR
2012
Springer
11 years 10 months ago
Linearizability with Ownership Transfer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
Alexey Gotsman, Hongseok Yang
POPL
2012
ACM
12 years 3 months ago
Run your research: on the effectiveness of lightweight mechanization
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
Casey Klein, John Clements, Christos Dimoulas, Car...
MOBIHOC
2008
ACM
14 years 7 months ago
Efficient binary schemes for training heterogeneous sensor and actor networks
Sensor networks are expected to evolve into long-lived, autonomous networked systems whose main mission is to provide in-situ users ? called actors ? with real-time information in...
Ferruccio Barsi, Alfredo Navarra, Maria Cristina P...
ALT
2003
Springer
14 years 4 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...