Nantilus
Automated Technology for Verification and Analysis : 11th International Symposium, ATVA 2013, Hanoi, Vietnam, October 15-18, 2013. Proceedings
This book constitutes the refereed proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013, held at Hanoi, Vietnam, in October 2013. The 27 regular papers, 3 short papers and 12 tool papers presented together with 3 invited talks were carefull...
Enregistré dans:
| Auteurs principaux : | , , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Automated Technology for Verification and Analysis : 11th International Symposium, ATVA 2013, Hanoi, Vietnam, October 15-18, 2013. Proceedings / edited by Dang Hung, Mizuhito Ogawa. |
| Édition : | 1st ed. 2013. |
| Publié : |
Cham :
Springer International Publishing
, [20..] Cham : Springer Nature |
| Collection : | Programming and Software Engineering ; 8172 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | Conditions particulières de réutilisation pour les bénéficiaires des licences nationales : https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |
| Contenu : | Invited Papers.-Acceleration for Petri Nets. Automated Verification and Strategy Synthesis for Probabilistic Systems. SMT-Based Software Model Checking: Explicit Scheduler, Symbolic Threads. Regular Papers.-Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment. Improved Upper and Lower Bounds for B uchi Disambiguation. Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points. An Automatic Technique for Checking the Simulation of Timed Systems. Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games. Kleene Algebras and Semimodules for Energy Problems. Looking at Mean-Payoff and Total-Payoff through Windows. Weighted Safety. A Framework for Ranking Vacuity Results. Synthesizing Masking Fault-Tolerant Systems from Deontic Specifications. Verification of a Dynamic Management Protocol for Cloud Applications. Compact Symbolic Execution. Multi-threaded Explicit State Space Exploration with State Reconstruction. Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. Integrating Policy Iterations in Abstract Interpreters. Interpolation Properties and SAT-Based Model Checking. Analysis of Message Passing Programs Using SMT-Solvers. An Expressive Framework for Verifying Deadlock Freedom. Expected Termination Time in BPA Games. Precise Cost Analysis via Local Reasoning. Control Flow Refinement and Symbolic Computation of Average Case Bound. Termination and Cost Analysis of Loops with Concurrent Interleavings. Linear Ranking for Linear Lasso Programs. Merge and Conquer: State Merging in Parametric Timed Automata. An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications. Pushdown Systems with Stack Manipulation. Robustness Analysis of String Transducers. Tool Papers. Manipulating LTL Formulas Using Spot 1.0. Rabinizer 2: Small Deterministic Automata for LTL\GU. LTL Model Checking with Neco. Solving Parity Games on the GPU. PyEcdar: Towards Open Source Implementation for Timed Systems. CCMC: A Conditional CSL Model Checker for Continuous-Time Markov Chains. NLTOOLBOX: A Library for Reachability Computation of Nonlinear Dynamical Systems. CELL: A Compositional Verification Framework. VCS: A Verifier for Component-Based Systems. SmacC: A Retargetable Symbolic Execution Engine. MoTraS: A Tool for Modal Transition Systems and Their Extensions. Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs. Short Papers. SAT Based Verification of Network Data Planes. A Theory for Control-Flow Graph Exploration. The Quest for Precision: A Layered Approach for Data Race Detection in Static Analysis |
| Sujets : | |
| Documents associés : | Autre format:
Automated Technology for Verification and Analysis Autre format: Automated Technology for Verification and Analysis |
| LEADER | 06834clm a2200745 4500 | ||
|---|---|---|---|
| 001 | PPN172424674 | ||
| 003 | http://www.sudoc.fr/172424674 | ||
| 005 | 20241001155400.0 | ||
| 010 | |a 978-3-319-02444-8 | ||
| 017 | 7 | 0 | |a 10.1007/978-3-319-02444-8 |2 DOI |
| 035 | |a (OCoLC)869587581 | ||
| 035 | |a Springer978-3-319-02444-8 | ||
| 035 | |a SPRINGER_EBOOKS_LN_PLURI_10.1007/978-3-319-02444-8 | ||
| 035 | |a Springer-11645-978-3-319-02444-8 | ||
| 100 | |a 20131018f20 k |0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a CH | ||
| 105 | |a y z 100yy | ||
| 106 | |a s | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a Automated Technology for Verification and Analysis |e 11th International Symposium, ATVA 2013, Hanoi, Vietnam, October 15-18, 2013. Proceedings |f edited by Dang Hung, Mizuhito Ogawa. | |
| 205 | |a 1st ed. 2013. | ||
| 214 | 0 | |a Cham |c Springer International Publishing | |
| 214 | 2 | |a Cham |c Springer Nature |d [20..] | |
| 225 | 0 | |a Programming and Software Engineering |x 2945-9168 |v 8172 | |
| 327 | 1 | |a Invited Papers.-Acceleration for Petri Nets |a Automated Verification and Strategy Synthesis for Probabilistic Systems |a SMT-Based Software Model Checking: Explicit Scheduler, Symbolic Threads |a Regular Papers.-Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment |a Improved Upper and Lower Bounds for B uchi Disambiguation |a Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points |a An Automatic Technique for Checking the Simulation of Timed Systems |a Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games |a Kleene Algebras and Semimodules for Energy Problems |a Looking at Mean-Payoff and Total-Payoff through Windows |a Weighted Safety |a A Framework for Ranking Vacuity Results |a Synthesizing Masking Fault-Tolerant Systems from Deontic Specifications |a Verification of a Dynamic Management Protocol for Cloud Applications |a Compact Symbolic Execution |a Multi-threaded Explicit State Space Exploration with State Reconstruction |a Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata |a Integrating Policy Iterations in Abstract Interpreters |a Interpolation Properties and SAT-Based Model Checking |a Analysis of Message Passing Programs Using SMT-Solvers |a An Expressive Framework for Verifying Deadlock Freedom |a Expected Termination Time in BPA Games |a Precise Cost Analysis via Local Reasoning |a Control Flow Refinement and Symbolic Computation of Average Case Bound |a Termination and Cost Analysis of Loops with Concurrent Interleavings |a Linear Ranking for Linear Lasso Programs |a Merge and Conquer: State Merging in Parametric Timed Automata |a An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications |a Pushdown Systems with Stack Manipulation |a Robustness Analysis of String Transducers |a Tool Papers |a Manipulating LTL Formulas Using Spot 1.0 |a Rabinizer 2: Small Deterministic Automata for LTL\GU |a LTL Model Checking with Neco |a Solving Parity Games on the GPU |a PyEcdar: Towards Open Source Implementation for Timed Systems |a CCMC: A Conditional CSL Model Checker for Continuous-Time Markov Chains |a NLTOOLBOX: A Library for Reachability Computation of Nonlinear Dynamical Systems |a CELL: A Compositional Verification Framework |a VCS: A Verifier for Component-Based Systems |a SmacC: A Retargetable Symbolic Execution Engine |a MoTraS: A Tool for Modal Transition Systems and Their Extensions |a Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs |a Short Papers |a SAT Based Verification of Network Data Planes |a A Theory for Control-Flow Graph Exploration |a The Quest for Precision: A Layered Approach for Data Race Detection in Static Analysis | |
| 330 | |a This book constitutes the refereed proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013, held at Hanoi, Vietnam, in October 2013. The 27 regular papers, 3 short papers and 12 tool papers presented together with 3 invited talks were carefully selected from73 submissions. The papers are organized in topical, sections on analysis and verification of hardware circuits, systems-on-chip and embedded systems, analysis of real-time, hybrid, priced/weighted and probabilistic systems, deductive, algorithmic, compositional, and abstraction/refinement techniques for analysis and verification, analytical techniques for safety, security, and dependability, testing and runtime analysis based on verification technology, analysis and verification of parallel and concurrent hardware/software systems, verification in industrial practice, and applications and case studies | ||
| 371 | 0 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | |
| 371 | 0 | |a Accès soumis à abonnement pour tout autre établissement | |
| 371 | 1 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales |c https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | |
| 410 | | | |t Programming and Software Engineering |x 2945-9168 |v 8172 | |
| 452 | | | |t Automated Technology for Verification and Analysis |y 9783319024431 | |
| 452 | | | |t Automated Technology for Verification and Analysis |y 9783319024455 | |
| 608 | |3 PPN02886431X |a Actes de congrès |2 rameau | ||
| 610 | 1 | |a Computer Science | |
| 610 | 2 | |a Logics and Meanings of Programs | |
| 610 | 2 | |a Programming Languages, Compilers, Interpreters | |
| 610 | 2 | |a Software Engineering |a Programming and Operating Systems | |
| 610 | 2 | |a Software Engineering | |
| 610 | 2 | |a Programming Techniques | |
| 610 | 2 | |a Computer Communication Networks | |
| 610 | 2 | |a Computer Science Logic and Foundations of Programming | |
| 610 | 2 | |a Compilers and Interpreters | |
| 615 | |a @Computer Science |n 11645 |2 Springer | ||
| 615 | |a Computer Science |n 11645 |2 Springer | ||
| 676 | |a 005.1 |v 23 | ||
| 680 | |a QA76.758 | ||
| 701 | 1 | |a Hung |b Dang |4 651 | |
| 701 | 1 | |a Van Hung |b Dang |4 651 | |
| 701 | 1 | |a Ogawa |b Mizuhito |4 651 | |
| 801 | 3 | |a FR |b Abes |c 20231126 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20220401 |g AACR2 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-319-02444-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-T9K9LNTZ-5 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 441099901:830848940 |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-319-02444-8 | |
| 915 | |5 441099901:830848940 |b SPRING13-00019 | ||
| 930 | |5 441099901:830848940 |b 441099901 |j g | ||
| 991 | |5 441099901:830848940 |a Exemplaire créé en masse par ITEM le 30-09-2024 16:08 | ||
| 997 | |a NUM |b SPRING13-00019 |d NUMpivo |e EM |s d | ||
| 998 | |a 978831 | ||