Sciweavers

76 search results - page 8 / 16
» Cartesian Partial-Order Reduction
Sort
View
MFDBS
1991
125views Database» more  MFDBS 1991»
13 years 12 months ago
A Relational Algebra for Complex Objects Based on Partial Information
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...
Leonid Libkin
KBS
2011
81views more  KBS 2011»
13 years 3 months ago
Existential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
Ken Kaneiwa
SPIN
2009
Springer
14 years 3 months ago
Improving Non-Progress Cycle Checks
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
David Faragó, Peter H. Schmitt
PSTV
1992
113views Hardware» more  PSTV 1992»
13 years 9 months ago
Coverage Preserving Reduction Strategies for Reachability Analysis
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
14 years 3 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...