Sciweavers

132 search results - page 4 / 27
» Ellipsoidal Techniques for Reachability Analysis
Sort
View
CAV
2007
Springer
112views Hardware» more  CAV 2007»
13 years 11 months ago
Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures
Bounded context switch reachability analysis is a useful and efficient approach for detecting bugs in multithreaded programs. In this paper, we address the application of this app...
Ahmed Bouajjani, Séverine Fratani, Shaz Qad...
ESEC
1997
Springer
13 years 9 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
ICRA
2005
IEEE
134views Robotics» more  ICRA 2005»
13 years 11 months ago
Reachability Analysis of Sampling Based Planners
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
Roland Geraerts, Mark H. Overmars
PTS
2008
98views Hardware» more  PTS 2008»
13 years 6 months ago
Modular System Verification by Inference, Testing and Reachability Analysis
Verification of a modular system composed of communicating components is a difficult problem, especially when the models of the components are not available. Conventional testing t...
Roland Groz, Keqin Li 0002, Alexandre Petrenko, Mu...
AMAST
2008
Springer
13 years 7 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...