Sciweavers

1536 search results - page 201 / 308
» The Underlying Logic of Hoare Logic
Sort
View
HYBRID
1997
Springer
15 years 10 months ago
Robust Timed Automata
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesa...
MA
1997
Springer
127views Communications» more  MA 1997»
15 years 10 months ago
The Architecture of the Ara Platform for Mobile Agents
: We describe a platform for the portable and secure execution of mobile agents written in various interpreted languages on top of a common run-time core. Agents may migrate at any...
Holger Peine, Torsten Stolpmann
VLDB
1990
ACM
116views Database» more  VLDB 1990»
15 years 10 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr
APLAS
2007
ACM
15 years 10 months ago
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
Neil D. Jones, René Rydhof Hansen
AUSAI
2007
Springer
15 years 10 months ago
Planning as Satisfiability with Relaxed $-Step Plans
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
Martin Wehrle, Jussi Rintanen