12. VMCAI 2011: Austin, Texas, USA

• David L. Dill:
  Are Cells Asynchronous Circuits? - (Invited Talk). 1
  
• Stephen F. Siegel, Ganesh Gopalakrishnan:
  Formal Analysis of Message Passing - (Invited Talk). 2-18
  
• Francesco Logozzo:
  Practical Verification for the Working Programmer with CodeContracts and Abstract Interpretation - (Invited Talk). 19-22
  
• Bernhard Steffen, Oliver Rüthing:
  Quality Engineering: Leveraging Heterogeneous Information - (Invited Talk). 23-37
  
• Elvira Albert, Samir Genaim, Abu Naser Masud:
  More Precise Yet Widely Applicable Cost Analysis. 38-53
  
• Sébastien Bardin, Philippe Herrmann, Franck Védrine:
  Refinement-Based CFG Reconstruction from Unstructured Programs. 54-69
  
• Aaron R. Bradley:
  SAT-Based Model Checking without Unrolling. 70-87
  
• Angelo Brillout, Daniel Kroening, Philipp Rümmer, Thomas Wahl:
  Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic. 88-102
  
• Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
  Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds. 103-117
  
• Chih-Hong Cheng, Harald Rueß, Alois Knoll, Christian Buckl:
  Synthesis of Fault-Tolerant Embedded Systems Using Games: From Theory to Practice. 118-133
  
• Byron Cook, Jasmin Fisher, Elzbieta Krepska, Nir Piterman:
  Proving Stabilization of Biological Systems. 134-149
  
• Patrick Cousot, Radhia Cousot, Francesco Logozzo:
  Precondition Inference from Intermittent Assertions and Application to Contracts on Collections. 150-168
  
• Alastair F. Donaldson, Leopold Haller, Daniel Kroening:
  Strengthening Induction-Based Race Checking with Lightweight Static Analysis. 169-183
  
• Robert Frohardt, Bor-Yuh Evan Chang, Sriram Sankaranarayanan:
  Access Nets: Modeling Access to Physical Spaces. 184-198
  
• Thomas Martin Gawlitza, Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
  Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation. 199-213
  
• Alexander Gotmanov, Satrajit Chatterjee, Michael Kishinevsky:
  Verifying Deadlock-Freedom of Communication Fabrics. 214-231
  
• Eric Goubault, Sylvie Putot:
  Static Analysis of Finite Precision Computations. 232-247
  
• Pieter Hooimeijer, Margus Veanes:
  An Evaluation of Automata Algorithms for String Analysis. 248-262
  
• Falk Howar, Bernhard Steffen, Maik Merten:
  Automata Learning with Automated Alphabet Abstraction Refinement. 263-277
  
• Swen Jacobs, Viktor Kuncak:
  Towards Complete Reasoning about Axiomatic Specifications. 278-293
  
• Se-Won Kim, Kwang-Moo Choe:
  String Analysis as an Abstract Interpretation. 294-308
  
• Shuvendu K. Lahiri, Julien Vanegue:
  ExplainHoudini: Making Houdini Inference Transparent. 309-323
  
• Benoît Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher, Andrzej Wasowski:
  Abstract Probabilistic Automata. 324-339
  
• Nuno P. Lopes, Andrey Rybalchenko:
  Distributed and Predictable Software Model Checking. 340-355
  
• Hakjoo Oh, Lucas Brutschy, Kwangkeun Yi:
  Access Analysis-Based Tight Localization of Abstract Memories. 356-370
  
• Ruzica Piskac, Thomas Wies:
  Decision Procedures for Automating Termination Proofs. 371-386
  
• Stephen F. Siegel, Timothy K. Zirkel:
  Collective Assertions. 387-402
  
• Philippe Suter, Robin Steiger, Viktor Kuncak:
  Sets with Cardinality Constraints in Satisfiability Modulo Theories. 403-418
  

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