Sciweavers

331 search results - page 41 / 67
» Fragments of order
Sort
View
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
15 years 5 months ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...
IANDC
2007
111views more  IANDC 2007»
14 years 11 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
LICS
2010
IEEE
14 years 10 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
SIGMETRICS
2002
ACM
130views Hardware» more  SIGMETRICS 2002»
14 years 11 months ago
Multiple-queue backfilling scheduling with priorities and reservations for parallel systems
We describe a new, non-FCFS policy to schedule parallel jobs on systems that may be part of a computational grid. Our algorithm continuously monitors the system (i.e., the intensi...
Barry G. Lawson, Evgenia Smirni
APLAS
2010
ACM
14 years 9 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander