Tools and Algorithms for the Construction and Analysis of Systems

27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021, Proceedings, Part I

AvJan Friso Groote,Kim Guldstrand Larsen

Häftad, Engelska, 2021

Del 12651 i serien Lecture Notes in Computer Science

442 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021.

Produktinformation

Utgivningsdatum:2021-03-20
Mått:155 x 235 x 29 mm
Vikt:734 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:471
Förlag:Springer Nature Switzerland AG
ISBN:9783030720155

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Nätverk och kommunikation inom Data och IT
Artificiell intelligens inom Data och IT

Innehållsförteckning

Game Theory.- A Game for Linear-time - Branching-time Spectroscopy.- On Satisficing in Quantitative Games.- Quasipolynomial Computation of Nested Fixpoints.- SMT Verification.- A Flexible Proof Format for SAT Solver-Elaborator Communication.- Generating Extended Resolution Proofs with a BDD-Based SAT Solver.- Bounded Model Checking for Hyperproperties.- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays.- SAT Solving with GPU Accelerated Inprocessing.- FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions.- Probabilities.- Finding Provably Optimal Markov Chains.- Inductive Synthesis for Probabilistic Programs Reaches New Horizons.- Analysis of Markov Jump Processes under Terminal Constraints.- Multi-objective Optimization of Long-run Average and Total Rewards.- Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes.- Probabilistic and Systematic Coverage of Consecutive Test-Method Pairs for Detecting Order-DependentFlaky Tests.- Timed Systems.- Timed Automata Relaxation for Reachability.- Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata.- Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring.- Neural Networks.- Synthesizing Context-free Grammars from Recurrent Neural Networks.- Automated and Formal Synthesis of Neural Barrier Certificates for Dynamical Models.- Improving Neural Network Verification through Spurious Region Guided Refinement.- Analysis of Network Communication Resilient Capacity-Aware Routing.- Network Traffic Classification by Program Synthesis.