Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    edoccha_BV048250789
    Format: 1 Online-Ressource (xxii, 828 Seiten) : , 218 Illustrationen, 167 in Farbe.
    ISBN: 978-3-031-06773-0
    Series Statement: Lecture notes in computer science 13260
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06772-3
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06774-7
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Formale Methode ; Testen ; Verifikation ; Automatisches Beweisverfahren ; Softwareentwicklung ; Systementwicklung ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    edocfu_BV048250789
    Format: 1 Online-Ressource (xxii, 828 Seiten) : , 218 Illustrationen, 167 in Farbe.
    ISBN: 978-3-031-06773-0
    Series Statement: Lecture notes in computer science 13260
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06772-3
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06774-7
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Formale Methode ; Testen ; Verifikation ; Automatisches Beweisverfahren ; Softwareentwicklung ; Systementwicklung ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almafu_BV048250789
    Format: 1 Online-Ressource (xxii, 828 Seiten) : , 218 Illustrationen, 167 in Farbe.
    ISBN: 978-3-031-06773-0
    Series Statement: Lecture notes in computer science 13260
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06772-3
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06774-7
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Formale Methode ; Testen ; Verifikation ; Automatisches Beweisverfahren ; Softwareentwicklung ; Systementwicklung ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    b3kat_BV048250789
    Format: 1 Online-Ressource (xxii, 828 Seiten) , 218 Illustrationen, 167 in Farbe
    ISBN: 9783031067730
    Series Statement: Lecture notes in computer science 13260
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06772-3
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 978-3-031-06774-7
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Formale Methode ; Testen ; Verifikation ; Automatisches Beweisverfahren ; Softwareentwicklung ; Systementwicklung ; Konferenzschrift
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    gbv_1804281425
    Format: 1 Online-Ressource(XXII, 828 p. 218 illus., 167 illus. in color.)
    Edition: 1st ed. 2022.
    ISBN: 9783031067730
    Series Statement: Lecture Notes in Computer Science 13260
    Content: Invited Keynotes -- Formal Methods for Trusted Space Autonomy: Boon or Bane -- An Essence of Domain Engineering - A Basis for Trustworthy Aeronautics and Space Software -- Concept Design Moves -- Automating Program Transformation with Coccinelle -- The Prusti Project: Formal Verification for Rust -- Summers Reachability Analysis for Cyber-Physical Systems: Are we there yet -- Regular Submissions -- Towards Better Test Coverage: Merging Unit Tests for Autonomous Systems -- Quantification of Battery Depletion Risk Made Efficient -- Hierarchical Contract-based Synthesis for Assurance Cases -- Verified Probabilistic Policies for Deep Reinforcement Learning -- NNLander-VeriF: A Neural Network Formal Verification Framework for Vision-Based Autonomous Aircraft Landing -- The Black-Box Simplex Architecture for Runtime Assurance of Autonomous CPS -- Case Studies for Computing Density of Reachable States for Safe Autonomous Motion Planning -- Towards Refactoring FRETish Requirements -- Neural Network Compression of ACAS Xu Early Prototype is Unsafe: Closed-Loop Verification through Quantized State Backreachability -- ZoPE: A Fast Optimizer for ReLU Networks with Low-Dimensional Inputs -- Permutation Invariance of Deep Neural Networks with ReLUs -- Configurable Benchmarks for C Model Checkers -- AssumeGuarantee Reasoning with Scheduled Components -- Stateful Black-Box Fuzzing of Bluetooth Devices Using Automata Learning -- From Verified Scala to STIX File System Embedded Code using Stainless -- On the Termination of Borrow Checking in Featherweight Rust -- Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme -- Zone Extrapolations in Parametric Timed Automata -- Exemplifying Parametric Timed Specifications over Signals with Bounded Behavior -- Timed Automata Learning via SMT Solving -- Asynchronous Composition of Local Interface LTL Properties -- Elucidation and Analysis of Specification Patterns in Aerospace System Telemetry -- Robust Computation Tree Logic -- On the-Fly Model Checking with Neural MCTS -- Checking and Test Generation for Comprehensive Verification -- Operational Annotations: a New Method for Sequential Program Verification -- Byzantine Fault Tolerant Consensus in Agda -- DSV: Disassembly Soundness Validation without Assuming a Ground Truth -- Probabilistic Hyperproperties with Rewards -- Hypercontracts -- Monitorability of Expressive Verdicts -- BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees -- Approximate Translation from Floating-Point to Real-Interval Arithmetic -- Synthesis of Optimal Defenses for System Architecture Design Model in MaxSMT -- Certified Computation of Nondeterministic Limits -- The Power of Disjoint Support Decompositions in Decision Diagrams -- Incremental Transitive Closure for Zonal Abstract Domain -- Proof Mate: an Interactive Proof Helper for PVS -- Runtime Verification Triggers -- Real-time, Autonomous Fault Recovery on the CySat-I.
    Content: This book constitutes the proceedings of the 14th International Symposium on NASA Formal Methods, NFM 2022, held in Pasadena, USA, during May 24-27, 2022. The 33 full and 6 short papers presented in this volume were carefully reviewed and selected from 118submissions. The volume also contains 6 invited papers. The papers deal with advances in formal methods, formal methods techniques, and formal methods in practice. The focus on topics such as interactive and automated theorem proving; SMT and SAT solving; model checking; use of machine learning and probabilistic reasoning in formal methods; formal methods and graphical modeling languages such as SysML or UML; usability of formal method tools and application in industry, etc. .
    Additional Edition: ISBN 9783031067723
    Additional Edition: ISBN 9783031067747
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783031067723
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783031067747
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9949301615102882
    Format: XXII, 828 p. 218 illus., 167 illus. in color. , online resource.
    Edition: 1st ed. 2022.
    ISBN: 9783031067730
    Series Statement: Lecture Notes in Computer Science, 13260
    Content: This book constitutes the proceedings of the 14th International Symposium on NASA Formal Methods, NFM 2022, held in Pasadena, USA, during May 24-27, 2022. The 33 full and 6 short papers presented in this volume were carefully reviewed and selected from 118submissions. The volume also contains 6 invited papers. The papers deal with advances in formal methods, formal methods techniques, and formal methods in practice. The focus on topics such as interactive and automated theorem proving; SMT and SAT solving; model checking; use of machine learning and probabilistic reasoning in formal methods; formal methods and graphical modeling languages such as SysML or UML; usability of formal method tools and application in industry, etc. .
    Note: Invited Keynotes -- Formal Methods for Trusted Space Autonomy: Boon or Bane -- An Essence of Domain Engineering - A Basis for Trustworthy Aeronautics and Space Software -- Concept Design Moves -- Automating Program Transformation with Coccinelle -- The Prusti Project: Formal Verification for Rust -- Summers Reachability Analysis for Cyber-Physical Systems: Are we there yet -- Regular Submissions -- Towards Better Test Coverage: Merging Unit Tests for Autonomous Systems -- Quantification of Battery Depletion Risk Made Efficient -- Hierarchical Contract-based Synthesis for Assurance Cases -- Verified Probabilistic Policies for Deep Reinforcement Learning -- NNLander-VeriF: A Neural Network Formal Verification Framework for Vision-Based Autonomous Aircraft Landing -- The Black-Box Simplex Architecture for Runtime Assurance of Autonomous CPS -- Case Studies for Computing Density of Reachable States for Safe Autonomous Motion Planning -- Towards Refactoring FRETish Requirements -- Neural Network Compression of ACAS Xu Early Prototype is Unsafe: Closed-Loop Verification through Quantized State Backreachability -- ZoPE: A Fast Optimizer for ReLU Networks with Low-Dimensional Inputs -- Permutation Invariance of Deep Neural Networks with ReLUs -- Configurable Benchmarks for C Model Checkers -- AssumeGuarantee Reasoning with Scheduled Components -- Stateful Black-Box Fuzzing of Bluetooth Devices Using Automata Learning -- From Verified Scala to STIX File System Embedded Code using Stainless -- On the Termination of Borrow Checking in Featherweight Rust -- Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme -- Zone Extrapolations in Parametric Timed Automata -- Exemplifying Parametric Timed Specifications over Signals with Bounded Behavior -- Timed Automata Learning via SMT Solving -- Asynchronous Composition of Local Interface LTL Properties -- Elucidation and Analysis of Specification Patterns in Aerospace System Telemetry -- Robust Computation Tree Logic -- On the-Fly Model Checking with Neural MCTS -- Checking and Test Generation for Comprehensive Verification -- Operational Annotations: a New Method for Sequential Program Verification -- Byzantine Fault Tolerant Consensus in Agda -- DSV: Disassembly Soundness Validation without Assuming a Ground Truth -- Probabilistic Hyperproperties with Rewards -- Hypercontracts -- Monitorability of Expressive Verdicts -- BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees -- Approximate Translation from Floating-Point to Real-Interval Arithmetic -- Synthesis of Optimal Defenses for System Architecture Design Model in MaxSMT -- Certified Computation of Nondeterministic Limits -- The Power of Disjoint Support Decompositions in Decision Diagrams -- Incremental Transitive Closure for Zonal Abstract Domain -- Proof Mate: an Interactive Proof Helper for PVS -- Runtime Verification Triggers -- Real-time, Autonomous Fault Recovery on the CySat-I.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783031067723
    Additional Edition: Printed edition: ISBN 9783031067747
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    b3kat_BV048292916
    Format: xxii, 828 Seiten , Illustrationen, Diagramme
    ISBN: 9783031067723
    Series Statement: Lecture notes in computer science 13260
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-3-031-06773-0
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Formale Methode ; Testen ; Verifikation ; Automatisches Beweisverfahren ; Softwareentwicklung ; Systementwicklung ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783030167523?
Did you mean 9783030677923?
Did you mean 9783030697723?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages