| TÃtulo : |
33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part II |
| Tipo de documento: |
documento electrónico |
| Autores: |
Silva, Alexandra, ; Leino, K. Rustan M., |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2021 |
| Número de páginas: |
XXIII, 940 p. 382 ilustraciones, 234 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-81688-9 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
IngenierÃa de software TeorÃa de las máquinas Inteligencia artificial Ciencias de la Computación Simulación por ordenador Lenguajes formales y teorÃa de los autómatas Lógica informática y fundamentos de la programación Modelado por computadora |
| Ãndice Dewey: |
005.1 Programación (Computadoras) |
| Resumen: |
Este conjunto de dos volúmenes de acceso abierto LNCS 12759 y 12760 constituye las actas arbitradas de la 33.a Conferencia Internacional sobre Verificación Asistida por Computadora, CAV 2021, celebrada virtualmente en julio de 2021. Los 63 artÃculos completos presentados junto con 16 artÃculos sobre herramientas y 5 artÃculos invitados fueron cuidadosamente revisado y seleccionado entre 290 presentaciones. Los artÃculos se organizaron en las siguientes secciones temáticas: Parte I: artÃculos invitados; Verificación de IA; concurrencia y blockchain; sistemas hÃbridos y ciberfÃsicos; seguridad; y sÃntesis. Parte II: complejidad y terminación; procedimientos de decisión y solucionadores; verificación de hardware y modelos; fundamentos lógicos; y verificación de software. |
| Nota de contenido: |
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. |
| En lÃnea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part II [documento electrónico] / Silva, Alexandra, ; Leino, K. Rustan M., . - 1 ed. . - [s.l.] : Springer, 2021 . - XXIII, 940 p. 382 ilustraciones, 234 ilustraciones en color. ISBN : 978-3-030-81688-9 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
IngenierÃa de software TeorÃa de las máquinas Inteligencia artificial Ciencias de la Computación Simulación por ordenador Lenguajes formales y teorÃa de los autómatas Lógica informática y fundamentos de la programación Modelado por computadora |
| Ãndice Dewey: |
005.1 Programación (Computadoras) |
| Resumen: |
Este conjunto de dos volúmenes de acceso abierto LNCS 12759 y 12760 constituye las actas arbitradas de la 33.a Conferencia Internacional sobre Verificación Asistida por Computadora, CAV 2021, celebrada virtualmente en julio de 2021. Los 63 artÃculos completos presentados junto con 16 artÃculos sobre herramientas y 5 artÃculos invitados fueron cuidadosamente revisado y seleccionado entre 290 presentaciones. Los artÃculos se organizaron en las siguientes secciones temáticas: Parte I: artÃculos invitados; Verificación de IA; concurrencia y blockchain; sistemas hÃbridos y ciberfÃsicos; seguridad; y sÃntesis. Parte II: complejidad y terminación; procedimientos de decisión y solucionadores; verificación de hardware y modelos; fundamentos lógicos; y verificación de software. |
| Nota de contenido: |
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. |
| En lÃnea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part II
