Muutke küpsiste eelistusi

E-raamat: Verification, Model Checking, and Abstract Interpretation: 22nd International Conference, VMCAI 2021, Copenhagen, Denmark, January 17-19, 2021, Proceedings

Edited by , Edited by , Edited by
  • Formaat - PDF+DRM
  • Hind: 98,18 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.