Sciweavers

107 search results - page 7 / 22
» Planning and Patching Proof
Sort
View
VEE
2006
ACM
115views Virtualization» more  VEE 2006»
15 years 3 months ago
Live updating operating systems using virtualization
Many critical IT infrastructures require non-disruptive operations. However, the operating systems thereon are far from perfect that patches and upgrades are frequently applied, i...
Haibo Chen, Rong Chen, Fengzhe Zhang, Binyu Zang, ...
AIPS
2007
14 years 12 months ago
Transformational Planning for Everyday Activity
We propose an approach to transformational planning and learning of everyday activity. This approach is targeted at autonomous robots that are to perform complex activities such a...
Armin Müller, Alexandra Kirsch, Michael Beetz
AIPS
2007
14 years 12 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
Michael Katz, Carmel Domshlak
ENTCS
2006
169views more  ENTCS 2006»
14 years 9 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
KBSE
2003
IEEE
15 years 2 months ago
Automation for Exception Freedom Proofs
Run-time errors are typically seen as unacceptable within safety and security critical software. The SPARK approach to the development of high integrity software addresses the pro...
Bill J. Ellis, Andrew Ireland