Del 10145 - Lecture Notes in Computer Science

Verification, Model Checking, and Abstract Interpretation

18th International Conference, VMCAI 2017, Paris, France, January 15–17, 2017, Proceedings

Häftad, Engelska, 2017

709 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2017-01-12
Mått155 x 235 x 32 mm
Vikt867 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor560
FörlagSpringer International Publishing AG
ISBN9783319522333

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Programspråk inom Data och IT
Människa – datorinteraktion inom Data och IT
Hårdvara inom Data och IT
Programmeringsböcker inom Data och IT

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.