Información del autor
Autor Leino, K. Rustan M. |
Documentos disponibles escritos por este autor (2)
Crear una solicitud de compra Refinar búsqueda33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part I / Silva, Alexandra ; Leino, K. Rustan M.
TÃtulo : 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part I 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: XXIV, 922 p. 287 ilustraciones, 171 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-81685-8 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: IngenierÃa de software Inteligencia artificial Ciencias de la Computación TeorÃa de las máquinas Simulación por ordenador Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Modelado por computadora Clasificación: 005.1 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. Este es un libro de acceso abierto. Nota de contenido: Invited Papers -- NNrepair: Constraint-based Repair of Neural Network Classifiers -- Balancing automation and control for formal verification of microprocessors -- Algebraic Program Analysis -- Programmable Program Synthesis -- Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities -- AI Verification -- DNNV: A Framework for Deep Neural Network Verification -- Robustness Verification of Quantum Classifiers -- BDD4BNN: A BDD-based Quantitative Analysis Framework for Binarized Neural Networks -- Automated Safety Verification of Programs Invoking Neural Networks -- Scalable Polyhedral Verification of Recurrent Neural Networks -- Verisig 2.0: Verification of Neural Network Controllers Using Taylor Model Preconditioning -- Robustness Verification of Semantic Segmentation Neural Networks using Relaxed Reachability -- PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifier -- Concurrency and Blockchain -- Isla: Integrating full-scale ISA semantics andaxiomatic concurrency models -- Summing Up Smart Transitions -- Stateless Model Checking under a Reads-Value-From Equivalence -- Gobra: Modular Specification and Verification of Go Programs -- Delay-Bounded Scheduling Without Delay! -- Checking Data-Race Freedom of GPU Kernels, Compositionally -- GenMC: A Model Checker for Weak Memory Models -- Hybrid and Cyber-Physical Systems -- Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming -- An Iterative Scheme of Safe Reinforcement Learning for Nonlinear Systems via Barrier Certificate Generation -- HybridSynchAADL: Modeling and Formal Analysis of Virtually Synchronous CPSs in AADL -- Computing Bottom SCCs Symbolically Using Transition Guided Reduction -- Implicit Semi-Algebraic Abstraction for Polynomial Dynamical Systems -- IMITATOR 3: Synthesis of timing parameters beyond decidability -- Formally Verified Switching Logic for Recoverability of Aircraft Controller -- SceneChecker: Boosting Scenario Verification using Symmetry Abstractions -- Effective Hybrid System Falsification Using Monte Carlo Tree Search Guided by QB-Robustness -- Fast zone-based algorithms for reachability in pushdown timed automata -- Security -- Verified Cryptographic Code for Everybody -- Not All Bugs Are Created Equal, But Robust Reachability Can Tell The Difference -- A Temporal Logic for Asynchronous Hyperproperties -- Product Programs in the Wild: Retrofitting Program Verifiers to Check Information Flow Security -- Constraint-based Relational Verification -- Pre-Deployment Security Assessment for Cloud Services through Semantic Reasoning -- Synthesis -- Synthesis with Asymptotic Resource Bounds -- Program Sketching by Automatically Generating Mocks from Tests -- Counterexample-Guided Partial Bounding for Recursive Function Synthesis -- PAYNT: A Tool for Inductive Synthesis of Probabilistic Programs -- Adapting Behaviors via Reactive Synthesis -- Causality-based Game Solving. Tipo de medio : Computadora 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. This is an open access book. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 33rd International Conference, CAV 2021, Virtual Event, July 20–23, 2021, Proceedings, Part I [documento electrónico] / Silva, Alexandra, ; Leino, K. Rustan M., . - 1 ed. . - [s.l.] : Springer, 2021 . - XXIV, 922 p. 287 ilustraciones, 171 ilustraciones en color.
ISBN : 978-3-030-81685-8
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Idioma : Inglés (eng)
Palabras clave: IngenierÃa de software Inteligencia artificial Ciencias de la Computación TeorÃa de las máquinas Simulación por ordenador Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Modelado por computadora Clasificación: 005.1 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. Este es un libro de acceso abierto. Nota de contenido: Invited Papers -- NNrepair: Constraint-based Repair of Neural Network Classifiers -- Balancing automation and control for formal verification of microprocessors -- Algebraic Program Analysis -- Programmable Program Synthesis -- Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities -- AI Verification -- DNNV: A Framework for Deep Neural Network Verification -- Robustness Verification of Quantum Classifiers -- BDD4BNN: A BDD-based Quantitative Analysis Framework for Binarized Neural Networks -- Automated Safety Verification of Programs Invoking Neural Networks -- Scalable Polyhedral Verification of Recurrent Neural Networks -- Verisig 2.0: Verification of Neural Network Controllers Using Taylor Model Preconditioning -- Robustness Verification of Semantic Segmentation Neural Networks using Relaxed Reachability -- PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifier -- Concurrency and Blockchain -- Isla: Integrating full-scale ISA semantics andaxiomatic concurrency models -- Summing Up Smart Transitions -- Stateless Model Checking under a Reads-Value-From Equivalence -- Gobra: Modular Specification and Verification of Go Programs -- Delay-Bounded Scheduling Without Delay! -- Checking Data-Race Freedom of GPU Kernels, Compositionally -- GenMC: A Model Checker for Weak Memory Models -- Hybrid and Cyber-Physical Systems -- Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming -- An Iterative Scheme of Safe Reinforcement Learning for Nonlinear Systems via Barrier Certificate Generation -- HybridSynchAADL: Modeling and Formal Analysis of Virtually Synchronous CPSs in AADL -- Computing Bottom SCCs Symbolically Using Transition Guided Reduction -- Implicit Semi-Algebraic Abstraction for Polynomial Dynamical Systems -- IMITATOR 3: Synthesis of timing parameters beyond decidability -- Formally Verified Switching Logic for Recoverability of Aircraft Controller -- SceneChecker: Boosting Scenario Verification using Symmetry Abstractions -- Effective Hybrid System Falsification Using Monte Carlo Tree Search Guided by QB-Robustness -- Fast zone-based algorithms for reachability in pushdown timed automata -- Security -- Verified Cryptographic Code for Everybody -- Not All Bugs Are Created Equal, But Robust Reachability Can Tell The Difference -- A Temporal Logic for Asynchronous Hyperproperties -- Product Programs in the Wild: Retrofitting Program Verifiers to Check Information Flow Security -- Constraint-based Relational Verification -- Pre-Deployment Security Assessment for Cloud Services through Semantic Reasoning -- Synthesis -- Synthesis with Asymptotic Resource Bounds -- Program Sketching by Automatically Generating Mocks from Tests -- Counterexample-Guided Partial Bounding for Recursive Function Synthesis -- PAYNT: A Tool for Inductive Synthesis of Probabilistic Programs -- Adapting Behaviors via Reactive Synthesis -- Causality-based Game Solving. Tipo de medio : Computadora 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. This is an open access book. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
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. Idioma : Inglés (eng) 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 Clasificación: 005.1 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. Tipo de medio : Computadora 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. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 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.
Idioma : Inglés (eng)
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 Clasificación: 005.1 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. Tipo de medio : Computadora 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. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
