Sciweavers

TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
11 years 11 months ago
Compositional Termination Proofs for Multi-threaded Programs
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
Corneliu Popeea, Andrey Rybalchenko
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
11 years 11 months ago
Reduction-Based Formal Analysis of BGP Instances
Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomou...
Anduo Wang, Carolyn L. Talcott, Alexander J. T. Gu...
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
11 years 11 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
TACAS
2012
Springer
277views Algorithms» more  TACAS 2012»
11 years 11 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...
TACAS
2012
Springer
275views Algorithms» more  TACAS 2012»
11 years 11 months ago
Pushdown Model Checking for Malware Detection
The number of malware is growing extraordinarily fast. Therefore, it is important to have efficient malware detectors. Malware writers try to obfuscate their code by different tec...
Fu Song, Tayssir Touili