Sciweavers

2300 search results - page 113 / 460
» Maximally Concurrent Programs
Sort
View
141
Voted
ICALP
2011
Springer
14 years 4 months ago
Liveness-Preserving Atomicity Abstraction
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
Alexey Gotsman, Hongseok Yang
APLAS
2009
ACM
15 years 7 months ago
Proving Copyless Message Passing
Handling concurrency using a shared memory and locks is tedious and error-prone. One solution is to use message passing instead. We study here a particular, contract-based flavor ...
Jules Villard, Étienne Lozes, Cristiano Cal...
96
Voted
SPIN
2007
Springer
15 years 6 months ago
Cartesian Partial-Order Reduction
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semant...
Guy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagi...
119
Voted
ICLP
1993
Springer
15 years 4 months ago
Turbo Erlang: Approaching the Speed of C
Erlang is a concurrent programming language designed for prototyping and implementing reliable real-time systems. In its design Erlanginherits someideas fromconcurrent logic progra...
Bogumil Hausman
72
Voted
ENTCS
2008
90views more  ENTCS 2008»
15 years 24 days ago
Instantaneous Transitions in Esterel
Esterel is an imperative synchronous programming language for the specification of deterministic concurrent reactive systems. While providing the usual control-flow constructs--se...
Olivier Tardieu, Stephen A. Edwards