Automated Technology for Verification and Analysis
Springer International Publishing (Verlag)
978-3-319-68166-5 (ISBN)
This book constitutes the refereed proceedings of the 15th International Symposium on Automated Technology for Verification and Analysis, ATVA 2017, held in Pune, India, in October 2017.
The 22 full and 7 short papers presented in this volume were carefully reviewed and selected from 78 submissions. The book also contains one invited talk in full-paper length.
The contributions are organized in topical sections named: program analysis; model checking and temporal logics; neural networks; learning and invariant synthesis; and hybrid systems and control.
Invited Talk: Proving Absence of Starvation by Means of Abstract Interpretation and Model-checking.- Program Analysis.- Precise Null Pointer Analysis Through Global Value Numbering.- May-Happen-in-Parallel Analysis with Returned Futures.- JTDec: A Tool for Tree Decompositions in Soot.- Fixing the State Budget: Approximation of Regular Languages with Small DFAs.- An Equivalence Checking Framework for Array-Intensive Programs.-Loop Quasi-Invariant Chunk Detection.- SamaTulyata: An Efficient Path Based Equivalence Checking Tool.- Model Checking and Temporal Logics.- Tests and Refutation.- The Density of Linear-time Properties.- HyLeak: Hybrid Analysis Tool for Information Leakage.- Compositional Safety Refutation Techniques.- Gradient-based variable ordering of Decision Diagrams for systems with structural units.- Model Checking of C and C++ with DIVINE 4 (Tool Paper).- Dealing with priorities and locks for concurrent programs.- Knowledge transfer and information leakage in protocols.- Concurrent Program Verification With Invariant-guided Underapproximation.- Neural Networks.- Maximum Resilience of Artificial Neural Networks.- Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks.- Learning and Invariant Synthesis.- Liquid Types for Array Invariant Synthesis.- Lifting CDCL to Template-based Abstract Domains for Program Verification.- Synthesizing invariants by solving solvable loops.- Requirements and Specifications Exploiting Partial Knowledge for Efficient Model Analysis.- A Language-theoretic View on Network Protocols.- Probabilistic Systems Efficient Strategy Iteration for Mean Payoff in Markov Decision Processes.- Finding Polynomial Loop Invariants for Probabilistic Programs.- Synthesis of Optimal Resilient Control Strategies.- Hybrid Systems and Control.- ForFET: A Formal Feature Evaluation Tool for Hybrid Systems.- Attacking the V: On the Resiliency of Adaptive-Horizon MPC.- The Reach-Avoid Problem for Constant-Rate Multi-Mode Systems.
| Erscheinungsdatum | 06.10.2017 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Programming and Software Engineering |
| Zusatzinfo | XIX, 482 p. 106 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 754 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
| Schlagworte | Applications • Artificial Intelligence • Computer Architecture • Computer Science • conference proceedings • Formal Logic • formal methods • hoare logic • Hybrid Systems • Informatics • Informatik • logic and verification • modal and temporal logics • Programming Languages • Research • Software engineering • Software Verification and Validation • Static Analysis • stochastic control • verification by model checking |
| ISBN-10 | 3-319-68166-4 / 3319681664 |
| ISBN-13 | 978-3-319-68166-5 / 9783319681665 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
