Sciweavers

1274 search results - page 100 / 255
» New Proofs for
Sort
View
POPL
2010
ACM
14 years 7 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
ECAI
2010
Springer
13 years 10 months ago
Brothers in Arms? On AI Planning and Cellular Automata
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
Jörg Hoffmann, Nazim Fatès, Héc...
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 10 months ago
Context-Sensitive Languages, Rational Graphs and Determinism
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
Arnaud Carayol, Antoine Meyer
IPL
2008
80views more  IPL 2008»
13 years 10 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
AMAI
1998
Springer
13 years 9 months ago
Generalization and Specialization Strategies for Learning r.e. Languages
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
Sanjay Jain, Arun Sharma