Cantitate/Preț
Produs
Total produse
Vezi coșul
Tools and Algorithms for the Construction and Analysis of Systems: 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings de Christel Baier

Tools and Algorithms for the Construction and Analysis of Systems: 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015, Proceedings: Lecture Notes in Computer Science, cartea 9035

Editat de Christel Baier, Cesare Tinelli
en Limba Engleză Paperback – 8 apr 2015
This book constitutes the proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2015, which took place in London, UK, in April 2015, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 45 papers included in this volume, consisting of 27 research papers, 2 case-study papers, 7 regular tool papers and 9 tool demonstration papers, were carefully reviewed and selected from 164 submissions. In addition, the book contains one invited contribution. The papers have been organized in topical sections on hybrid systems; program analysis; verification and abstraction; tool demonstrations; stochastic models; SAT and SMT; partial order reduction, bisimulation, and fairness; competition on software verification; parameter synthesis; program synthesis; program and runtime verification; temporal logic and automata and model checking.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 35449 lei

Preț vechi: 44311 lei
-20% Nou

Puncte Express: 532
Preț estimativ în valută:
6785€ • 7057$ • 5686£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662466803
ISBN-10: 3662466805
Pagini: 695
Ilustrații: XVIII, 725 p. 210 illus.
Dimensiuni: 155 x 235 x 43 mm
Greutate: 1.03 kg
Ediția:2015
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Scalable Timing Analysis with Refinement.- A Formally Verified Hybrid System for the Next-Generation Airborne Collision Avoidance System.- Verified Reachability Analysis of Continuous Systems.- HyComp: An SMT-Based Model Checker for Hybrid Systems.- C2E2: A Verification Tool for Stateflow Models.- Non-cumulative Resource Analysis.- Value Slice: A New Slicing Concept for Scalable Property Checking.- A Method for Improving the Precision and Coverage of Atomicity Violation Predictions.- Commutativity of Reducers.- Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling.- Analysis of Dynamic Process Networks.- MULTIGAIN: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.- syntMaskFT: A Tool for Synthesizing Masking Fault-Tolerant Programs from Deontic Specifications.- vZ - An Optimizing SMT Solver.- dReach: δ-Reachability Analysis for Hybrid Systems.- Uppaal Stratego.- BINSEC: Binary Code Analysis with Low-Level Regions.- Insight: An Open Binary Analysis Framework.- SAM: The Static Analysis Module of the MAVERIC Mobile App Security Verification Platform.- Symbolic Model-Checking Using ITS-Tools.- Semantic Importance Sampling for Statistical Model Checking.- Strategy Synthesis for Stochastic Games with Multiple Long-Run Objectives.- FAUST2: Formal Abstractions of Uncountable-State Stochastic Processes.- Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving.- On Parallel Scalable Uniform SAT Witness Generation.- Approximate Counting in SMT and Value Estimation for Probabilistic Programs.- Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions.- Stateless Model Checking for TSO and PSO.- GPU Accelerated Strong and Branching Bisimilarity Checking.- Fairness for Infinite-State Systems.- Software Verification and Verifiable Witnesses.- AProVE: Termination and Memory Safety of C Programs.- Cascade.- CPAchecker with Support for Recursive Programs and Floating-Point Arithmetic.- CPArec:Verifying Recursive Programs via Source-to-Source Program Transformation.- Framework for Embedded System Verification.- Forester: Shape Analysis Using Tree Automata.- MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings.- Perentie: Modular Trace Refinement and Selective Value Tracking.- Predator Hunting Party.- SeaHorn: A Framework for Verifying C Programs.- SMACK+Corral: A Modular Verifier.- Ultimate Automizer with Array Interpolation.- Ultimate Kojak with Memory Safety Checks.- Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches.- FuncTion: An Abstract Domain Functor for Termination.- Model Checking Gene Regulatory Networks.- Symbolic Quantitative Robustness Analysis of Timed Automata.- Pattern-Based Refinement of Assume-Guarantee Specifications in Reactive Synthesis.- Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information.- Shield Synthesis: Runtime Enforcement for Reactive Systems.- Verifying Concurrent Programs by Memory Unwinding.- AutoProof: Auto-Active Functional Verification of Object-Oriented Programs.- An LTL Proof System for Runtime Verification.- MARQ: Monitoring at Runtime with QEA.- Parallel Explicit Model Checking for Generalized Bchi Automata.- Limit Deterministic and Probabilistic Automata for LTL\GU.- Saturation-Based Incremental LTL Model Checking with Inductive Proofs.- Nested Antichains for WS1S.- Sylvan: Multi-core Decision Diagrams.- LTSmin: High-Performance Language-Independent Model Checking.- Using a Formal Model to Improve Verification of a Cache-Coherent System-on-Chip.