Cantitate/Preț
Produs
Total produse
Vezi coșul
Verification, Model Checking, and Abstract Interpretation: 18th International Conference, VMCAI 2017, Paris, France, January 15–17, 2017, Proceedings de Ahmed Bouajjani

Verification, Model Checking, and Abstract Interpretation: 18th International Conference, VMCAI 2017, Paris, France, January 15–17, 2017, Proceedings: Lecture Notes in Computer Science, cartea 10145

Editat de Ahmed Bouajjani, David Monniaux
en Limba Engleză Paperback – 12 ian 2017
This book constitutes the refereed proceedings of the 18th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2017, held in Paris, France, in January 2017.
The 27 full papers together with 3 invited keynotes presented were carefully reviewed and selected from 60 submissions. VMCAI provides topics including: program verification, model checking, abstract interpretation and abstract domains, program synthesis, static analysis, type systems, deductive methods, program certification, debugging techniques, program transformation, optimization, hybrid and cyber-physical systems. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34643 lei

Preț vechi: 43303 lei
-20% Nou

Puncte Express: 520
Preț estimativ în valută:
6630€ • 6882$ • 5528£

Carte tipărită la comandă

Livrare economică 22 martie-05 aprilie

 Adaugă în coș

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

Specificații

ISBN-13: 9783319522333
ISBN-10: 3319522337
Pagini: 560
Ilustrații: XVII, 560 p. 150 illus.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.8 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Bringing LTL Model Checking to Biologists.- Verified Concurrent Code: Tricks of the Trade.- Detecting Strict Aliasing Violations in the Wild.- Effective Bug Finding in C Programs with Shape and Effect Abstractions.- Synthesizing Non-Vacuous Systems.- Static Analysis of Communicating Process Using Symbolic Transducers.- Reduction of Workflow Nets for Generalized Soundness Verification.- Structuring Abstract Interpreters through State and Value Abstractions.- Matching Multiplications in Bit-Vector Formulas.- Independence Abstractions and Models of Concurrency.- Complete Abstractions and Subclassical Modal Logics.- Using Abstract Interpretation to Correct Synchronization Faults.- Property Directed Reachability for Proving Absence of Concurrent Modification Errors.- Stabilizing Floating-Point Programs Using Provenance Analysis.- Dynamic Reductions for Model Checking Concurrent Software.- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games.- Counterexample Validation and Interpolation-Based Refinement for Forest Automata.- Block-wise Abstract Interpretation by Combining Abstract Domains with SMT.- Solving Nonlinear Integer Arithmetic with MCSat.- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms.- Efficient Elimination of Redundancies in Polyhedra Using Raytracing.- Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions.- Detecting All High-Level Dataraces in an RTOS Kernel.- Reachability for Dynamic Parametric Processes.- Conjunctive Abstract Interpretation Using Paramodulation.- Reasoning in the Bernays-Schonfinkel-Ramsey Fragment of Separation Logic.- Finding Relevant Templates via the Principal Component Analysis.- Sound Bit-Precise Numerical Domains.- IC3 - Flipping the E in ICE.- Partitioned Memory Models for Program Analysis.

Caracteristici

Includes supplementary material: sn.pub/extras