Sciweavers

6045 search results - page 849 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
LICS
2007
IEEE
16 years 1 months ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...
LICS
2007
IEEE
16 years 1 months ago
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
László Egri, Benoit Larose, Pascal T...
P2P
2007
IEEE
107views Communications» more  P2P 2007»
16 years 1 months ago
Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies
Current P2P systems employ tit-for-tat strategies, where peers only upload when they are simultaneously downloading, to avoid free riding. We derive optimal tit-for-tat strategies...
Dimitri do B. DeFigueiredo, Balaji Venkatachalam, ...
RTCSA
2007
IEEE
16 years 1 months ago
Virtual Full Replication by Adaptive Segmentation
We propose Virtual Full Replication by Adaptive segmentation (ViFuR-A), and evaluate its ability to maintain scalability in a replicated real-time database. With full replication ...
Gunnar Mathiason, Sten F. Andler, Sang Hyuk Son
CAV
2007
Springer
86views Hardware» more  CAV 2007»
16 years 1 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi