Muutke küpsiste eelistusi

Verification, Model Checking, and Abstract Interpretation: 22nd International Conference, VMCAI 2021, Copenhagen, Denmark, January 1719, 2021, Proceedings 1st ed. 2021 [Pehme köide]

Edited by , Edited by , Edited by
  • Formaat: Paperback / softback, 604 pages, kõrgus x laius: 235x155 mm, kaal: 937 g, 108 Illustrations, color; 104 Illustrations, black and white; XV, 604 p. 212 illus., 108 illus. in color., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 12597
  • Ilmumisaeg: 12-Jan-2021
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 303067066X
  • ISBN-13: 9783030670665
  • Pehme köide
  • Hind: 85,76 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 100,89 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 604 pages, kõrgus x laius: 235x155 mm, kaal: 937 g, 108 Illustrations, color; 104 Illustrations, black and white; XV, 604 p. 212 illus., 108 illus. in color., 1 Paperback / softback
  • Sari: Theoretical Computer Science and General Issues 12597
  • Ilmumisaeg: 12-Jan-2021
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 303067066X
  • ISBN-13: 9783030670665
This book constitutes the proceedings of the 22nd International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2021, which was held virtually during January 17-19, 2021. The conference was planned to take place in Copenhagen, Denmark, but changed to an online event due to the COVID-19 pandemic. 

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. 

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.