Amazon cover image
Image from Amazon.com

Tools and Algorithms for the Construction and Analysis of Systems [electronic resource] : 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.

Contributor(s): Material type: TextTextSeries: Theoretical Computer Science and General Issues ; 12651Publisher: Cham : Springer International Publishing : Imprint: Springer, 2021Edition: 1st ed. 2021Description: XXI, 471 p. 106 illus. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783030720162
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 004.0151 23
LOC classification:
  • QA75.5-76.95
Online resources:
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-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. .
In: Springer Nature eBookSummary: 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. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.
List(s) this item appears in: e-Book / ebook
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

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. .

Open Access

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. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.

There are no comments on this title.

to post a comment.

Universiti Islam Sultan Sharif Ali
Spg 347, Jalan Pasar Gadong, BE1310
Brunei Darussalam

+ 673 2462000 ext 603/604

library@unissa.edu.bn
norhasinah.moksin@unissa.edu.bn
syukriyyah.kahar@unissa.edu.bn

Library Operating Hours:

Gadong Campus School Terms:
Monday – Thursday & Saturday:
8.00 AM – 5.00 PM
Friday, Sunday & Public Holidays :
Closed

Revision & Exam Week:
Monday – Wednesday:
8.00 AM – 9.00 PM
(Unless Otherwise Stated)
Thursday & Saturday:
8.00 AM – 5.00 PM
Friday & Sunday :
8.00 AM – 12.00 PM & 1.30 PM – 5.00 PM
Public Holidays :
Closed

Mid / Inter-Semester Break / Long Vacation:
Monday – Thursday & Saturday:
8.00 AM – 12.15 PM & 1.30 PM – 4.30 PM
Friday, Sunday & Public Holidays :
Closed

Sinaut Campus

School Terms:
Monday – Thursday & Saturday:
8.00 AM – 4.30 PM
Friday, Sunday & Public Holidays :
Closed

Revision & Exam Week:
Monday – Thursday & Saturday:
8.00 AM – 4.30 PM
Friday, Sunday & Public Holidays :
Closed

Mid / Inter-Semester Break / Long Vacation:
Monday – Thursday & Saturday:
8.00 AM – 12.15 PM & 1.30 PM – 4.30 PM
Friday, Sunday &
Public Holidays :
Closed

Flag Counter

© All Right Reserved 2023. Universiti Islam Sultan Sharif Ali

Administered and upheld by
 Rayyan Secutech