Sciweavers

1499 search results - page 96 / 300
» Chopping Concurrent Programs
Sort
View
93
Voted
IANDC
2008
131views more  IANDC 2008»
15 years 24 days ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
CONCURRENCY
2006
77views more  CONCURRENCY 2006»
15 years 24 days ago
A survey of systems for detecting serial run-time errors
: This paper evaluates the ability of a variety of commercial and non-commercial software products to detect serial run-time errors in C and C++ programs, to issue meaningful messa...
Glenn R. Luecke, James Coyle, Jim Hoekstra, Marina...
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