Sciweavers

132 search results - page 21 / 27
» Ellipsoidal Techniques for Reachability Analysis
Sort
View
IJCAI
1997
13 years 9 months ago
Model Minimization, Regression, and Propositional STRIPS Planning
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
Robert Givan, Thomas Dean
POPL
2008
ACM
14 years 8 months ago
Demand-driven alias analysis for C
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
Xin Zheng, Radu Rugina
DATE
2009
IEEE
163views Hardware» more  DATE 2009»
14 years 3 months ago
Fixed points for multi-cycle path detection
—Accurate timing analysis is crucial for obtaining the optimal clock frequency, and for other design stages such as power analysis. Most methods for estimating propagation delay ...
Vijay D'Silva, Daniel Kroening
CC
2004
Springer
110views System Software» more  CC 2004»
14 years 1 months ago
Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs
In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is efficient yet effective for reducing the number of inter...
Venkatesh Prasad Ranganath, John Hatcliff
FORMATS
2007
Springer
14 years 9 days ago
Partial Order Reduction for Verification of Real-Time Components
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
John Håkansson, Paul Pettersson