| TÃtulo : |
Tools and Algorithms for the Construction and Analysis of Systems : 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part I |
| Tipo de documento: |
documento electrónico |
| Autores: |
Legay, Axel, ; Margaria, Tiziana, |
| Mención de edición: |
1 ed. |
| Editorial: |
Berlin [Alemania] : Springer |
| Fecha de publicación: |
2017 |
| Número de páginas: |
XXIV, 609 p. 152 ilustraciones |
| ISBN/ISSN/DL: |
978-3-662-54577-5 |
| 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: |
Ciencias de la Computación Algoritmos IngenierÃa de software Compiladores (programas informáticos) TeorÃa de las máquinas Lógica informática y fundamentos de la programación TeorÃa de la Computación Compiladores e intérpretes Lenguajes formales y teorÃa de los autómatas |
| Ãndice Dewey: |
40.151 |
| Resumen: |
El conjunto de dos libros LNCS 10205 + 10206 constituye las actas de la 23.ª Conferencia Internacional sobre Herramientas y Algoritmos para la Construcción y Análisis de Sistemas, TACAS 2017, que tuvo lugar en Uppsala, Suecia, en abril de 2017, como parte del Congreso Conjunto Europeo. Conferencias sobre teorÃa y práctica del software, ETAPS 2017. Los 48 artÃculos completos, 4 artÃculos de demostración de herramientas y 12 artÃculos de competencia de software presentados en estos volúmenes fueron cuidadosamente revisados ​​y seleccionados entre 181 presentaciones a TACAS y 32 presentaciones a la competencia de software. Fueron organizados en secciones temáticas denominadas: técnicas de verificación; aprendiendo; sÃntesis; autómatas; concurrencia y bisimulación; sistemas hÃbridos; seguridad; verificación y lógica en tiempo de ejecución; sistemas cuantitativos; SAT y SMT; y SV COMP. . |
| Nota de contenido: |
Invited Talk -- Validation, Synthesis and Optimization for Cyber-Physical Systems -- Verification Techniques -- An Abstraction Technique For Parameterized Model Checking of Leader Election Protocols: Application to FTSP -- Combining String Abstract Domains for JavaScript Analysis: An Evaluation.-Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF -- Bounded Quantifier Instantiation for Checking Inductive Invariants -- Proving Termination through Conditional Termination.-Efficient Certified Resolution Proof Checking -- Precise Widening Operators for Proving Termination by Abstract Interpretation -- Automatic Verification of Finite Precision Implementations of Linear Controllers -- Learning -- Learning Symbolic Automata -- ML for ML: Learning Cost Semantics by Experiment -- A Novel Learning Algorithm for Buchi Automata based on Family of DFAs and Classification Trees -- Synthesis -- Hierarchical Network Formation Games -- Synthesis of Recursive ADT Transformers fromReusable Templates -- Counterexample-Guided Model Synthesis -- Interpolation-Based GR(1) Assumptions Refinement -- Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation -- Scaling Enumerative Program Synthesis via Divide and Conquer -- Towards Parallel Boolean Functional Synthesis -- Encodings of Bounded Synthesis -- Tools -- HQSpre - An Effective Preprocessor for QBF and DQBF -- RPP: Automatic Proof of Relational Properties by Self-Composition -- autoCode4: Structural Controller Synthesis -- Automata -- Lazy Automata Techniques for WS1S -- From LTL and limit-deterministic Büchi automata to deterministic parity automata -- Index appearance record for transforming Rabin automata into parity automata -- Minimization of Visibly Pushdown Automata Using Partial Max-SAT -- Concurrency and Bisimulation -- CSimpl: a Framework for the Verification of Concurrent Programs using Rely-Guarante -- Fair Termination for Parameterized Probabilistic Concurrent Systems.-Forward Bisimulations for Nondeterministic Symbolic Finite Automata -- Up-To Techniques for Weighted Systems -- Hybrid Systems -- Rigorous Simulation-Based Analysis of Linear Hybrid Systems -- HARE: A Hybrid Abstraction Refinement Engine for Verifying Non-Linear Hybrid Automata -- Counterexample-guided Refinement of Template Polyhedra. . |
| 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 |
Tools and Algorithms for the Construction and Analysis of Systems : 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part I [documento electrónico] / Legay, Axel, ; Margaria, Tiziana, . - 1 ed. . - Berlin [Alemania] : Springer, 2017 . - XXIV, 609 p. 152 ilustraciones. ISBN : 978-3-662-54577-5 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Ciencias de la Computación Algoritmos IngenierÃa de software Compiladores (programas informáticos) TeorÃa de las máquinas Lógica informática y fundamentos de la programación TeorÃa de la Computación Compiladores e intérpretes Lenguajes formales y teorÃa de los autómatas |
| Ãndice Dewey: |
40.151 |
| Resumen: |
El conjunto de dos libros LNCS 10205 + 10206 constituye las actas de la 23.ª Conferencia Internacional sobre Herramientas y Algoritmos para la Construcción y Análisis de Sistemas, TACAS 2017, que tuvo lugar en Uppsala, Suecia, en abril de 2017, como parte del Congreso Conjunto Europeo. Conferencias sobre teorÃa y práctica del software, ETAPS 2017. Los 48 artÃculos completos, 4 artÃculos de demostración de herramientas y 12 artÃculos de competencia de software presentados en estos volúmenes fueron cuidadosamente revisados ​​y seleccionados entre 181 presentaciones a TACAS y 32 presentaciones a la competencia de software. Fueron organizados en secciones temáticas denominadas: técnicas de verificación; aprendiendo; sÃntesis; autómatas; concurrencia y bisimulación; sistemas hÃbridos; seguridad; verificación y lógica en tiempo de ejecución; sistemas cuantitativos; SAT y SMT; y SV COMP. . |
| Nota de contenido: |
Invited Talk -- Validation, Synthesis and Optimization for Cyber-Physical Systems -- Verification Techniques -- An Abstraction Technique For Parameterized Model Checking of Leader Election Protocols: Application to FTSP -- Combining String Abstract Domains for JavaScript Analysis: An Evaluation.-Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF -- Bounded Quantifier Instantiation for Checking Inductive Invariants -- Proving Termination through Conditional Termination.-Efficient Certified Resolution Proof Checking -- Precise Widening Operators for Proving Termination by Abstract Interpretation -- Automatic Verification of Finite Precision Implementations of Linear Controllers -- Learning -- Learning Symbolic Automata -- ML for ML: Learning Cost Semantics by Experiment -- A Novel Learning Algorithm for Buchi Automata based on Family of DFAs and Classification Trees -- Synthesis -- Hierarchical Network Formation Games -- Synthesis of Recursive ADT Transformers fromReusable Templates -- Counterexample-Guided Model Synthesis -- Interpolation-Based GR(1) Assumptions Refinement -- Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation -- Scaling Enumerative Program Synthesis via Divide and Conquer -- Towards Parallel Boolean Functional Synthesis -- Encodings of Bounded Synthesis -- Tools -- HQSpre - An Effective Preprocessor for QBF and DQBF -- RPP: Automatic Proof of Relational Properties by Self-Composition -- autoCode4: Structural Controller Synthesis -- Automata -- Lazy Automata Techniques for WS1S -- From LTL and limit-deterministic Büchi automata to deterministic parity automata -- Index appearance record for transforming Rabin automata into parity automata -- Minimization of Visibly Pushdown Automata Using Partial Max-SAT -- Concurrency and Bisimulation -- CSimpl: a Framework for the Verification of Concurrent Programs using Rely-Guarante -- Fair Termination for Parameterized Probabilistic Concurrent Systems.-Forward Bisimulations for Nondeterministic Symbolic Finite Automata -- Up-To Techniques for Weighted Systems -- Hybrid Systems -- Rigorous Simulation-Based Analysis of Linear Hybrid Systems -- HARE: A Hybrid Abstraction Refinement Engine for Verifying Non-Linear Hybrid Automata -- Counterexample-guided Refinement of Template Polyhedra. . |
| 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 |
|  |
Tools and Algorithms for the Construction and Analysis of Systems
