Vai al contenuto principale della pagina

NASA Formal Methods : 12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11–15, 2020, Proceedings / / edited by Ritchie Lee, Susmit Jha, Anastasia Mavridou, Dimitra Giannakopoulou



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: NASA Formal Methods : 12th International Symposium, NFM 2020, Moffett Field, CA, USA, May 11–15, 2020, Proceedings / / edited by Ritchie Lee, Susmit Jha, Anastasia Mavridou, Dimitra Giannakopoulou Visualizza cluster
Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020
Edizione: 1st ed. 2020.
Descrizione fisica: 1 online resource (XXI, 442 p. 49 illus.)
Disciplina: 004.0151
Soggetto topico: Software engineering
Computer organization
Computers
Artificial intelligence
Computer simulation
Software Engineering
Computer Systems Organization and Communication Networks
Theory of Computation
Artificial Intelligence
Simulation and Modeling
Persona (resp. second.): LeeRitchie
JhaSusmit
MavridouAnastasia
GiannakopoulouDimitra
Nota di contenuto: Learning and Formal Synthesis -- From Passive to Active: Learning Timed Automata Efficiently -- Generating Correct-by-Construction Distributed Implementations from Formal Maude Designs -- Parameter Synthesis and Robustness Analysis of Rule-Based Models -- Formal Methods for DNNs -- PaRoT: A Practical Framework for Robust Deep Neural Network Training -- Simplifying Neural Networks using Formal Verification -- High Assurance Systems -- Neural Simplex Architecture -- Strengthening Deterministic Policies for POMDPs -- Benchmarking Software Model Checkers on Automotive Code -- Requirement Specification and Testing -- Automated Requirements-Based Testing of Black-Box Reactive Systems -- Formal Verification of Parallel Prefix Sum -- Specification Quality Metrics Based on Mutation and Inductive Incremental Model Checking -- Validation and Solvers -- A Validation Methodology for OCaml-to-PVS Translation -- On the Usefulness of Clause Strengthening in Parallel SAT Solving -- Solvers and Program Analysis -- Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL* -- Constraint Caching Revisited -- Per-Location Simulation -- Verification and Timed Systems -- Sampling Distributed Schedules for Resilient Space Communication -- Model Checking Timed Hyperproperties in Discrete-Time Systems -- Verifying Band Convergence for Sampled Control Systems -- Autonomy and Other Applications -- Heterogeneous Verification of an Autonomous Curiosity Rover -- Run-Time Assurance for Learning-Enabled Systems -- hpnmg: A CC++ Tool for Model Checking Hybrid Petri Nets with General Transitions -- Hybrid and Cyber-Physical Systems -- A Transformation of Hybrid Petri Nets with Stochastic Firings into a Subclass of Stochastic Hybrid Automata -- Constraining Counterexamples in Hybrid System Falsification: Penalty-Based Approaches -- Falsification of Cyber-Physical Systems with Constrained Signal Spaces.
Sommario/riassunto: The chapter “Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
Titolo autorizzato: NASA Formal Methods  Visualizza cluster
ISBN: 3-030-55754-5
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910416085603321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Programming and Software Engineering ; ; 12229