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 /

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

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Baier, Christel (Επιμελητής έκδοσης), Tinelli, Cesare (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015.
Σειρά:Lecture Notes in Computer Science, 9035
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 06991nam a22006255i 4500
001 978-3-662-46681-0
003 DE-He213
005 20151204173900.0
007 cr nn 008mamaa
008 150330s2015 gw | s |||| 0|eng d
020 |a 9783662466810  |9 978-3-662-46681-0 
024 7 |a 10.1007/978-3-662-46681-0  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.L63 
050 4 |a QA76.5913 
050 4 |a QA76.63 
072 7 |a UM  |2 bicssc 
072 7 |a UYF  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a COM036000  |2 bisacsh 
082 0 4 |a 005.1015113  |2 23 
245 1 0 |a Tools and Algorithms for the Construction and Analysis of Systems  |h [electronic resource] :  |b 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 /  |c edited by Christel Baier, Cesare Tinelli. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2015. 
300 |a XVIII, 725 p. 210 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 9035 
505 0 |a 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. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Software engineering. 
650 0 |a Programming languages (Electronic computers). 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 1 4 |a Computer Science. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Software Engineering. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Programming Languages, Compilers, Interpreters. 
650 2 4 |a Mathematical Logic and Formal Languages. 
700 1 |a Baier, Christel.  |e editor. 
700 1 |a Tinelli, Cesare.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662466803 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 9035 
856 4 0 |u http://dx.doi.org/10.1007/978-3-662-46681-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)