Sciweavers

87 search results - page 13 / 18
» Maintenance of Transitive Closures and Transitive Reductions...
Sort
View
85
Voted
DBPL
1997
Springer
87views Database» more  DBPL 1997»
15 years 2 months ago
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
Leonid Libkin, Limsoon Wong
100
Voted
CORR
2006
Springer
108views Education» more  CORR 2006»
14 years 10 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
85
Voted
LICS
2000
IEEE
15 years 2 months ago
Virtual Symmetry Reduction
We provide a general method for ameliorating state explosion via symmetry reduction in certain asymmetric systems, such as systems with many similar, but not identical, processes....
E. Allen Emerson, John Havlicek, Richard J. Trefle...
110
Voted
ESEC
1997
Springer
15 years 2 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
93
Voted
STACS
1994
Springer
15 years 2 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman