18. SAS 2011: Venice, Italy

• Kenneth L. McMillan:
  Widening and Interpolation. 1
  
• Aditya V. Nori, Sriram K. Rajamani:
  Program Analysis and Machine Learning: A Win-Win Deal. 2-3
  
• John C. Mitchell:
  Program Analysis for Web Security. 4
  
• Daniel Kästner:
  Astrée: Design and Experience. 5
  
• Jérôme Feret:
  Formal Model Reduction. 6
  
• Ravichandhran Madhavan, Ganesan Ramalingam, Kapil Vaswani:
  Purity Analysis: An Abstract Interpretation Formulation. 7-24
  
• Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn:
  The Complexity of Abduction for Separated Heap Abstractions. 25-42
  
• P. Madhusudan, Xiaokang Qiu:
  Efficient Decision Procedures for Heaps Using STRAND. 43-59
  
• Sam Blackshear, Bor-Yuh Evan Chang, Sriram Sankaranarayanan, Manu Sridharan:
  The Flow-Insensitive Precision of Andersen's Analysis in Practice. 60-76
  
• Andrea Flexeder, Michael Petter, Helmut Seidl:
  Side-Effect Analysis of Assembly Code. 77-94
  
• Kin-Keung Ma, Yit Phang Khoo, Jeffrey S. Foster, Michael Hicks:
  Directed Symbolic Execution. 95-111
  
• Patrice Godefroid, Shuvendu K. Lahiri, Cindy Rubio-González:
  Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation. 112-128
  
• Ahmed Bouajjani, Michael Emmi, Gennaro Parlato:
  On Sequentializing Concurrent Programs. 129-145
  
• Viktor Vafeiadis, Francesco Zappa Nardelli:
  Verifying Fence Elimination Optimisations. 146-162
  
• Jeff Huang, Charles Zhang:
  An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs. 163-179
  
• Matthew Might, David Van Horn:
  A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs. 180-197
  
• Matt Elder, Junghee Lim, Tushar Sharma, Tycho Andersen, Thomas W. Reps:
  Abstract Domains of Affine Relations. 198-215
  
• Sven Verdoolaege, Albert Cohen, Anna Beletska:
  Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations. 216-232
  
• Peter Schrammel, Bertrand Jeannet:
  Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs. 233-248
  
• Kenneth L. McMillan, Lenore D. Zuck:
  Invisible Invariants and Abstract Interpretation. 249-262
  
• Guy Avni, Orna Kupferman:
  An Abstraction-Refinement Framework for Trigger Querying. 263-279
  
• Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith:
  Bound Analysis of Imperative Programs with the Size-Change Abstraction. 280-297
  
• Philippe Suter, Ali Sinan Köksal, Viktor Kuncak:
  Satisfiability Modulo Recursive Programs. 298-315
  
• Sasa Misailovic, Daniel M. Roy, Martin C. Rinard:
  Probabilistically Accurate Program Transformations. 316-333
  
• Javier Esparza, Andreas Gaiser:
  Probabilistic Abstractions with Arbitrary Domains. 334-350
  
• Alastair F. Donaldson, Leopold Haller, Daniel Kroening, Philipp Rümmer:
  Software Verification Using k-Induction. 351-368
  
• David Monniaux, Laure Gonnord:
  Using Bounded Model Checking to Focus Fixpoint Iterations. 369-385
  

Last update Fri May 25 08:35:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page