My Account Log in

5 options

Computer Aided Verification : 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part II / edited by Alexandra Silva, K. Rustan M. Leino.

DOAB Directory of Open Access Books Available online

View online

OAPEN Available online

View online

Springer Nature - Springer Nature Link Journals and eBooks - Fully Open Access Available online

View online

Springer Nature - Springer Nature Link Journals and eBooks - Fully Open Access Available online

View online

SpringerLink Open Access eBooks Available online

View online
Format:
Book
Author/Creator:
Silva, Alexandra.
Contributor:
Leino, K. Rustan M.
Series:
Theoretical Computer Science and General Issues, 2512-2029 ; 12760
Language:
English
Subjects (All):
Software engineering.
Machine theory.
Artificial intelligence.
Computer science.
Computer simulation.
Software Engineering.
Formal Languages and Automata Theory.
Artificial Intelligence.
Computer Science Logic and Foundations of Programming.
Computer Modelling.
Local Subjects:
Software Engineering.
Formal Languages and Automata Theory.
Artificial Intelligence.
Computer Science Logic and Foundations of Programming.
Computer Modelling.
Physical Description:
1 online resource (955 p.)
Edition:
1st ed. 2021.
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2021.
Language Note:
English
System Details:
Mode of access: World Wide Web.
Summary:
This open access two-volume set LNCS 12759 and 12760 constitutes the refereed proceedings of the 33rd International Conference on Computer Aided Verification, CAV 2021, held virtually in July 2021. The 63 full papers presented together with 16 tool papers and 5 invited papers were carefully reviewed and selected from 290 submissions. The papers were organized in the following topical sections: Part I: invited papers; AI verification; concurrency and blockchain; hybrid and cyber-physical systems; security; and synthesis. Part II: complexity and termination; decision procedures and solvers; hardware and model checking; logical foundations; and software verification.
Contents:
Complexity and Termination
Learning Probabilistic Termination Proofs
Ghost Signals: Verifying Termination of Busy Waiting
Reflections on Termination of Linear Loops
Decision Tree Learning in CEGIS-Based Termination Analysis
ATLAS: Automated Amortised Complexity Analysis of Self-Adjusting Data Structures
Decision Procedures and Solvers
Theory Exploration Powered by Deductive Synthesis
CoqQFBV: A Scalable Certified SMT Quantifier-Free Bit-Vector Solver
Porous Invariants
JavaSMT 3: Interacting with SMT Solvers in Java
Efficient SMT-based Analysis of Failure Propagation
ToolX : Better Delta Debugging for the SMT-LIBv2 Language and Friends
Learning Union of Integer Hypercubes with Queries (with applications to monadic decomposition)
Interpolation and Model Checking for Nonlinear Arithmetic
An SMT Solver for Regular Expressions and Linear Arithmetic over String Length
Counting Minimal Unsatisfiable Subsets
Sound Verification Procedures for Temporal Properties of Infinite-State Systems
Hardware and Model Checking
Progress in Certifying Hardware Model Checking Results
Model-Checking Structured Context-Free Languages
Model Checking ! -Regular Properties with Decoupled Search
AIGEN: Random Generation of Symbolic Transition Systems
GPU Acceleration of Bounded Model Checking with ParaFROST
Pono: A Flexible and Extensible SMT-based Model Checker
Logical Foundations
Towards a Trustworthy Semantics-Based Language Framework via Proof Generation
Formal Foundations of Fine-Grained Explainability
Latticed k-Induction with an Application to Probabilistic Programs
Stochastic Systems
Runtime Monitors for Markov Decision Processes
Model Checking Finite-Horizon Markov Chains with Probabilistic Inference
Enforcing Almost-Sure Reachability in POMDPs
Rigorous Floating-Point Roundo Error Analysis of Probabilistic Computations
Model-free Reinforcement Learning for Branching Markov Decision Processes
Software Verification
Cameleer: a Deductive Verification Tool for OCaml
LLMC: Verifying High-Performance Software
Formally Validating a Practical Verification Condition Generator
Automatic Generation and Validation of Instruction Encoders and Decoders
An SMT Encoding of LLVM's Memory Model for Bounded Translation Validation
Automatically Tailoring Abstract Interpretation to Custom Usage Scenarios
Functional Correctness of C implementations of Dijkstra's, Kruskal's, and Prim's Algorithms
Gillian, Part II: Real-World Verification for JavaScript and C
Debugging Network Reachability with Blocked Paths
Lower-Bound Synthesis using Loop Specialization and Max-SMT
Fast Computation of Strong Control Dependencies
Di y: Inductive Reasoning of Array Programs using Difference Invariants.
Notes:
Description based upon print version of record.
Includes bibliographical references and index.
ISBN:
3-030-81688-5

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account