Sciweavers

322 search results - page 56 / 65
» Combinations of Abstract Domains for Logic Programming
Sort
View
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 11 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
JFP
2008
135views more  JFP 2008»
14 years 11 months ago
Hoare type theory, polymorphism and separation
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...
BIRTHDAY
2010
Springer
15 years 4 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
ATAL
2010
Springer
15 years 23 days ago
Flexible task resourcing for intelligent agents
In many applications, tasks can be delegated to intelligent agents. In order to carry out a task, an agent should reason about what types of resources the task requires. However, ...
Murat Sensoy, Wamberto Weber Vasconcelos, Timothy ...
ICDE
1993
IEEE
116views Database» more  ICDE 1993»
15 years 3 months ago
The Volcano Optimizer Generator: Extensibility and Efficient Search
Emerging database application domains demand not only new functionality but also high performance. To satisfy these two requirements, the Volcano project provides efficient, exten...
Goetz Graefe, William J. McKenna