Sciweavers

122 search results - page 24 / 25
» Bounded Model Checking of Pointer Programs
Sort
View
SIGSOFT
2003
ACM
14 years 8 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
12 years 3 months ago
Proving Reachability Using FShell - (Competition Contribution)
FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the decl...
Andreas Holzer, Daniel Kroening, Christian Schallh...
SIGSOFT
2007
ACM
14 years 8 months ago
A specification-based approach to testing software product lines
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
Engin Uzuncaova, Daniel Garcia, Sarfraz Khurshid, ...
POPL
2011
ACM
12 years 10 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
ICSE
2005
IEEE-ACM
14 years 7 months ago
Automatic discovery of API-level exploits
We argue that finding vulnerabilities in software components is different from finding exploits against them. Exploits that compromise security often use several low-level details...
Vinod Ganapathy, Sanjit A. Seshia, Somesh Jha, Tho...