NASA formal methods : 7th international symposium, NFM 2015, Pasadena, CA, USA, April 27-29, 2015, proceedings / Klaus Havelund, Gerard Holzmann, Rajeev Joshi, (Eds.).

"This book constitutes the refereed proceedings of the 7th International Symposium on NASA Formal Methods, NFM 2015, held in Pasadena, CA, USA, in April 2015.The 24 revised regular papers presented together with 9 short papers were carefully reviewed and selected from 108 submissions. The topic...

Full description

Saved in:
Bibliographic Details
Corporate Author: NFM (Symposium) Pasadena, Calif.)
Other Authors: Havelund, Klaus, 1955- (Editor), Holzmann, Gerard J. (Editor), Joshi, Rajeev (Editor)
Format: Ebook
Language:English
Published: Cham : Springer, [2015]
Series:Lecture notes in computer science ; 9058.
Subjects:
Online Access:Springer eBooks

MARC

LEADER 00000czm a2200000 i 4500
003 OCoLC
005 20230920132341.0
007 cr mn|||||n|||
008 150427s2015 sz a fob 101 0 eng d
011 |a Direct Search Result 
011 |a EDS Title: NASA Formal Methods : 7th International Symposium, NFM 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings 
011 |a MARC Score : 10650(22550) : OK 
020 |z 3319175238  |q pbk. 
020 |z 9783319175232  |q pbk. 
035 |a (ATU)b2436521x 
035 |a (EDS)EDS4605547 
035 |a (OCoLC)907468312 
040 |a CDX  |b eng  |e rda  |c CDX  |d OCLCO  |d YDXCP  |d BTCTA  |d KSU  |d OCLCF  |d OCLCQ  |d ATU 
050 4 |a QA76.9.F67  |b N38 2015 
082 0 4 |a 004.0151  |2 23 
111 2 |a NFM (Symposium)  |n (7th :  |d 2015 :  |c Pasadena, Calif.)  |9 497097 
245 1 0 |a NASA formal methods :  |b 7th international symposium, NFM 2015, Pasadena, CA, USA, April 27-29, 2015, proceedings /  |c Klaus Havelund, Gerard Holzmann, Rajeev Joshi, (Eds.). 
264 1 |a Cham :  |b Springer,  |c [2015] 
264 4 |c ©2015 
300 |a 1 online resource (xiii, 458 pages) :  |b illustrations. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Lecture notes in computer science ;  |v 9058 
504 |a Includes bibliographical references and index. 
505 0 0 |t Invited Papers: --  |t Moving Fast with Software Verification /  |r Cristiano Calcagno, Dino Distefano, Jeremy Dubreil, Dominik Gabi, Pieter Hooimeijer, Martino Luca et al. --  |t Developing Verified Software Using Leon /  |r Viktor Kuncak --  |t Regular Papers: --  |t Timely Rollback: Specification and Verification /  |r Martín Abadi, Michael Isard --  |t Sum of Abstract Domains /  |r Gianluca Amato, Simone Di Nardo Di Maio, Francesca Scozzari --  |t Reachability Preservation Based Parameter Synthesis for Timed Automata /  |r Étienne André, Giuseppe Lipari, Hoang Gia Nguyen, Youcheng Sun --  |t Compositional Verification of Parameterised Timed Systems /  |r Lăcrămioara Aştefănoaei, Souha Ben Rayana, Saddek Bensalem, Marius Bozga, Jacques Combaz --  |t Requirements Analysis of a Quad-Redundant Flight Control System /  |r John Backes, Darren Cofer, Steven Miller, Michael W. Whalen --  |t Partial Order Reduction and Symmetry with Multiple Representatives /  |r Dragan Bošnački, Mark Scheffer --  |t Statistical Model Checking of Ad Hoc Routing Protocols in Lossy Grid Networks /  |r Alice Dal Corso, Damiano Macedonio, Massimo Merro --  |t Efficient Guiding Strategies for Testing of Temporal Properties of Hybrid Systems /  |r Tommaso Dreossi, Thao Dang, Alexandre Donzé, James Kapinski, Xiaoqing Jin, Jyotirmoy V. Deshmukh --  |t First-Order Transitive Closure Axiomatization via Iterative Invariant Injections /  |r Aboubakr Achraf El Ghazi, Mana Taghdiri, Mihai Herda --  |t Reachability Analysis Using Extremal Rates /  |r Andrew N. Fisher, Chris J. Myers, Peng Li --  |t Towards Realizability Checking of Contracts Using Theories /  |r Andrew Gacek, Andreas Katis, Michael W. Whalen, John Backes, Darren Cofer --  |t Practical Partial Order Reduction for CSP /  |r Thomas Gibson-Robinson, Henri Hansen, A. W. Roscoe, Xu Wang --  |t A Little Language for Testing /  |r Alex Groce, Jervis Pinto --  |t Detecting MPI Zero Buffer Incompatibility by SMT Encoding /  |r Yu Huang, Eric Mercer --  |t A Falsification View of Success Typing /  |r Robert Jakob, Peter Thiemann --  |t Verified ROS-Based Deployment of Platform-Independent Control Systems /  |r Wenrui Meng, Junkil Park, Oleg Sokolsky, Stephanie Weirich, Insup Lee --  |t A Rigorous Approach to Combining Use Case Modelling and Accident Scenarios /  |r Rajiv Murali, Andrew Ireland, Gudmund Grov --  |t Are We There Yet? Determining the Adequacy of Formalized Requirements and Test Suites /  |r Anitha Murugesan, Michael W. Whalen, Neha Rungta, Oksana Tkachuk, Suzette Person, Mats P. E. Heimdahl et al. --  |t A Greedy Approach for the Efficient Repair of Stochastic Models /  |r Shashank Pathak, Erika Ábrahám, Nils Jansen, Armando Tacchella, Joost-Pieter Katoen --  |t Integrating SMT with Theorem Proving for Analog/Mixed-Signal Circuit Verification /  |r Yan Peng, Mark Greenstreet --  |t Conflict-Directed Graph Coverage /  |r Daniel Schwartz-Narbonne, Martin Schäf, Dejan Jovanović, Philipp Rümmer, Thomas Wies --  |t Shape Analysis with Connectors /  |r Holger Siegel, Axel Simon --  |t Automated Conflict-Free Concurrent Implementation of Timed Component-Based Models /  |r Ahlem Triki, Borzoo Bonakdarpour, Jacques Combaz, Saddek Bensalem --  |t Formal API Specification of the PikeOS Separation Kernel /  |r Freek Verbeek, Oto Havle, Julien Schmaltz, Sergey Tverdyshev, Holger Blasum, Bruno Langenstein et al. --  |t Short Papers: --  |t Data Model Bugs /  |r Ivan Bocić, Tevfik Bultan --  |t Predicting and Witnessing Data Races Using CSP /  |r Luis M. Carril, Walter F. Tichy --  |t A Benchmark Suite for Hybrid Systems Reachability Analysis /  |r Xin Chen, Stefan Schupp, Ibtissem Ben Makhlouf, Erika Ábrahám, Goran Frehse, Stefan Kowalewski --  |t Generalizing a Mathematical Analysis Library in Isabelle/HOL /  |r Jesús Aransay, Jose Divasón --  |t A Tool for Intersecting Context-Free Grammars and Its Applications /  |r Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey --  |t UFIT: A Tool for Modeling Faults in UPPAAL Timed Automata /  |r Reza Hajisheykhi, Ali Ebnenasir, Sandeep S. Kulkarni --  |t Blocked Literals Are Universal /  |r Marijn J. H. Heule, Martina Seidl, Armin Biere --  |t Practical Formal Verification of Domain-Specific Language Applications /  |r Greg Eakman, Howard Reubenstein, Tom Hawkins, Mitesh Jain, Panagiotis Manolios --  |t Reporting Races in Dynamic Partial Order Reduction /  |r Olli Saarikivi, Keijo Heljanko. 
520 |a "This book constitutes the refereed proceedings of the 7th International Symposium on NASA Formal Methods, NFM 2015, held in Pasadena, CA, USA, in April 2015.The 24 revised regular papers presented together with 9 short papers were carefully reviewed and selected from 108 submissions. The topics include model checking, theorem proving; SAT and SMT solving; symbolic execution; static analysis; runtime verification; systematic testing; program refinement; compositional verification; security and intrusion detection; modeling and specification formalisms; model-based development; model-based testing; requirement engineering; formal approaches to fault tolerance; and applications of formal methods."--Publisher's website. 
650 0 |a Computer software  |x Verification  |v Congresses  |9 596441 
650 0 |a Formal methods (Computer science)  |v Congresses  |9 557605 
700 1 |a Havelund, Klaus,  |d 1955-  |e editor.  |9 423361 
700 1 |a Holzmann, Gerard J.,  |e editor.  |9 1069480 
700 1 |a Joshi, Rajeev,  |e editor.  |9 890812 
776 1 8 |w (OCoLC)913199450  |w (OCoLC)907192979  |w (OCoLC)908262060 
830 0 |a Lecture notes in computer science ;  |v 9058.  |9 291610 
856 4 0 |u https://ezproxy.aut.ac.nz/login?url=https://link.springer.com/10.1007/978-3-319-17524-9  |z Springer eBooks  |x TEMPORARY ERM URL 
907 |a .b2436521x  |b 06-09-21  |c 15-11-17 
942 |c EB 
998 |a none  |b 16-11-17  |c m  |d z   |e -  |f eng  |g sz   |h 0 
999 |c 1435704  |d 1435704 
Availability
Requests
Request this item Request this AUT item so you can pick it up when you're at the library.
Interlibrary Loan With Interlibrary Loan you can request the item from another library. It's a free service.