Sciweavers

4426 search results - page 323 / 886
» Concurrent Constraint Programming
Sort
View
CADE
2010
Springer
15 years 7 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
DAWAK
2001
Springer
15 years 11 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
CSCW
2000
ACM
15 years 11 months ago
Copies convergence in a distributed real-time collaborative environment
In real−time collaborative systems, replicated objects, shared by users, are subject to concurrency constraints. In order to satisfy these, various algorithms, qualified as opâˆ...
Nicolas Vidot, Michèle Cart, Jean Ferri&eac...
ATVA
2006
Springer
131views Hardware» more  ATVA 2006»
15 years 10 months ago
Timed Unfoldings for Networks of Timed Automata
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
AIPS
2009
15 years 7 months ago
Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis
We provide a theoretical analysis of planning via Petri net unfolding, a novel technique for synthesising parallel plans. Parallel plans are generally valued for their execution f...
Sarah L. Hickmott, Sebastian Sardiña