Tools and Algorithms for the Construction and Analysis of Systems

25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6¿11, 2019, Proceedings, Part I
Herausgegeben:Vojnar, Tomás; Zhang, Lijun

• Broschiertes Buch

Produktbeschreibung

This book is Open Access under a CC BY licence.

The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019.

The total of 42 full and 8 short tool demo papers presented in these volumes was carefully reviewed and selected from 164 submissions. The papers are organized in topical sections as follows:
Part I: SAT and SMT, SAT solving and theorem proving; verification and analysis; model checking; tool demo; and machine learning.

Part II: concurrent and distributed systems; monitoring and runtime verification; hybrid and stochastic systems; synthesis; symbolic verification; and safety and fault-tolerant systems.

Produktdetails

• Theoretical Computer Science and General Issues 11427
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-030-17461-3
• 1st ed. 2019
• Seitenzahl: 460
• Erscheinungstermin: 4. April 2019
• Englisch
• Abmessung: 235mm x 155mm x 25mm
• Gewicht: 692g
• ISBN-13: 9783030174613
• ISBN-10: 3030174611
• Artikelnr.: 55407715

Inhaltsangabe

SAT and SMT.- Decomposing Farkas Interpolants.- Parallel SAT Simplification on GPU Architectures.- Encoding Redundancy for Satisfaction-Driven Clause Learning.- WAPS: Weighted and Projected Sampling.- Building Better Bit-Blasting for Floating-Point Problems.- The Axiom Profiler: Understanding and Debugging SMT Quantifier Instantiations.- On the Empirical Time Complexity of Scale-Free 3-SAT at the Phase Transition.- Modular and Efficient Divide-and-Conquer SAT Solver on Top of the Painless Framework.- SAT Solving and Theorem Proving.- Quantitative Verification of Masked Arithmetic Programs against Side-Channel Attacks.- Incremental Analysis of Evolving Alloy Models.- Extending a Brainiac Prover to Lambda-Free Higher-Order Logic.- Verification and Analysis LCV: A Verification Tool for Linear Controller Software.- Semantic Fault Localization and Suspiciousness Ranking.- Computing Coupled Similarity.- Reachability Analysis for Termination and Confluence of Rewriting.- Model Checking.- VoxLogicA: a Spatial Model Checker for Declarative Image Analysis.- On Reachability in Parameterized Phaser Programs.- Abstract Dependency Graphs and Their Application to Model Checking.- Tool Demo.- nonreach - A Tool for Nonreachability Analysis.- The Quantitative Verification Benchmark Set.- ILAng: A Modeling Platform for SoC Verification using Instruction-Level Abstractions.- MetAcsl: Specification and Verification of High-Level Properties.- ROLL 1.0: !-Regular Language Learning Library.- Symbolic Regex Matcher.- COMPASS 3.0.- Debugging of Behavioural Models with CLEAR.- Machine Learning.- Omega-Regular Objectives in Model-Free Reinforcement Learning.- Verifiably Safe Off-Model Reinforcement Learning.