Sciweavers

155
Voted
TACAS
2012
Springer
288views Algorithms» more  TACAS 2012»
14 years 8 days 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»
14 years 8 days 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»
14 years 8 days 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»
14 years 8 days 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
SWQD
2012
234views more  SWQD 2012»
14 years 8 days ago
BIM: A Methodology to Transform Business Processes into Software Systems
This manuscript proposes a guiding methodology to obtain a software system that supports the execution of the business processes existing within an organization. The methodology pr...
Francisco J. Duarte, Ricardo Jorge Machado, Jo&ati...
300
Voted
SWARM
2012
SPRINGER
329views Optimization» more  SWARM 2012»
14 years 8 days ago
A critical analysis of parameter adaptation in ant colony optimization
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
Paola Pellegrini, Thomas Stützle, Mauro Birat...
STACS
2012
Springer
14 years 8 days ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
STACS
2012
Springer
14 years 8 days ago
Preemptive and Non-Preemptive Generalized Min Sum Set Cover
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan