Verification, Model Checking, and Abstract Interpretation: 22nd International Conference, VMCAI 2021, Copenhagen, Denmark, January 17–19, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12597
Editat de Fritz Henglein, Sharon Shoham, Yakir Vizelen Limba Engleză Paperback – 12 ian 2021
The 23 papers presented in this volume were carefully reviewed from 48 submissions. VMCAI provides a forum for researchers working on verification, model checking, and abstract interpretation and facilitates interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. The papers presented in this volume were organized in the following topical sections: hyperproperties and infinite-state systems; concurrent and distributed systems; checking; synthesis and repair; applications; and decision procedures.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 581.21 lei
Preț vechi: 726.51 lei
-20% Nou
Puncte Express: 872
Preț estimativ în valută:
102.83€ • 120.89$ • 90.06£
102.83€ • 120.89$ • 90.06£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030670665
ISBN-10: 303067066X
Pagini: 604
Ilustrații: XV, 604 p. 212 illus., 108 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.86 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Cham, Switzerland
ISBN-10: 303067066X
Pagini: 604
Ilustrații: XV, 604 p. 212 illus., 108 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.86 kg
Ediția:1st ed. 2021
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
Invited Papers.- Model Checking Algorithms for Hyperproperties.- Algebra-based Synthesis of Loops and their Invariants.- Generative Program Analysis and Beyond: The Power of Domain-Specific Languages.- Hyperproperties and Infinite-state Systems.- Compositional Model Checking for Multi-Properties.- Decomposing Data Structure Commutativity Proofs with mn-Differencing.- Proving the existence of fair paths in infinite-state systems.- A Self-Certifying Compilation Framework for WebAssembly.- Concurrent and Distributed Systems.- Concurrent Correctness in Vector Space.- Verification of Concurrent Programs Using Petri Net Unfoldings.- Eliminating Message Counters in Synchronous Threshold Automata.- A Reduction Theorem for Randomized Distributed Algorithms under Weak Adversaries.- Checking.- Runtime Abstract Interpretation for Numerical Accuracy and Robustness.- Twinning automata and regular expressions for string static analysis.- Unbounded Procedure Summaries from Bounded Environments.- Syntax-Guided Synthesis for Lemma Generation in Hardware Model Checking.- Synthesis and Repair.- Approximate Bit Dependency Analysis to Identify Program Synthesis Problems as Infeasible.- Automated Repair of Heap-Manipulating Programs using Deductive Synthesis.- GPURepair: Automated Repair of GPU Kernels.- Applications.- A Synchronous Effects Logic for Temporal Verification of Pure Esterel.- A Design of GPU-Based Quantitative Model Checking.- Formal Semantics and Verification of Network Based Biocomputation Circuits.- Netter: Probabilistic, Stateful Network Models,. Decision Procedures.- Deciding the Bernays-Schoenfinkel Fragment over Bounded Difference Constraints by Simple Clause Learning over Theories.- Incremental Search for Conflict and Unit Instances of Quantified Formulas with E-Matching.- On Preprocessing for Weighted MaxSAT.- Compositional Satisfiability Solving in Separation Logic.