Información del autor
Autor Esparza, Javier |
Documentos disponibles escritos por este autor (2)
Crear una solicitud de compra Refinar búsqueda17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings / Chen, Yu-Fang ; Cheng, Chih-Hong ; Esparza, Javier
TÃtulo : 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings Tipo de documento: documento electrónico Autores: Chen, Yu-Fang, ; Cheng, Chih-Hong, ; Esparza, Javier, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2019 Número de páginas: XI, 552 p. 754 ilustraciones, 60 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-31784-3 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 Compiladores (programas informáticos) Ciencias de la Computación TeorÃa de las máquinas Inteligencia artificial Algoritmos Compiladores e intérpretes Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Clasificación: 005.1 Resumen: Este libro constituye las actas arbitradas del 17.º Simposio Internacional sobre TecnologÃa Automatizada para la Verificación y el Análisis, ATVA 2019, celebrado en Taipei, Taiwán, en octubre de 2019. Los 24 artÃculos regulares presentados junto con 3 artÃculos sobre herramientas fueron cuidadosamente revisados ​​y seleccionados entre 65 presentaciones. El simposio está dedicado a la promoción de la investigación sobre aspectos teóricos y prácticos del análisis, verificación y sÃntesis automatizados proporcionando un foro para la interacción entre las comunidades de investigación y la industria regional e internacional en este campo. Los artÃculos se centran en sistemas ciberfÃsicos; técnicas de tiempo de ejecución; pruebas; autómatas; sÃntesis; Sistemas estocásticos y verificación de modelos. Nota de contenido: A Note on Game Theory and Verification -- Lazy Abstraction-Based Controller Synthesis -- Truth Assignments as Conditional Autarkies -- Can We Trust Autonomous Systems? Boundaries and Risks -- Teaching Stratego to Play Ball : Optimal Synthesis for Continuous Space MDPs -- Using Symmetry Transformations in Equivariant Dynamical Systems for their Safety Verification -- Parametric Timed Model Checking for Guaranteeing Timed Opacity -- Adaptive Online First-Order Monitoring -- Multi-Head Monitoring of Metric Temporal Logic -- An Efficient Algorithm for Computing Causal Trace Sets in Causality Checking -- Conditional Testing: O -the-Shelf Combination of Test-Case Generators -- Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation -- BUBEN: Automated Library Abstractions Enabling Scalable Bug Detection for Large Programs with I/O and Complex Environment -- KLUZZER: Whitebox Fuzzing on top of LLVM -- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops -- Chain Free String Constraints -- Synthesizing Efficient Low-Precision Kernels -- New Optimizations and Heuristics for Determinization of Büchi Automata -- Approximate Automata for Omega-regular Languages -- DEQ : Equivalence Checker for Deterministic Register Automata -- LTL3TELA: Small Deterministic or Nondeterministic Automata from LTL -- Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems -- Reactive Synthesis of Graphical User Interface Glue Code -- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis -- Program Repair for Hyperproperties -- Generic Emptiness Check for Fun and Profit -- Deciding Fast Termination for Probabilistic VASS with Nondeterminism -- Are Parametric Markov Chains Monotonic -- Efficient Information-Flow Verification under Speculative Execution -- Model Checking Data Flows in Concurrent Network Updates.-Performance Evaluation of NDN Data Plane Using Statistical Model Checking. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis, ATVA 2019, held in Taipei, Taiwan in October 2019. The 24 regular papers presented together with 3 tool papers were carefully reviewed and selected from 65 submissions. The symposium is dedicated to the promotion of research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The papers focus on cyber-physical systems; runtime techniques; testing; automata; synthesis; stochastic systems and model checking. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings [documento electrónico] / Chen, Yu-Fang, ; Cheng, Chih-Hong, ; Esparza, Javier, . - 1 ed. . - [s.l.] : Springer, 2019 . - XI, 552 p. 754 ilustraciones, 60 ilustraciones en color.
ISBN : 978-3-030-31784-3
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 Compiladores (programas informáticos) Ciencias de la Computación TeorÃa de las máquinas Inteligencia artificial Algoritmos Compiladores e intérpretes Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Clasificación: 005.1 Resumen: Este libro constituye las actas arbitradas del 17.º Simposio Internacional sobre TecnologÃa Automatizada para la Verificación y el Análisis, ATVA 2019, celebrado en Taipei, Taiwán, en octubre de 2019. Los 24 artÃculos regulares presentados junto con 3 artÃculos sobre herramientas fueron cuidadosamente revisados ​​y seleccionados entre 65 presentaciones. El simposio está dedicado a la promoción de la investigación sobre aspectos teóricos y prácticos del análisis, verificación y sÃntesis automatizados proporcionando un foro para la interacción entre las comunidades de investigación y la industria regional e internacional en este campo. Los artÃculos se centran en sistemas ciberfÃsicos; técnicas de tiempo de ejecución; pruebas; autómatas; sÃntesis; Sistemas estocásticos y verificación de modelos. Nota de contenido: A Note on Game Theory and Verification -- Lazy Abstraction-Based Controller Synthesis -- Truth Assignments as Conditional Autarkies -- Can We Trust Autonomous Systems? Boundaries and Risks -- Teaching Stratego to Play Ball : Optimal Synthesis for Continuous Space MDPs -- Using Symmetry Transformations in Equivariant Dynamical Systems for their Safety Verification -- Parametric Timed Model Checking for Guaranteeing Timed Opacity -- Adaptive Online First-Order Monitoring -- Multi-Head Monitoring of Metric Temporal Logic -- An Efficient Algorithm for Computing Causal Trace Sets in Causality Checking -- Conditional Testing: O -the-Shelf Combination of Test-Case Generators -- Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation -- BUBEN: Automated Library Abstractions Enabling Scalable Bug Detection for Large Programs with I/O and Complex Environment -- KLUZZER: Whitebox Fuzzing on top of LLVM -- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops -- Chain Free String Constraints -- Synthesizing Efficient Low-Precision Kernels -- New Optimizations and Heuristics for Determinization of Büchi Automata -- Approximate Automata for Omega-regular Languages -- DEQ : Equivalence Checker for Deterministic Register Automata -- LTL3TELA: Small Deterministic or Nondeterministic Automata from LTL -- Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems -- Reactive Synthesis of Graphical User Interface Glue Code -- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis -- Program Repair for Hyperproperties -- Generic Emptiness Check for Fun and Profit -- Deciding Fast Termination for Probabilistic VASS with Nondeterminism -- Are Parametric Markov Chains Monotonic -- Efficient Information-Flow Verification under Speculative Execution -- Model Checking Data Flows in Concurrent Network Updates.-Performance Evaluation of NDN Data Plane Using Statistical Model Checking. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis, ATVA 2019, held in Taipei, Taiwan in October 2019. The 24 regular papers presented together with 3 tool papers were carefully reviewed and selected from 65 submissions. The symposium is dedicated to the promotion of research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The papers focus on cyber-physical systems; runtime techniques; testing; automata; synthesis; stochastic systems and model checking. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : Foundations of Software Science and Computation Structures : 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings Tipo de documento: documento electrónico Autores: Esparza, Javier, ; Murawski, Andrzej S., Mención de edición: 1 ed. Editorial: Berlin [Alemania] : Springer Fecha de publicación: 2017 Número de páginas: XVII, 568 p. 59 ilustraciones ISBN/ISSN/DL: 978-3-662-54458-7 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: Ciencias de la Computación TeorÃa de las máquinas Compiladores (programas informáticos) IngenierÃa de software Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Compiladores e intérpretes TeorÃa de la Computación Clasificación: 40.151 Resumen: Este libro constituye las actas de la 20.ª Conferencia Internacional sobre Fundamentos de la Ciencia del Software y Estructuras de Computación, FOSSACS 2017, que tuvo lugar en Uppsala, Suecia, en abril de 2017, como parte de las Conferencias Conjuntas Europeas sobre TeorÃa y Práctica del Software, ETAPS 2017. Los 32 artÃculos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 101 presentaciones. Estaban organizados en secciones temáticas denominadas: espacios de coherencia y computación de orden superior; álgebra y coalgebra; juegos y autómatas; autómatas, lógica y lenguajes formales; teorÃa de la prueba; probabilidad; concurrencia; cálculo lambda y prueba constructiva; y semántica y teorÃa de categorÃas. Nota de contenido: Coherence Spaces and Higher-Order Computation -- Coherence Spaces and Uniform Continuity -- The Free Exponential Modality of Probabilistic Coherence Spaces -- From Qualitative to Quantitative Semantics by Change of Base -- Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.-Algebra and Coalgebra -- Algebra, coalgebra, and minimization in polynomial differential equations -- Equational Theories of Abnormal Termination Based on Kleene Algebra -- Companions, Codensity and Causality -- Nominal Automata with Name Binding -- Games and Automata -- On the existence of weak subgame perfect equilibria -- Optimal Reachability in Divergent Weighted Timed Games -- Bounding Average-energy Games -- Logics of repeating values on data trees and branching counter systems -- Automata, Logic and Formal Languages -- Degree of sequentiality of weighted automata -- Emptiness under isolation and the value problem for hierarchical probabilistic automata -- Partial Derivatives for Context-Free Languages -- Dynamic Complexity of the Dyck Reachability -- Proof Theory -- Cyclic Arithmetic is Equivalent to Peano Arithmetic -- Martin-Lof's Inductive Definitions are Not Equivalent to Cyclic Proofs -- Probability -- On the relationship between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context -- Computing continuous time Markov chains as transformers of unbounded observation functions -- Pointless Learning -- On Higher-Order Probabilistic Subrecursion. – Concurrency -- A Truly Concurrent Game Model of the Asynchronous á´¨-Calculus -- Local Model Checking in a Logic for True Concurrency -- The Paths to Choreography Extraction -- On the Undecidability of Asynchronous Session Subtyping -- Lambda Calculus and Constructive Proof -- A Lambda-Free Higher-Order Recursive Path Order -- Automated Constructivization of Proofs -- Semantics and Category Theory -- A Light Modality for Recursion -- Unifying Guarded and Unguarded Iteration -- Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type -- On the Semantics of Intensionality. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Foundations of Software Science and Computation Structures : 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings [documento electrónico] / Esparza, Javier, ; Murawski, Andrzej S., . - 1 ed. . - Berlin [Alemania] : Springer, 2017 . - XVII, 568 p. 59 ilustraciones.
ISBN : 978-3-662-54458-7
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: Ciencias de la Computación TeorÃa de las máquinas Compiladores (programas informáticos) IngenierÃa de software Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Compiladores e intérpretes TeorÃa de la Computación Clasificación: 40.151 Resumen: Este libro constituye las actas de la 20.ª Conferencia Internacional sobre Fundamentos de la Ciencia del Software y Estructuras de Computación, FOSSACS 2017, que tuvo lugar en Uppsala, Suecia, en abril de 2017, como parte de las Conferencias Conjuntas Europeas sobre TeorÃa y Práctica del Software, ETAPS 2017. Los 32 artÃculos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 101 presentaciones. Estaban organizados en secciones temáticas denominadas: espacios de coherencia y computación de orden superior; álgebra y coalgebra; juegos y autómatas; autómatas, lógica y lenguajes formales; teorÃa de la prueba; probabilidad; concurrencia; cálculo lambda y prueba constructiva; y semántica y teorÃa de categorÃas. Nota de contenido: Coherence Spaces and Higher-Order Computation -- Coherence Spaces and Uniform Continuity -- The Free Exponential Modality of Probabilistic Coherence Spaces -- From Qualitative to Quantitative Semantics by Change of Base -- Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence.-Algebra and Coalgebra -- Algebra, coalgebra, and minimization in polynomial differential equations -- Equational Theories of Abnormal Termination Based on Kleene Algebra -- Companions, Codensity and Causality -- Nominal Automata with Name Binding -- Games and Automata -- On the existence of weak subgame perfect equilibria -- Optimal Reachability in Divergent Weighted Timed Games -- Bounding Average-energy Games -- Logics of repeating values on data trees and branching counter systems -- Automata, Logic and Formal Languages -- Degree of sequentiality of weighted automata -- Emptiness under isolation and the value problem for hierarchical probabilistic automata -- Partial Derivatives for Context-Free Languages -- Dynamic Complexity of the Dyck Reachability -- Proof Theory -- Cyclic Arithmetic is Equivalent to Peano Arithmetic -- Martin-Lof's Inductive Definitions are Not Equivalent to Cyclic Proofs -- Probability -- On the relationship between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context -- Computing continuous time Markov chains as transformers of unbounded observation functions -- Pointless Learning -- On Higher-Order Probabilistic Subrecursion. – Concurrency -- A Truly Concurrent Game Model of the Asynchronous á´¨-Calculus -- Local Model Checking in a Logic for True Concurrency -- The Paths to Choreography Extraction -- On the Undecidability of Asynchronous Session Subtyping -- Lambda Calculus and Constructive Proof -- A Lambda-Free Higher-Order Recursive Path Order -- Automated Constructivization of Proofs -- Semantics and Category Theory -- A Light Modality for Recursion -- Unifying Guarded and Unguarded Iteration -- Partiality, Revisited: The Partiality Monad as a Quotient Inductive-Inductive Type -- On the Semantics of Intensionality. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
