Tools and Algorithms for the Construction and Analysis of Systems de Nir Piterman

Tools and Algorithms for the Construction and Analysis of Systems: 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013, Proceedings: Lecture Notes in Computer Science, cartea 7795

Nir Piterman

Scott Smolka

en Limba Engleză Paperback – 20 feb 2013

This book constitutes the proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2013, held in Rome, Italy, in March 2013. The 42 papers presented in this volume were carefully reviewed and selected from 172 submissions. They are organized in topical sections named: Markov chains; termination; SAT/SMT; games and synthesis; process algebra; pushdown; runtime verification and model checking; concurrency; learning and abduction; timed automata; security and access control; frontiers (graphics and quantum); functional programs and types; tool demonstrations; explicit-state model checking; Büchi automata; and competition on software verification.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1005^.39 lei
20%

Preț: 322^.44 lei
20%

Preț: 324^.00 lei
20%

Preț: 315^.19 lei
20%

Preț: 238^.01 lei
20%

Preț: 554^.98 lei
20%

Preț: 322^.44 lei
20%

Preț: 438^.69 lei
20%

Preț: 325^.58 lei
20%

Preț: 148^.66 lei
20%

Preț: 310^.26 lei
20%

Preț: 256^.27 lei
20%

Preț: 1339^.86 lei
20%

Preț: 782^.28 lei
17%

Preț: 360^.19 lei
20%

Preț: 620^.45 lei
20%

Preț: 307^.71 lei
20%

Preț: 550^.29 lei
20%

Preț: 560^.32 lei
20%

Preț: 319^.32 lei
15%

Preț: 549^.86 lei
20%

Preț: 607^.39 lei
20%

Preț: 538^.29 lei
20%

Preț: 548^.74 lei
20%

Preț: 172^.69 lei
20%

Preț: 611^.22 lei
20%

Preț: 970^.25 lei
20%

Preț: 552^.64 lei
20%

Preț: 315^.78 lei
20%

Preț: 315^.78 lei
20%

Preț: 722^.90 lei
20%

Preț: 722^.90 lei
20%

Preț: 301^.95 lei
20%

Preț: 504^.57 lei
20%

Preț: 1120^.51 lei
20%

Preț: 369^.12 lei
20%

Preț: 334^.94 lei
20%

Preț: 552^.64 lei
Preț: 389^.31 lei
20%

Preț: 564^.99 lei
20%

Preț: 724^.49 lei
20%

Preț: 552^.64 lei
20%

Preț: 1018^.35 lei
20%

Preț: 331^.82 lei
20%

Preț: 309^.90 lei
20%

Preț: 122^.89 lei

Specificații

ISBN-13: 9783642367410
ISBN-10: 3642367410
Pagini: 672
Ilustrații: XXIV, 646 p. 137 illus.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.93 kg
Ediția:2013
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

Cuprins

On-the-Fly Exact Computation of Bisimilarity Distances.- The Quest for Minimal Quotients for Probabilistic Automata.- LTL Model Checking of Interval Markov Chains.- Ramsey vs. Lexicographic Termination Proving.- Structural Counter Abstraction.- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors.- The MathSAT5 SMT Solver.- Formula Preprocessing in MUS Extraction.- Proof Tree Preserving Interpolation.- Asynchronous Multi-core Incremental SAT Solving.- Model-Checking Iterated Games.- PRISM-games: A Model Checker for Stochastic Multi-Player Games.- PIC2LNT: Model Transformation for Model Checking an Applied Pi-Calculus.- An Overview of the mCRL2 Toolset and Its Recent Advances.- Analysis of Boolean Programs.- Weighted Pushdown Systems with Indexed Weight Domains.- Underapproximation of Procedure Summaries for Integer Programs.- Runtime Verification Based on Register Automata.- Unbounded Model-Checking with Interpolation for Regular Language Constraints.- eVolCheck: Incremental Upgrade Checker for C.- Intertwined Forward-Backward Reachability Analysis Using Interpolants.- An Integrated Specification and Verification Technique or Highly Concurrent Data Structures.- A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems.- Identifying Dynamic Data Structures by Learning Evolving Patterns in Memory.- Synthesis of Circular Compositional Program Proofs via Abduction.- As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty.- Integer Parameter Synthesis for Timed Automata.- LTL Model-Checking for Malware Detection.- Policy Analysis for Self-administrated Role-Based Access Control.- Model Checking Agent Knowledge in Dynamic Access Control Policies.- Frontiers (Graphics and Quantum) Automatic Testing of Real-Time Graphics Systems.- Equivalence Checking of Quantum Protocols.- Encoding Monomorphic and Polymorphic Types.- Deriving Probability Density Functions from Probabilistic Functional Programs.- Tool Demonstrations Polyglot: Systematic Analysis for Multiple Statechart Formalisms.- Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO.- BULL: A Library for Learning Algorithms of Boolean Functions.- AppGuard – Enforcing User Requirements on Android Apps.- Model Checking Database Applications.- Efficient Property Preservation Checking of Model Refinements.- Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking.- Competition on Software Verification Second Competition on Software Verification (Summary of SV-COMP 2013).- CPAchecker with Explicit-Value Analysis Based on CEGAR and Interpolation (Competition Contribution).- CPAchecker with Sequential Combination of Explicit-State Analysis and Predicate Analysis (Competition Contribution).- CSeq: A Sequentialization Tool for C (Competition Contribution).- Handling Unbounded Loops with ESBMC 1.20 (Competition Contribution).- LLBMC: Improved Bounded Model Checking of C Programs Using LLVM (Competition Contribution).- Predator: A Tool for Verification of Low-Level List Manipulation (Competition Contribution).- Symbiotic: Synergy of Instrumentation, Slicing, and Symbolic Execution (Competition Contribution).- Threader: A Verifier for Multi-threaded Programs (Competition Contribution).- UFO: Verification with Interpolants and Abstract Interpretation (Competition Contribution).- Ultimate Automizer with SMTInterpol (Competition Contribution).