Advertisement

NASA Formal Methods

Third International Symposium, NFM 2011, Pasadena, CA, USA, April 18-20, 2011. Proceedings

  • Mihaela Bobaru
  • Klaus Havelund
  • Gerard J. Holzmann
  • Rajeev Joshi
Conference proceedings NFM 2011

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6617)

Table of contents

  1. Front Matter
    PDF

  2. Invited Talks

    1. From Retrospective Verification to Forward-Looking Development
      K. Rustan M. Leino
      Pages 1-1
      PDF
    2. Specifications for Free
      Andreas Zeller
      Pages 2-12

  3. Invited Tutorials

    1. The Theory and Practice of SALT
      Andreas Bauer, Martin Leucker
      Pages 13-40
    2. VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java
      Bart Jacobs, Jan Smans, Pieter Philippaerts, Frédéric Vogels, Willem Penninckx, Frank Piessens
      Pages 41-55
    3. Verifying Functional Correctness of C Programs with VCC
      Michał Moskal
      Pages 56-57

  4. Regular Papers

    1. Bakar Kiasan: Flexible Contract Checking for Critical Systems Using Symbolic Execution
      Jason Belt, John Hatcliff, Robby, Patrice Chalin, David Hardin, Xianghua Deng
      Pages 58-72
    2. Approximate Quantifier Elimination for Propositional Boolean Formulae
      Jörg Brauer, Andy King
      Pages 73-88
    3. Towards Flight Control Verification Using Automated Theorem Proving
      William Denman, Mohamed H. Zaki, Sofiène Tahar, Luis Rodrigues
      Pages 89-100
    4. Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
      Rüdiger Ehlers
      Pages 101-115
    5. Integrating an Automated Theorem Prover into Agda
      Simon Foster, Georg Struth
      Pages 116-130
    6. Efficient Predicate Abstraction of Program Summaries
      Arie Gurfinkel, Sagar Chaki, Samir Sapra
      Pages 131-145
    7. Synthesis for PCTL in Parametric Markov Decision Processes
      Ernst Moritz Hahn, Tingting Han, Lijun Zhang
      Pages 146-161
    8. Formalizing Probabilistic Safety Claims
      Heber Herencia-Zapana, George Hagen, Anthony Narkawicz
      Pages 162-176
    9. The OpenTheory Standard Theory Library
      Joe Hurd
      Pages 177-191
    10. Instantiation-Based Invariant Discovery
      Temesghen Kahsai, Yeting Ge, Cesare Tinelli
      Pages 192-206
    11. Stuttering Mostly Speeds Up Solving Parity Games
      Sjoerd Cranen, Jeroen J. A. Keiren, Tim A. C. Willemse
      Pages 207-221
    12. Counterexample-Based Error Localization of Behavior Models
      Tsutomu Kumazawa, Tetsuo Tamai
      Pages 222-236
    13. Call Invariants
      Shuvendu K. Lahiri, Shaz Qadeer
      Pages 237-251
    14. Symmetry for the Analysis of Dynamic Systems
      Zarrin Langari, Richard Trefler
      Pages 252-266
    15. Implementing Cryptographic Primitives in the Symbolic Model
      Peeter Laud
      Pages 267-281
    16. Model Checking Using SMT and Theory of Lists
      Aleksandar Milicevic, Hillel Kugler
      Pages 282-297
    17. Automated Test Case Generation with SMT-Solving and Abstract Interpretation
      Jan Peleska, Elena Vorobev, Florian Lapschies
      Pages 298-312
    18. Generating Data Race Witnesses by an SMT-Based Analysis
      Mahmoud Said, Chao Wang, Zijiang Yang, Karem Sakallah
      Pages 313-327
    19. Applying Atomicity and Model Decomposition to a Space Craft System in Event-B
      Asieh Salehi Fathabadi, Abdolbaghi Rezazadeh, Michael Butler
      Pages 328-342
    20. A Theory of Skiplists with Applications to the Verification of Concurrent Datatypes
      Alejandro Sánchez, César Sánchez
      Pages 343-358
    21. CORAL: Solving Complex Constraints for Symbolic PathFinder
      Matheus Souza, Mateus Borges, Marcelo d’Amorim, Corina S. Păsăreanu
      Pages 359-374
    22. Automated Formal Verification of the TTEthernet Synchronization Quality
      Wilfried Steiner, Bruno Dutertre
      Pages 375-390
    23. Extending the GWV Security Policy and Its Modular Application to a Separation Kernel
      Sergey Tverdyshev
      Pages 391-405
    24. Combining Partial-Order Reduction and Symbolic Model Checking to Verify LTL Properties
      José Vander Meulen, Charles Pecheur
      Pages 406-421
    25. Towards Informed Swarm Verification
      Anton Wijs
      Pages 422-437
    26. Scaling Up with Event-B: A Case Study
      Faqing Yang, Jean-Pierre Jacquot
      Pages 438-452

  5. Tool Papers

    1. D-Finder 2: Towards Efficient Correctness of Incremental Design
      Saddek Bensalem, Andreas Griesmayer, Axel Legay, Thanh-Hung Nguyen, Joseph Sifakis, Rongjie Yan
      Pages 453-458
    2. Infer: An Automatic Program Verifier for Memory Safety of C Programs
      Cristiano Calcagno, Dino Distefano
      Pages 459-465
    3. Model Construction and Priority Synthesis for Simple Interaction Systems
      Chih-Hong Cheng, Saddek Bensalem, Barbara Jobstmann, Rongjie Yan, Alois Knoll, Harald Ruess
      Pages 466-471
    4. OpenJML: JML for Java 7 by Extending OpenJDK
      David R. Cok
      Pages 472-479
    5. jSMTLIB: Tutorial, Validation and Adapter Tools for SMT-LIBv2
      David R. Cok
      Pages 480-486
    6. opaal: A Lattice Model Checker
      Andreas Engelbredt Dalsgaard, René Rydhof Hansen, Kenneth Yrke Jørgensen, Kim Gulstrand Larsen, Mads Chr. Olesen, Petur Olsen et al.
      Pages 487-493
    7. A Tabular Expression Toolbox for Matlab/Simulink
      Colin Eles, Mark Lawford
      Pages 494-499
    8. LLVM2CSP: Extracting CSP Models from Concurrent Programs
      Moritz Kleine, Björn Bartels, Thomas Göthel, Steffen Helke, Dirk Prenzel
      Pages 500-505
    9. Multi-Core LTSmin: Marrying Modularity and Scalability
      Alfons Laarman, Jaco van de Pol, Michael Weber
      Pages 506-511
    10. GiNaCRA: A C++ Library for Real Algebraic Computations
      Ulrich Loup, Erika Ábrahám
      Pages 512-517
    11. Kopitiam: Modular Incremental Interactive Full Functional Static Verification of Java Code
      Hannes Mehnert
      Pages 518-524
    12. Milestones: A Model Checker Combining Symbolic Model Checking and Partial Order Reduction
      José Vander Meulen, Charles Pecheur
      Pages 525-531
  6. Back Matter
    PDF

About these proceedings

Introduction

This book constitutes the refereed proceedings of the Third International Symposium on NASA Formal Methods, NFM 2011, held in Pasadena, CA, USA, in April 2011.
The 26 revised full papers presented together with 12 tool papers, 3 invited talks, and 2 invited tutorials were carefully reviewed and selected from 141 submissions. The topics covered by NFM 2011 included but were not limited to: theorem proving, logic model checking, automated testing and simulation, model-based engineering, real-time and stochastic systems, SAT and SMT solvers, symbolic execution, abstraction and abstraction refinement, compositional verification techniques; static and dynamic analysis techniques, fault protection, cyber security, specification formalisms, requirements analysis, and applications of formal techniques.

Keywords

automated reasoning concurrency requirements analysis software verification validation

Editors and affiliations

  • Mihaela Bobaru
    • 1
  • Klaus Havelund
    • 1
  • Gerard J. Holzmann
    • 1
  • Rajeev Joshi
    • 1
  1. 1.NASA Jet Propulsion LaboratoryPasadenaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-20398-5
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-20397-8
  • Online ISBN 978-3-642-20398-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site