Person / Goodloe | NASA Formal Methods | Buch | 978-3-642-28890-6 | sack.de

Buch, Englisch, Band 7226, 466 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 721 g

Reihe: Lecture Notes in Computer Science

Person / Goodloe

NASA Formal Methods

4th International Symposium, NFM 2012, Norfolk, VA, USA, April 3-5, 2012, Proceedings
2012
ISBN: 978-3-642-28890-6
Verlag: Springer

4th International Symposium, NFM 2012, Norfolk, VA, USA, April 3-5, 2012, Proceedings

Buch, Englisch, Band 7226, 466 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 721 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-642-28890-6
Verlag: Springer


This book constitutes the refereed proceedings of the Fourth International Symposium on NASA Formal Methods, NFM 2012, held in Norfolk, VA, USA, in April 2012.

The 36 revised regular papers presented together with 10 short papers, 3 invited talks were carefully reviewed and selected from 93 submissions. The topics are organized in topical sections on theorem proving, symbolic execution, model-based engineering, real-time and stochastic systems, model checking, 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.

Person / Goodloe NASA Formal Methods jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


SMT-Based Model Checking.-Verified Software Toolchain (Abstract).-Formal Verification by Abstract Interpretation.-Quantitative Timed Analysis of Interactive Markov Chains.-Lessons Learnt from the Adoption of Formal Model-Based Development.-Symbolic Execution of Communicating and Hierarchically Composed UML-RT State Machines.-Inferring Definite Counterexamples through Under-Approximation.-Modifying Test Suite Composition to Enable Effective Predicate-Level Statistical Debugging.-Rigorous Polynomial Approximation Using Taylor Models in COQ.-Enhancing the Inverse Method with State Merging.-Class-Modular, Class-Escape and Points-to Analysis for Object-Oriented Languages.-Testing Static Analyzers with Randomly Generated Programs.-Compositional Verification of Architectural Models.-A Safety Case Pattern for Model-Based Development Approach.-PVS Linear Algebra Libraries for Verification of Control Software Algorithms in C/ACSL.-Temporal Action Language (TAL): A Controlled Language for Consistency Checking of Natural Language Temporal Requirements (Preliminary Results).-Some Steps into Verification of Exact Real Arithmetic.-Runtime Verification Meets Android Security.-Specification in PDL with Recursion.-Automatically Proving Thousands of Verification Conditions Using an SMT Solver: An Empirical Study.-Sound Formal Verification of Linux’s USB BP Keyboard Driver.-Learning Markov Models for Stationary System Behaviors.-The Use of Rippling to Automate Event-B Invariant Preservation Proofs.-Thread-Modular Model Checking with Iterative Refinement.-Towards LTL Model Checking of Unmodified Thread-Based C & C++ Programs.-Integrating Statechart Components in Polyglot.-Using PVS to Investigate Incidents through the Lens of Distributed Cognition.-Automated Analysis of Parametric Timing-Based Mutual Exclusion Algorithms.-Efficient Symbolic Execution of Value-Based Data Structures for Critical Systems.-Generating Verifiable Java Code from Verified PVSSpecifications.-Belief Bisimulation for Hidden Markov Models: Logical Characterisation and Decision Algorithm.-Abstract Model Repair.-CLSE: Closed-Loop Symbolic Execution.-On the Development and Formalization of an Extensible Code Generator for Real Life Security Protocols.-Incremental Verification with Mode Variable Invariants in State Machines.-A Semantic Analysis of Wireless Network Security Protocols.-Runtime Verification with Predictive Semantics.-A Case Study in Verification of Embedded Network Software.-Checking and Distributing Statistical Model Checking.-



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.