Muutke küpsiste eelistusi

Computer Aided Verification: 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I 2019 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 673 pages, kõrgus x laius: 235x155 mm, kaal: 1050 g, 106 Illustrations, color; 897 Illustrations, black and white; XIX, 673 p. 1003 illus., 106 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 11561
  • Ilmumisaeg: 13-Jul-2019
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030255395
  • ISBN-13: 9783030255398
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 673 pages, kõrgus x laius: 235x155 mm, kaal: 1050 g, 106 Illustrations, color; 897 Illustrations, black and white; XIX, 673 p. 1003 illus., 106 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 11561
  • Ilmumisaeg: 13-Jul-2019
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3030255395
  • ISBN-13: 9783030255398

This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. 

The 52 full papers presented  together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: 

Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; 

Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency. 

Automata and Timed Systems.- Symbolic Register Automata.- Abstraction
Refinement Algorithms for Timed Automata.- Fast Algorithms for Handling
Diagonal Constraints in Timed Automata.- Safety and co-safety comparator
automata for discounted-sum inclusion.- Clock Bound Repair for Timed
Systems.- Verifying Asynchronous Interactions via Communicating Session
Automata.- Security and Hyperproperties.- Verifying Hyperliveness.-
Quantitative Mitigation of Timing Side Channels.- Property Directed Self
Composition.- Security-Aware Synthesis Using Delayed-Action Games.- Automated
Hypersafety Verification.- Automated Synthesis of Secure Platform Mappings.-
Synthesis.- Synthesizing Approximate Implementations for Unrealizable
Specifications.- Quantified Invariants via Syntax-Guided Synthesis.-
Efficient Synthesis with Probabilistic Constraints.- Membership-based
Synthesis of Linear Hybrid Automata.- Overfitting in Synthesis: Theory and
Practice.- Proving Unrealizability for Syntax-Guided Synthesis.- Model
Checking.- BMC for Weak Memory Models: Relation Analysis for Compact SMT
Encodings.- When Human Intuition Fails: Using Formal Methods to Find an Error
in the "Proof" of a Multi-Agent Protocol.- Extending NUXMV with Timed
Transition Systems and Timed Temporal Properties.- Cerberus-BMC: a Principled
Reference Semantics and Exploration Tool for Concurrent and Sequential C.-
Cyber-physical Systems and Machine Learning.- Multi-Armed Bandits for Boolean
Connectives in Hybrid System Falsification.- StreamLAB: Stream-based
Monitoring of Cyber-Physical Systems.- VerifAI: A Toolkit for the Formal
Design and Analysis of Artificial Intelligence-Based Systems.- The Marabou
Framework for Verification and Analysis of Deep Neural Networks.-
Probabilistic Systems, Runtime Techniques.- Probabilistic Bisimulation for
Parameterized Systems.- Semi-Quantitative Abstraction and Analysis of
Chemical Reaction Networks.- PAC Statistical Model Checking for Markov
Decision Processes and Stochastic Games.- Symbolic Monitoring against
Specifications Parametric in Time and Data.- STAMINA: STochastic Approximate
Model-checker for INfinite-state Analysis.- Dynamical, Hybrid, and Reactive
Systems.- Local and Compositional Reasoning For Optimized Reactive Systems.-
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach.-
Flexible Computational Pipelines for Robust Abstraction-based Control
Synthesis.- Temporal Stream Logic: Synthesis beyond the Bools.- Run-Time
Optimization for Learned Controllers through Quantitative Games.- Taming
Delays in Dynamical Systems: Unbounded Verification of Delay Differential
Equations.