Tools and Algorithms for the Construction and Analysis of Systems 26th International Conference, TACAS 2020, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part I
This open access two-volume set constitutes the proceedings of the 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Cham
Springer International Publishing AG
2020
Springer Nature |
| Edition: | 1 |
| Series: | Lecture Notes in Computer Science; Theoretical Computer Science and General Issues |
| ISBN: | 9783030451899, 3030451895 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This open access two-volume set constitutes the proceedings of the 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The total of 60 regular papers presented in these volumes was carefully reviewed and selected from 155 submissions. The papers are organized in topical sections as follows: Part I: Program verification; SAT and SMT; Timed and Dynamical Systems; Verifying Concurrent Systems; Probabilistic Systems; Model Checking and Reachability; and Timed and Probabilistic Systems. Part II: Bisimulation; Verification and Efficiency; Logic and Proof; Tools and Case Studies; Games and Automata; and SV-COMP 2020. |
|---|---|
| AbstractList | This open access two-volume set constitutes the proceedings of the 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The total of 60 regular papers presented in these volumes was carefully reviewed and selected from 155 submissions. The papers are organized in topical sections as follows: Part I: Program verification; SAT and SMT; Timed and Dynamical Systems; Verifying Concurrent Systems; Probabilistic Systems; Model Checking and Reachability; and Timed and Probabilistic Systems. Part II: Bisimulation; Verification and Efficiency; Logic and Proof; Tools and Case Studies; Games and Automata; and SV-COMP 2020. |
| Author | Biere, Armin Parker, David |
| Author_xml | – sequence: 1 fullname: Biere, Armin – sequence: 2 fullname: Parker, David |
| BookMark | eNqFz0tPwzAMAOAgHoKN_YfcgMOkvErq46g2QJrEgYlrlaQpG8sSqDPQ_j2FTeKIfLAtfbbsATmJKfojMpBMMlVwYHBMRqDLQ18CnJEBVyCgKJgQ52SE-MZYXwJwXlyQySKlgNTEhk7Ca-pWeblB2qaO5qWnVYqYu63LqxT3JpqwwxXS1NLnHWa_wUty2pqAfnTIQ_Iymy6qh_H86f6xmszHRmgtYKxLC1o0uuXOMtZoY7mXqi2ta6TUTjnDGqUM748DazRYVzrWCvszYLixckhu9osNrv0XLlPIWH8Gb1NaY_33NLCit1d7-96lj63HXP8y52PuTKind9WtEoxz1svrf6TkWqo-5DfKAmnF |
| ContentType | eBook |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 3030451909 9783030451905 |
| Edition | 1 1st ed. 2020. |
| ExternalDocumentID | 9783030451905 EBC6420110 EBC31734343 |
| GroupedDBID | 38. AABBV AAKKN AALJR AAQKC ABEEZ ACGCR ADOGT AEDXK AEHEY AEJLV AEJNW AEKFX AGWHU AIQUZ ALMA_UNASSIGNED_HOLDINGS ALNDD APEJL AVCSZ AZTDL BBABE CYNQG CZZ DACMV EIXGO ESBCR I4C IEZ OAOFD OPOMJ SBO TPJZQ TSXQS V1H Z7R Z7U Z7X Z7Z Z81 Z83 Z84 Z85 Z88 A7I AAYZJ AKAAH LDH Z5O Z7W Z7Y Z87 |
| ID | FETCH-LOGICAL-a27729-78b972d7f1cb00d7ab1e34f8bcd337c4ca0d44a10029ba79bc8c0f2b7f1ca1ab3 |
| ISBN | 9783030451899 3030451895 |
| IngestDate | Fri Nov 08 03:16:13 EST 2024 Thu Apr 17 09:02:26 EDT 2025 Mon Aug 11 05:55:50 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA75.5-76.95 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a27729-78b972d7f1cb00d7ab1e34f8bcd337c4ca0d44a10029ba79bc8c0f2b7f1ca1ab3 |
| OCLC | 1492955022 1170392694 |
| PQID | EBC31734343 |
| PageCount | 515 |
| ParticipantIDs | askewsholts_vlebooks_9783030451905 proquest_ebookcentral_EBC6420110 proquest_ebookcentral_EBC31734343 |
| PublicationCentury | 2000 |
| PublicationDate | 2020 2020-04-17 |
| PublicationDateYYYYMMDD | 2020-01-01 2020-04-17 |
| PublicationDate_xml | – year: 2020 text: 2020 |
| PublicationDecade | 2020 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Cham |
| PublicationSeriesTitle | Lecture Notes in Computer Science; Theoretical Computer Science and General Issues |
| PublicationYear | 2020 |
| Publisher | Springer International Publishing AG Springer Nature |
| Publisher_xml | – name: Springer International Publishing AG – name: Springer Nature |
| SSID | ssj0002299115 |
| Score | 2.1566415 |
| Snippet | This open access two-volume set constitutes the proceedings of the 26th International Conference on Tools and Algorithms for the Construction and Analysis of... |
| SourceID | askewsholts proquest |
| SourceType | Aggregation Database Publisher |
| Subtitle | 26th International Conference, TACAS 2020, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Part I |
| TableOfContents | Safe Decomposition of Startup Requirements: Verification and Synthesis -- 1 Introduction -- 2 Problem Statement -- 2.1 NP-hardness -- 3 Verification -- 3.1 Reduction to Model Checking -- 3.2 Encoding into SMT(DL) -- 4 Synthesis -- 5 Experimental Evaluation -- 6 Conclusions -- References -- Multi-Agent Safety Verification using Symmetry Transformations -- 1 Introduction -- 2 Model and problem statement -- 2.1 Agent mode dynamics -- 2.2 Reachtubes -- 3 Symmetry and Equivariant Dynamical Systems -- 3.1 Symmetry of systems with inputs -- 3.2 Symmetry and reachtubes -- 4 Virtual system -- 5 Symmetry-based verification algorithm -- 5.1 tubecache: shared memory for reachtubes -- 5.2 symComputeReachtube: symmetry-based reachtube computation -- 5.3 Bounded time safety -- 5.4 Unbounded time safety -- 6 Experimental evaluation -- 6.1 CacheReach: multi-agent safety verification tool -- 6.2 Experimental results -- 7 Discussion and conclusions -- References -- Relational Differential Dynamic Logic -- 1 Introduction -- 2 Preliminaries: Syntax and Semantics of the Logic dL -- 3 Relational Differential Dynamic Logic -- 4 Synchronizing Dynamics -- 4.1 Time Stretching -- 4.2 Towards a Syntactic Representation -- 5 Implementation -- 6 Case Studies -- 6.1 Collision Speed with Constant Acceleration -- 6.2 Collision Speed with Different Kinds of Friction -- 6.3 Model Refinement -- 7 Conclusions and Future Work -- References -- Verifying Concurrent Systems -- Assume, Guarantee or Repair -- 1 Introduction -- 2 Communicating Programs -- 2.1 Parallel Composition -- 3 Regular Properties and Their Satisfaction -- 4 The Assume-Guarantee-Repair (AGR) Framework -- 4.1 The Assume-Guarantee-Repair (AGR) Algorithm -- 4.2 Repair by Abduction -- 4.3 Removal of Error Traces -- 4.4 Correctness and Termination -- 5 Experimental Results and Conclusions -- Conclusion -- References 7 Future Work 3.1 Boxing -- 3.2 Boxing and Gapping -- 3.3 Boxing, Gapping and Flipping -- 3.4 Boxing, Gapping, Flipping and Demoding -- 4 Experiments -- 4.1 Overall Result -- 4.2 Runtime for Naive encoding and Boxing -- 4.3 Interpolant Size for Naive encoding and Boxing -- 5 Related work -- 6 Concluding Discussion -- Acknowledgments -- References -- Automated and Sound Synthesis of Lyapunov Functions with SMT Solvers -- 1 Introduction -- 2 Formal Verification - Concepts and Techniques -- 2.1 Satisfiability Modulo Theory -- 2.2 The Z3 SMT Solver -- 2.3 Inductive Synthesis - CEGIS -- 3 Automated and Sound Synthesis of Lyapunov Functions via CEGIS and SMT -- 3.1 The CEGIS Architecture for Lyapunov Function Synthesis -- 3.2 Lyapunov Function Synthesis for Non-linear Models -- 3.3 Lyapunov Function Synthesis for Parametric Models -- 4 Case Studies and Experiments -- 5 Conclusions and Future Work -- References -- A Study of Symmetry Breaking Predicates and Model Counting -- 1 Introduction -- 2 Examples -- 2.1 n-Queens -- 2.2 Data structure invariants -- 3 Background: Model counting -- 4 Study methodology -- 4.1 Tools -- 4.2 Benchmarks -- 4.3 Metrics -- 5 Experimental evaluation -- 5.1 Symmetry breaking and approximate model counting -- 5.2 Symmetry breaking and exact model counting -- 5.3 Discussion -- 6 Conclusions -- Acknowledgments -- References -- MUST: Minimal Unsatisfiable Subsets Enumeration Tool -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Definitions -- 2.2 Shrink -- 2.3 Unexplored Subsets -- 3 Implemented Algorithms -- 3.1 Seed-Shrink Scheme -- 4 Architecture of the Tool -- 4.1 Logical Components -- 4.2 Explorer -- 4.3 SatSolver -- 4.4 Installation and Execution of the Tool -- 5 Experimental Evaluation -- 5.1 Evaluated Tools -- 5.2 Benchmarks -- 5.3 Results -- 6 Case Study -- 7 Conclusion -- References -- Timed and Dynamical Systems Intro -- ETAPS Foreword -- Preface -- Organization -- Contents - Part I -- Contents - Part II -- Program Verification -- Software Verification with PDR:An Implementation of the State of the Art -- 1 Introduction -- 2 Background -- 2.1 PDR -- 2.2 k-Induction -- 3 Combining k-Induction with PDR -- 4 Evaluation -- 4.1 Compared Approaches -- 4.2 Experimental Setup -- 4.3 Results -- 5 Conclusion -- 5.1 Data Availability Statement -- References -- Verifying Array Manipulating Programs with Full-Program Induction -- 1 Introduction -- 2 Overview of Full-program Induction -- 3 Algorithms for Full-program Induction -- 3.1 Preliminaries -- 3.2 Core Modules in the Technique -- 4 Implementation and Experiments -- 5 Conclusion -- References -- Interpretation-Based Violation Witness Validation for C: NITWIT -- 1 Introduction -- 2 Background -- 3 Validators for Violation Witnesses -- 4 Interpretation-based Witness Validation -- 5 Evaluation -- 5.1 Benchmarks -- 5.2 Evaluation Setting -- 5.3 Experimental Results -- 5.4 Discussion -- 6 Conclusion -- References -- A Calculus for Modular Loop Acceleration -- 1 Introduction -- 2 Preliminaries -- 3 Existing Acceleration Techniques -- 3.1 Acceleration via Decrease or Increase -- 3.2 Acceleration via Decrease and Increase -- 3.3 Acceleration via Metering Functions -- 4 A Calculus for Modular Loop Acceleration -- 5 Conditional Acceleration Techniques -- 6 Acceleration via Eventual Monotonicity -- 6.1 Acceleration via Eventual Decrease -- 6.2 Acceleration via Eventual Increase -- 7 Related Work -- 8 Implementation and Experiments -- 9 Conclusion and Future Work -- Data Availability Statement and Acknowledgments -- References -- SAT and SMT -- Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic -- 1 Introduction -- 2 Boxing and Gapping in Pictures -- 3 Formal correctness of boxing and gapping Structural Invariants for the Verification of Systems with Parameterized Architectures -- 1 Introduction -- 2 Parameterized Component-based Systems -- 2.1 Execution Semantics of Component-based Systems -- 3 Trap Invariants -- 3.1 From IL to WS S -- 3.2 Defining Parameterized Trap Invariants in WS S -- 4 Refining Trap Invariants -- 4.1 One Invariants -- 5 Experiments -- 6 Conclusions -- Data Availability Statement and Acknowledgements -- References -- Automated Verification of Parallel Nested DFS -- 1 Introduction -- 1.1 Background on Model Checking -- 1.2 Related Work -- 1.3 Contributions and Outline -- 2 Preliminaries -- 2.1 Nested Depth-First Search -- 2.2 Parallel Nested Depth-First Search -- 2.3 Concurrency Verification with VerCors -- 3 Automated Verification of Parallel NDFS -- 3.1 Correctness of pndfs -- 3.2 Encoding of pndfs in VerCors -- 3.3 Verification of pndfs in VerCors -- 4 Optimisations -- 5 Conclusion -- References -- Discourje: Runtime Verification of Communication Protocols in Clojure -- 1 Introduction -- 2 Overview -- 3 Design -- 4 Implementation -- 5 Evaluation -- 6 Related Work -- 7 Conclusion -- Acknowledgments -- References -- Probabilistic Systems -- Scenario-Based Verification of Uncertain MDPs -- 1 Introduction -- 2 Preliminaries -- 2.1 Parametric Models -- 2.2 Uncertain MDPs -- 3 Problem Statement -- 4 Scenario-Based Verification -- 4.1 Restriction to Satisfying Samples -- 4.2 Satisfaction Probability by Treating Violating Samples -- 4.3 Expected Cost Specifications -- 4.4 Building Scenario-Based Algorithms -- 5 Numerical Examples -- 5.1 Parameter Synthesis Benchmarks -- 5.2 UAV Motion Planning -- 6 Conclusion -- References -- Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning -- 1 Introduction -- 2 Preliminaries -- 3 Good-for-MDP (GFM) Automata -- 3.1 Simulating GFM 3.2 Constructing Slim GFM Automata -- 4 Accepting End-Component Simulation -- 5 Evaluation -- 5.1 Size of General Buchi Automata for Probabilistic Model Checking -- 5.2 GFM Automata and Reinforcement Learning -- 6 Conclusion -- References -- Farkas certificates and minimal witnesses for probabilistic reachability constraints -- 1 Introduction -- 2 Preliminaries -- 3 Farkas certificates for reachability in MDPs -- 4 Minimal witnesses for reachability in MDPs -- 5 Relating Farkas certificates and minimal witnesses -- 6 Computing witnessing subsystems -- 7 Experiments -- 8 Conclusion -- References -- Simple Strategies in Multi-Objective MDPs -- 1 Introduction -- 2 Preliminaries -- 2.1 Markov Decision Processes, Strategies, and End Components -- 2.2 Objectives -- 3 Deciding Achievability -- 3.1 Complexity Results -- 3.2 A Mixed Integer Linear Programming Approach -- 3.3 Unichain MDP and Finite Rewards -- 3.4 Alternative Encoding for Total Rewards -- 3.5 Extension to Multichain MDP -- 3.6 Extension to Infinite Rewards -- 4 Computing the Pareto Front -- 5 Bounded Memory -- 6 Evaluation -- Acknowledgments -- References -- Model Checking and Reachability -- Partial Order Reduction for Deep Bug Finding in Synchronous Hardware -- 1 Introduction -- 1.1 Motivating Example -- 2 Background -- 3 Synchronous Partial Order Reduction -- 4 Reduced Instruction Sets -- 4.1 Atomic instruction sets -- 5 Experimental Results -- 5.1 Motivating Example -- 5.2 Packet Movers -- 6 Related Work -- 7 Conclusion -- 8 Data Availability Statement -- References -- Revisiting Underapproximate Reachability for Multipushdown Systems -- 1 Introduction -- 2 Underapproximations in MPDA -- 2.1 A new class of under-approximations -- 3 A Fix-point Algorithm for Hole Bounded Reachability -- 4 Generating a Witness -- 5 Adding Time to Multi-pushdown systems -- 6 Implementation and Experiments |
| Title | Tools and Algorithms for the Construction and Analysis of Systems |
| URI | https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=31734343 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6420110 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783030451905 |
| Volume | 12078 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8NAEB58HezFN9YXq4i3QB7bbHKsxcdBxIOU3sJms6tiSaqR0p_v7GbTxIqgBy8hTbYJzBd2v5md-QbgHJeASClKHR4q5VCBDkpEe54TpJQzTqUMTZXr8I7d30ejUfxgtZ5L006A5Xk0m8WTf4UaryHYunT2D3DPH4oX8BxBxyPCjscFRjz_aREvinGluNwfPxXo9D9XYguGW-rGnLVUbDWmpUbSli03AXNpk291okyzyfRuMzCaPHgbLvDdhXBBHS5cCDi2Yl79my8uZmD2Ur2oamM0nzN9t-q8syBWfXU5QEIS6HLVi8mbo5t76U1w2-lkGZZZqD3koXc7D4T5uCAiLdV1N_WrepUyUvPqDnR4-YqzPq4IH-W3ZdNwgcdNWJW6QGQLlmS-DRt1WwxiZ8kd6BsgCBqZNEAQBIIgEKQNRDXGAkEKRSwQuzC8vnoc3Dq2U4XDfe2eOCxKY-ZnTHkC57GM8dSTAVVRKrIgYIIK7maUcq13G6ecxamIhKv8VP-BezwN9mAlL3K5DyTmijGhlC85sj0cm8UZcriel3EkHGHWhbOWLZLp2Oyql0ljsNjtdeG0NlFi7ttU36QFUBfIj2PQK9XE8OAXjzmE9eY7O4IVNKE8hjUx_Xgp308M1p-N2ET7 |
| linkProvider | Open Access Publishing in European Networks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Tools+and+Algorithms+for+the+Construction+and+Analysis+of+Systems&rft.au=Biere%2C+Armin&rft.au=Parker%2C+David&rft.date=2020-01-01&rft.pub=Springer+International+Publishing+AG&rft.isbn=9783030451899&rft.volume=12078&rft.externalDocID=EBC31734343 |
| thumbnail_m | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97830304%2F9783030451905.jpg |