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 / / edited by Jan Friso Groote, Kim Guldstrand Larsen.
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 Softw...
Saved in:
| Superior document: | Theoretical Computer Science and General Issues, 12651 |
|---|---|
| : | |
| TeilnehmendeR: | |
| Place / Publishing House: | Cham : : Springer International Publishing :, Imprint: Springer,, 2021. |
| Year of Publication: | 2021 |
| Edition: | 1st ed. 2021. |
| Language: | English |
| Series: | Theoretical Computer Science and General Issues,
12651 |
| Physical Description: | 1 online resource (483 pages) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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-Dependent Flaky 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. .