Sciweavers

110 search results - page 8 / 22
» Interleaved Depth-First Search
Sort
View
POPL
2008
ACM
14 years 8 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
CAV
2009
Springer
184views Hardware» more  CAV 2009»
14 years 9 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta
ENTCS
2006
113views more  ENTCS 2006»
13 years 8 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
GECCO
1999
Springer
106views Optimization» more  GECCO 1999»
14 years 22 days ago
Generating Lemmas for Tableau-based Proof Search Using Genetic Programming
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successfu...
Marc Fuchs, Dirk Fuchs, Matthias Fuchs
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
14 years 1 months ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...