Cantitate/Preț
Produs
Total produse
Vezi coșul
Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part II de Axel Legay

Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part II: Lecture Notes in Computer Science, cartea 10206

Editat de Axel Legay, Tiziana Margaria
en Limba Engleză Paperback – 31 mar 2017
The two-book set LNCS 10205 + 10206 constitutes the proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 48 full papers, 4 tool demonstration papers, and 12 software competition papers presented in these volumes were carefully reviewed and selected from 181 submissions to TACAS and 32 submissions to the software competition. They were organized in topical sections named: verification techniques; learning; synthesis; automata; concurrency and bisimulation; hybrid systems; security; run-time verification and logic; quantitative systems; SAT and SMT; and SV COMP. 
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 33250 lei  43-57 zile
  Springer Berlin, Heidelberg – 31 mar 2017 33250 lei  43-57 zile
  Springer Berlin, Heidelberg – 31 mar 2017 34220 lei  43-57 zile

Din seria Lecture Notes in Computer Science

Preț: 33250 lei

Preț vechi: 41563 lei
-20% Nou

Puncte Express: 499
Preț estimativ în valută:
6363€ • 6610$ • 5286£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783662545799
ISBN-10: 3662545799
Pagini: 411
Ilustrații: XXIV, 411 p. 88 illus.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:1st ed. 2017
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

Security.- Static Detection of DoS Vulnerabilities in Programs that use Regular Expressions.- Discriminating Traces with Time.- Directed Automated Memory Performance Testing.- Context-bounded Analysis for POWER.- Run-Time Verification and Logic. -Rewriting-Based Runtime Verification of Alternation-Free HyperLTL Formulas.- Almost Event-Rate Independent Monitoring of Metric Temporal Logic.- Optimal Translation of LTL to Limit Deterministic Automata.- Quantitative Systems.- Sequential Convex Programming for the Efficient Verification of Parametric MDPs.- JANI: Quantitative Model and Tool Interaction.- Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults.- Long-run Rewards for Markov Automata.- SAT and SMT.- HiFrog: SMT-based Function Summarization for Software Verification.- Congruence Closure with Free Variables.- On Optimization Modulo Theories, MaxSMT and Sorting Networks. - The automatic detection of token structures and invariants using SAT checking.- Maximizing the Conditional Expected Reward for Reaching the Goal. -ARES: Adaptive Receding-Horizon Synthesis of Optimal Plans. - FlyFast: A Mean Field Model Checker. -ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations.-SV COMP.- Software Verification with Validation of Results (Report on SV-COMP 2017).- AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs (Competition Contribution).- CPA-BAM-BnB: Block-Abstraction Memoization and Region-based Memory Models for Predicate Abstractions (Competition Contribution).- DepthK: A k-Induction Verifier Based on Invariant Inference for C Programs (Competition Contribution).- Forester: From Heap Shapes to Automata Predicates (Competition Contribution).- HipTNT+: A Termination and Non-termination Analyzer by Second-order Abduction (Competition Contribution).- Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation (Competition Contribution).- Skink: Static Analysis of LLVM Intermediate Representation (Competition contribution).- Symbiotic 4: Beyond Reachability (Competition Contribution).- Optimizing and Caching SMT Queries in SymDIVINE (Competition Contribution).- Ultimate Automizer with an On-demand Construction of Floyd-Hoare Automata (Competition Contribution).- Ultimate Taipan: Trace Abstraction and Abstract Interpretation (Competition Contribution).- VeriAbs : Verification by Abstraction (Competition Contribution).  

Caracteristici

Includes supplementary material: sn.pub/extras