945 search results - page 126 / 189 » Incremental Branching Programs |
ICTAC
2004
Springer
14 years 1 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline quer...
AAAI
2010
13 years 9 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
DAC
1998
ACM
14 years 8 months ago
1998
ACM
Successive, formal refinement is a new approach for specification of embedded systems using a general-purpose programming language. Systems are formally modeled as Abstractable Sy...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...