Sciweavers

788 search results - page 69 / 158
» Symbolic Equivalence Checking
Sort
View
SPIN
2009
Springer
14 years 2 months ago
Subsumer-First: Steering Symbolic Reachability Analysis
Abstract. Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space ...
Andrey Rybalchenko, Rishabh Singh
IASTEDSE
2004
13 years 9 months ago
A symbolic Java virtual machine for test case generation
Quality management is becoming a more and more important part of the software development process. As software testing is currently understood as the core function of the quality ...
Roger A. Müller, Christoph Lembeck, Herbert K...
SIGSOFT
2003
ACM
14 years 8 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
CHARME
2005
Springer
136views Hardware» more  CHARME 2005»
14 years 1 months ago
Predictive Reachability Using a Sample-Based Approach
Abstract. Unbounded model checking of invariant properties is typically solved using symbolic reachability. However, BDD based reachability methods suffer from lack of robustness ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
14 years 1 days ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...