Verification, Model Checking, and Abstract Interpretation: 12th International Conference, VMCAI 2011, Austin, TX, USA, January 23-25, 2011. Proceedings PDF
Preview Verification, Model Checking, and Abstract Interpretation: 12th International Conference, VMCAI 2011, Austin, TX, USA, January 23-25, 2011. Proceedings
Lecture Notes in Computer Science 6538 CommencedPublicationin1973 FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen EditorialBoard DavidHutchison LancasterUniversity,UK TakeoKanade CarnegieMellonUniversity,Pittsburgh,PA,USA JosefKittler UniversityofSurrey,Guildford,UK JonM.Kleinberg CornellUniversity,Ithaca,NY,USA AlfredKobsa UniversityofCalifornia,Irvine,CA,USA FriedemannMattern ETHZurich,Switzerland JohnC.Mitchell StanfordUniversity,CA,USA MoniNaor WeizmannInstituteofScience,Rehovot,Israel OscarNierstrasz UniversityofBern,Switzerland C.PanduRangan IndianInstituteofTechnology,Madras,India BernhardSteffen TUDortmundUniversity,Germany MadhuSudan MicrosoftResearch,Cambridge,MA,USA DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA DougTygar UniversityofCalifornia,Berkeley,CA,USA GerhardWeikum MaxPlanckInstituteforInformatics,Saarbruecken,Germany Ranjit Jhala David Schmidt (Eds.) Verification, Model Checking, and Abstract Interpretation 12th International Conference, VMCAI 2011 Austin, TX, USA, January 23-25, 2011 Proceedings 1 3 VolumeEditors RanjitJhala UniversityofCalifornia,SanDiego,USA E-mail:[email protected] DavidSchmidt KansasStateUniversity,KansasCity,USA E-mail:[email protected] ISSN0302-9743 e-ISSN0302-9743 ISBN978-3-642-18274-7 e-ISBN978-3-642-18275-4 DOI10.1007/978-3-642-18275-4 SpringerHeidelbergDordrechtLondonNewYork LibraryofCongressControlNumber:Appliedfor CRSubjectClassification(1998):F.3.1,F.3.2,D.2.4,F.4.1,D.1-3,D.3.4 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©Springer-VerlagBerlinHeidelberg2011 Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting, reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965, initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable toprosecutionundertheGermanCopyrightLaw. Theuseofgeneraldescriptivenames,registerednames,trademarks,etc.inthispublicationdoesnotimply, evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevantprotectivelaws andregulationsandthereforefreeforgeneraluse. Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India Printedonacid-freepaper SpringerispartofSpringerScience+BusinessMedia(www.springer.com) Preface This volume contains the proceedings of the 12th International Conference on Verification,Model Checking,and Abstract Interpretation(VMCAI 2011),held in Austin, Texas, USA, during January 23-25,2011.VMCAI 2011 was the 12th in a series of meetings; previous editions of the conference were held in Port Jefferson1997,Pisa1998,Venice2002,New York2003,Venice2004,Paris2005, Charleston2006,Nice2007,andSanFrancisco2008,Savannah2009,andMadrid 2010. VMCAI provides a forum for researchers from the communities of verifi- cation, model checking, and abstract interpretation. The conference showcases state-of-the-artresearchin each of those areas and facilitates interaction, cross- fertilization, andadvancement of hybridmethods that spanmultiple areas.The topics covered in the conference include program verification, model checking, abstract interpretation static analysis, deductive methods, program certifica- tion, debugging techniques, abstract domains, type systems, optimization. Pa- pers may addressany programmingparadigm,including concurrent,constraint, functional, imperative, logic and object-oriented programming. This year, 71 papers were submitted to VMCAI. Each submission was re- viewed by at least three Program Committee members, and on average each paperwasreviewedby3.3committeemembers.Aftercarefullydeliberatingover therelevanceandqualityofeachpaper,theProgramCommitteechosetoaccept 24 papers for presentation at the conference. This year’s edition continued the VMCAI tradition of inviting distinguished speakers to give talks and tutorials. The program includes talks by: – David Dill (Stanford University) on Are Cells Asynchronous Circuits? – GaneshGopalakrishnan(UniversityofUtah)andStephenSiegel(University of Delaware) on Formal Analysis of Message Passing – FrancescoLogozzo(MicrosoftResearch,Redmond)on Practical Verification fortheWorkingProgrammerwithCodeContractsandAbstractInterpretation – Bernhard Steffen and Oliver Ru¨thing on Quality Engineering Leveraging Heterogeneous Information The quality of the conference crucially depends on the hard work the Program Committee andsubreviewersputinto the paper selectionprocess;we wouldlike to profusely thank them for their efforts. Our thanks also go to the Steering Committee members for helpful advice, in particular to Lenore Zuck for her invaluable efforts in the conference organization. VMCAI 2011 was co-located withPOPL2011andheldinco-operationwithACM(AssociationforComputing VI Preface Machinery).WethankMatthewMight,whoservedasourinterfacetothePOPL organizersandACMforhelpwiththelocalarrangements.Finally,wearegrateful to Andrei Voronkov whose EasyChair system eased the submission and paper selection process, and greatly simplified the compilation of the proceedings. January 2011 Ranjit Jhala David Schmidt Conference Organization Program Chairs Ranjit Jhala David Schmidt Program Committee Josh Berdine Orna Kupferman Ahmed Bouajjani Akash Lal Swarat Chaudhuri Kedar Namjoshi Patrick Cousot Corina Pasareanu Dino Di Stefano Ganesan Ramalingam Azadeh Farzan Andrey Rybalchenko Cormac Flanagan Sriram Sankaranarayanan Aarti Gupta Tachio Terauchi Viktor Kuncak Lenore Zuck Steering Committee Agostino Cortesi Andreas Podelski Patrick Cousot Thomas W. Reps E. Allen Emerson David Schmidt Giorgio Levi Lenore Zuck External Reviewers Aws Albarghouthi Christoph Csallner Elvira Albert Eva Darulova Paolo Baldan Giorgio Delzanno Nick Benton Isil Dillig Frederic Besson Thomas Dillig Armin Biere Cezara Dragoi Sylvie Boldo Constantin Enea Aaron Bradley J´erˆome Feret Arthur Chargu´eraud Bernd Finkbeiner Krishnendu Chatterjee Robert Frohardt Yannick Chevalier Malay Ganai Adam Chlipala Vijay Ganesh Arlen Cox Pierre Ganty VIII Table of Contents Ganesh Gopalakrishnan Gethin Norman Alexey Gotsman Madhusudan Parthasarathy Radu Grigore Rasmus Lerchedahl Petersen Arie Gurfinkel Polyvios Pratikakis Peter Habermehl Vishwanath Raman Chris Hawblitzel Bernhard Reus Pieter Hooimeijer Noam Rinetzky Swen Jacobs Xavier Rival Radha Jagadeesan Neha Rungta Barbara Jobstmann Yaniv Sa’ar Vineet Kahlon Mark Schellhase Nicholas Kidd Koushik Sen Zachary Kincaid Mihaela Sighireanu Johannes Kinder Rishabh Singh Laura Kovacs A. Prasad Sistla Sudipta Kundu Jeremy Sproston Shuvendu Lahiri Manu Sridharan Arun Lakhotia Saurabh Srivastava Vincent Laviron Ofer Strichman Francesca Levi Philippe Suter Wenchao Li Serdar Tasiran Francesco Logozzo Aditya Thakur Giuliano Losa Ashish Tiwari Roberto Lublinerman Richard Trefler Stephen Magill Viktor Vafeiadis Rupak Majumdar Kapil Vaswani Roman Manevich Thomas Wahl Laurent Mauborgne Andrzej Wasowski Alexandru Mereacre Sam Weber Yasuhiko Minamide Westley Weimer Antoine Min´e Herbert Wiklicky Anders Mo¨ller Greta Yorsh Michael Monerau Fadi Zaraket Madanlal Musuvathi Florian Zuleger Aditya Nori Table of Contents Are Cells Asynchronous Circuits? (Invited Talk) ..................... 1 David L. Dill Formal Analysis of Message Passing (Invited Talk) ................... 2 Stephen F. Siegel and Ganesh Gopalakrishnan PracticalVerificationfor the WorkingProgrammerwith CodeContracts and Abstract Interpretation (Invited Talk) .......................... 19 Francesco Logozzo Quality Engineering: Leveraging Heterogeneous Information (Invited Talk) ................................................... 23 Bernhard Steffen and Oliver Ru¨thing More Precise Yet Widely Applicable Cost Analysis ................... 38 Elvira Albert, Samir Genaim, and Abu Naser Masud Refinement-Based CFG Reconstruction from Unstructured Programs... 54 S´ebastien Bardin, Philippe Herrmann, and Franck V´edrine SAT-Based Model Checking without Unrolling....................... 70 Aaron R. Bradley Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic ...................................................... 88 Angelo Brillout, Daniel Kroening, Philipp Ru¨mmer, and Thomas Wahl Probabilistic Bu¨chi Automata with Non-extremal Acceptance Thresholds ...................................................... 103 Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan Synthesis of Fault-Tolerant Embedded Systems Using Games: From Theory to Practice.......................................... 118 Chih-Hong Cheng, Harald Rueß, Alois Knoll, and Christian Buckl Proving Stabilization of Biological Systems.......................... 134 Byron Cook, Jasmin Fisher, Elzbieta Krepska, and Nir Piterman X Table of Contents Precondition Inference from Intermittent Assertrions and Application to Contracts on Collections........................................ 150 Patrick Cousot, Radhia Cousot, and Francesco Logozzo Strengthening Induction-Based Race Checking with Lightweight Static Analysis ........................................................ 169 Alastair F. Donaldson, Leopold Haller, and Daniel Kroening Access Nets: Modeling Access to Physical Spaces..................... 184 Robert Frohardt, Bor-Yuh Evan Chang, and Sriram Sankaranarayanan Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation........................... 199 Thomas Martin Gawlitza, Peter Lammich, Markus Mu¨ller-Olm, Helmut Seidl, and Alexander Wenner Verifying Deadlock-Freedom of Communication Fabrics ............... 214 Alexander Gotmanov, Satrajit Chatterjee, and Michael Kishinevsky Static Analysis of Finite Precision Computations..................... 232 Eric Goubault and Sylvie Putot An Evaluation of Automata Algorithms for String Analysis............ 248 Pieter Hooimeijer and Margus Veanes Automata Learning with Automated Alphabet Abstraction Refinement...................................................... 263 Falk Howar, Bernhard Steffen, and Maik Merten Towards Complete Reasoning about Axiomatic Specifications.......... 278 Swen Jacobs and Viktor Kuncak String Analysis as an Abstract Interpretation........................ 294 Se-Won Kim and Kwang-Moo Choe ExplainHoudini: Making Houdini Inference Transparent............... 309 Shuvendu K. Lahiri and Julien Vanegue Abstract Probabilistic Automata................................... 324 Benoˆıt Delahaye, Joost-Pieter Katoen, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Falak Sher, and Andrzej Wa¸sowski Distributed and Predictable Software Model Checking ................ 340 Nuno P. Lopes and Andrey Rybalchenko Access Analysis-Based Tight Localization of Abstract Memories ....... 356 Hakjoo Oh, Lucas Brutschy, and Kwangkeun Yi Table of Contents XI Decision Procedures for Automating Termination Proofs .............. 371 Ruzica Piskac and Thomas Wies Collective Assertions ............................................. 387 Stephen F. Siegel and Timothy K. Zirkel Sets with Cardinality Constraints in Satisfiability Modulo Theories..... 403 Philippe Suter, Robin Steiger, and Viktor Kuncak Author Index.................................................. 419
The list of books you might like
