Sciweavers

480 search results - page 32 / 96
» Continuations for parallel logic programming
Sort
View
ICALP
2000
Springer
13 years 11 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
PLDI
2012
ACM
11 years 10 months ago
Diderot: a parallel DSL for image analysis and visualization
Research scientists and medical professionals use imaging technology, such as computed tomography (CT) and magnetic resonance imaging (MRI) to measure a wide variety of biological...
Charisee Chiw, Gordon Kindlmann, John Reppy, Lamon...
FOSSACS
2009
Springer
14 years 2 months ago
Realizability of Concurrent Recursive Programs
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
CADE
2008
Springer
14 years 8 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
SIGSOFT
2009
ACM
14 years 8 months ago
SCA: a semantic conflict analyzer for parallel changes
Parallel changes are becoming increasingly prevalent in the development of large scale software system. To further study the relationship between parallel changes and faults, we h...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry