Sciweavers

276 search results - page 19 / 56
» Dynamic Path Reduction for Software Model Checking
Sort
View
ICTAI
2005
IEEE
14 years 2 months ago
Reachability Analysis for Uncertain SSPs
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
Olivier Buffet
BIRTHDAY
2009
Springer
14 years 3 months ago
Hybrid BDD and All-SAT Method for Model Checking
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
Avi Yadgar, Orna Grumberg, Assaf Schuster
ASPLOS
2011
ACM
13 years 6 days ago
S2E: a platform for in-vivo multi-path analysis of software systems
This paper presents S2E, a platform for analyzing the properties and behavior of software systems. We demonstrate S2E’s use in developing practical tools for comprehensive perfo...
Vitaly Chipounov, Volodymyr Kuznetsov, George Cand...
WCET
2008
13 years 10 months ago
Traces as a Solution to Pessimism and Modeling Costs in WCET Analysis
WCET analysis models for superscalar out-of-order CPUs generally need to be pessimistic in order to account for a wide range of possible dynamic behavior. CPU hardware modificatio...
Jack Whitham, Neil C. Audsley
AMAST
2006
Springer
14 years 10 days ago
State Space Reduction of Rewrite Theories Using Invisible Transitions
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
Azadeh Farzan, José Meseguer