Tools and Algorithms for the Construction and Analysis of Systems: 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part II
computer architecture; computer software selection and evaluation; formal logic; formal methods; model checker; model checking; multi core processors; program compilers; programming languages; semantics; software engineering; specifications; state space; verification
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cham
Springer Nature
2018
Springer International Publishing AG |
| Vydání: | 1 |
| Edice: | Theoretical Computer Science and General Issues |
| Témata: | |
| ISBN: | 3319899635, 9783319899633, 3319899627, 9783319899626 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- 4.2 Local-Global Simulation
- 2 Background: Essential Definitions of JardspsJeronsps05 -- 3 TESTOR -- 3.1 Architecture -- 3.2 On-the-Fly Test Selection Algorithm -- 3.3 Implementation -- 3.4 Examples of Different Ways to Express a Test Purpose -- 4 Experimental Evaluation -- 4.1 Test Purposes Taken from Case Studies -- 4.2 Automatically Generated Test Purposes -- 5 Related Work -- 6 Conclusion -- References -- .25em plus .1em minus .1emOptimal Dynamic Partial Order Reduction with Observers -- 1 Introduction -- 2 DPOR and Observers by Example -- 3 Using Observers in a DPOR Algorithm -- 3.1 POR Concepts and Optimal DPOR -- 3.2 Observers and Sleep Sets -- 3.3 Introducing Observers to Optimal DPOR -- 4 Framework -- 5 Optimal DPOR with Observers -- 5.1 Algorithm -- 5.2 Correctness and Optimality -- 6 Implementations -- 7 Experimental Results -- 8 Related Work -- 9 Concluding Remarks -- References -- Structurally Defined Conditional Data-Flow Static Analysis -- 1 Introduction -- 2 Overview -- 3 Conditional Analysis -- 4 Implementations of Conditional Analysis -- 5 Partitioning CFG -- 6 Evaluation -- 6.1 Experiment Description -- 6.2 Results -- 6.3 Discussion -- 7 Related Work -- 8 Conclusion and Future Work -- References -- Geometric Nontermination Arguments -- 1 Introduction -- 2 Preliminaries -- 2.1 Linear Lasso Programs -- 2.2 Jordan Normal Form -- 3 Geometric Nontermination Arguments -- 4 Completeness Results -- 4.1 Bounded Infinite Executions -- 4.2 Nonnegative Eigenvalues -- 5 Experiments -- 6 Related Work -- 7 Conclusion -- References -- Hybrid and Stochastic Systems -- Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis -- 1 Introduction -- 2 Preliminaries -- 3 CEGAR-Based Reachability Analysis -- 3.1 Incrementality -- 4 Experimental Results -- 5 Conclusion -- References
- AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal Temporal Logic -- 1 Introduction -- 2 Extended Signal Temporal Logic -- 3 Tool Presentation -- 3.1 Specifications in AMT 2.0 -- 3.2 Qualitative Monitoring of xSTL -- 3.3 Trace Diagnostics for STL -- 3.4 Specification-Driven Measurements -- 4 Examples -- 4.1 Mixed-Signal Bounded Stabilization -- 4.2 Digital Clock Jitter -- 5 Related Work -- 6 Conclusion -- References -- Multi-cost Bounded Reachability in MDP -- 1 Introduction -- 2 Preliminaries -- 3 Multi-dimensional Sequential Value Iteration -- 3.1 The Unfolding Approach -- 3.2 An Epoch Model Approach Without Unfolding -- 3.3 Extensions -- 4 Visualisations -- 5 Experiments -- 6 Conclusion -- References -- A Statistical Model Checker for Nondeterminism and Rare Events -- 1 Introduction -- 2 Ingredients of a Statistical Model Checker -- 3 Automated Rare Event Simulation -- 4 Scheduler Sampling for Nondeterminism -- 5 Architecture and Implementation -- 6 Experiments -- 7 Conclusion -- References -- Temporal Logic and Mu-calculus -- Permutation Games for the Weakly Aconjunctive -Calculus -- 1 Introduction -- 2 Determinizing Limit-Deterministic Automata -- 2.1 Limit-Deterministic Automata -- 2.2 Determinizing Limit-Deterministic Büchi Automata -- 2.3 Determinizing Limit-Deterministic Parity Automata -- 3 Permutation Games for the Aconjunctive -Calculus -- 3.1 The -Calculus -- 3.2 Limit-Deterministic Tracking Automata -- 3.3 Permutation Games -- 4 Implementation and Benchmarking -- 5 Conclusion -- References -- Symmetry Reduction for the Local Mu-Calculus -- 1 Introduction -- 2 Preliminaries -- 3 The Local Mu-Calculus -- 3.1 Syntax -- 3.2 Semantics -- 3.3 Local and Global Interpretations -- 3.4 Simulation and Bisimulation -- 4 Connecting Local Mu-Calculus Interpretations -- 4.1 Bisimilarity Between Local State Spaces
- 5.2 Integration of OSDP in Alt-Ergo -- 5.3 Experimental Results -- 6 Related Work and Conclusion -- References -- Security and Reactive Systems -- Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection -- 1 Introduction -- 2 Preliminaries -- 3 Approximate Reduction of NFAs -- 3.1 Probabilistic Distance -- 3.2 Automata Reduction Using Probabilistic Distance -- 4 A Heuristic Approach to Approximate Reduction -- 4.1 A General Algorithm for Size-Driven Reduction -- 4.2 A General Algorithm for Error-Driven Reduction -- 4.3 Pruning Reduction -- 4.4 Self-loop Reduction -- 5 Reduction of NFAs in Network Intrusion Detection Systems -- 5.1 Network Traffic Model -- 5.2 Evaluation -- 5.3 The Real Impact in an FPGA-Accelerated NIDS -- 6 Conclusion -- References -- Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts -- 1 Introduction -- 2 Overview: The Cinderella-Stepmother Game -- 3 Background -- 3.1 Skolem Functions and Regions of Validity -- 4 Validity-Guided Synthesis from Assume-Guarantee Contracts -- 4.1 Soundness -- 4.2 Termination on Finite Models -- 4.3 Applying JSYN-VG to the Cinderella-Stepmother Game -- 5 Implementation and Evaluation -- 5.1 Experimental Results -- 6 Related Work -- 7 Conclusion and Future Work -- References -- RVHyper: A Runtime Verification Tool for Temporal Hyperproperties -- 1 Introduction -- 2 RVHyper -- 3 Detecting Spurious Dependencies in Hardware Designs -- 4 Conclusion -- References -- The Refinement Calculus of Reactive Systems Toolset -- 1 Introduction -- 2 Modeling Systems in RCRS -- 3 The Implementation of RCRS in Isabelle -- 4 The Translator -- 5 The Analyzer -- 6 Case Study -- 7 Data Availability Statement -- References -- Static and Dynamic Program Analysis -- TESTOR: A Modular Tool for On-the-Fly Conformance Test Case Generation -- 1 Introduction
- Intro -- ETAPS Foreword -- Preface -- Organization -- Contents -- Part II -- Contents -- Part I -- Concurrent and Distributed Systems -- Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets -- 1 Introduction -- 2 Preliminaries -- 3 Resource Threshold -- 3.1 Resource Threshold Is NP-complete for Acyclic Marked Graphs -- 3.2 Acyclic Free-Choice Workflow Nets May Have no Optimal Online Schedulers -- 4 Concurrency Threshold -- 4.1 Concurrency Threshold of Marked Graphs -- 4.2 Concurrency Threshold of Free-Choice Nets -- 4.3 Approximating the Concurrency Threshold -- 5 Concurrency Threshold: A Practical Approach -- 6 Conclusion -- References -- Fine-Grained Complexity of Safety Verification -- 1 Introduction -- 2 Preliminaries -- 3 Leader Contributor Reachability -- 3.1 Parameterization by Memory and Leader -- 3.2 Parameterization by Contributors -- 4 Bounded-Stage Reachability -- 5 Conclusion -- References -- Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks -- 1 Introduction -- 2 Broadcast Networks with Constrained Reconfiguration -- 2.1 Reconfigurable Broadcast Networks -- 2.2 Natural Constraints for Reconfiguration -- 2.3 Classification of Constraints -- 3 Parameterized Synchronization Under Reconfiguration Constraints -- 3.1 Undecidability for k-Constrained Reconfiguration -- 3.2 Decidability Results -- 4 Conclusion -- References -- EMME: A Formal Tool for ECMAScript Memory Model Evaluation -- 1 Introduction -- 2 Related Work -- 3 The ECMAScript Memory Model -- 3.1 Formal Representation -- 4 Formal Analyses -- 4.1 Formal Requirements Validation -- 4.2 Implementation Testing -- 5 Alloy Formalization -- 6 Implementation -- 7 Experimental Evaluations -- 8 Results of the Formal Analyses -- 9 Conclusion -- References -- SAT and SMT II -- What a Difference a Variable Makes -- 1 Introduction
- 2 Preliminaries -- 3 Clausal Proof Systems -- 3.1 The RAT Proof System -- 3.2 The PR Proof System -- 3.3 The Power of Deletion -- 4 Conversion Algorithm -- 4.1 Top-Down -- 4.2 Five Phases -- 4.3 Complexity -- 5 Optimizations -- 5.1 Refutations -- 5.2 Witness Minimization -- 5.3 Avoiding Copying -- 6 Alternative Simulation Algorithms -- 6.1 Limiting the Number of RAT Steps -- 6.2 Converting DPR Proofs into DRAT Proofs -- 6.3 Converting PR Refutations into RAT Refutations -- 7 Evaluation -- 7.1 Proof Simulation and Optimization -- 7.2 Verified PR Proof Checking -- 8 Conclusions and Future Work -- References -- Abstraction Refinement for Emptiness Checking of Alternating Data Automata -- 1 Introduction -- 2 Preliminaries -- 3 Alternating Data Automata -- 3.1 Boolean Closure -- 4 Antichains and Interpolants for Emptiness -- 5 Lazy Predicate Abstraction for ADA Emptiness -- 6 Checking ADA Emptiness with Impact -- 7 Experimental Evaluation -- References -- Revisiting Enumerative Instantiation -- 1 Introduction -- 2 Preliminaries -- 3 Herbrand Theorem and Beyond -- 4 Quantifier Instantiation in CDCL(T) -- 4.1 Implementing Enumerative Instantiation -- 5 Experiments -- 5.1 Impact of Enumerative Instantiation in CVC4 -- 5.2 Comparison Against Other SMT Solvers -- 5.3 Artifact -- 6 Conclusion -- References -- A Non-linear Arithmetic Procedure for Control-Command Software Verification -- 1 Introduction -- 2 Example: Control-Command Program Verification -- 3 Preliminaries -- 3.1 Emptiness of Semi-algebraic Sets -- 3.2 Sum of Squares (SOS) Polynomials -- 3.3 Semi-Definite Programming (SDP) -- 3.4 Parametric Problems -- 4 Numerical Verification of SOS -- 4.1 Approximate Solutions from SDP Solvers -- 4.2 Proving Existence of a Nearby Solution -- 4.3 Rounding to an Exact Rational Solution -- 5 Experimental Results -- 5.1 The OSDP Library