Tools and Algorithms for the Construction and Analysis of Systems : 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings

This book constitutes the proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2013, held in Rome, Italy, in March 2013. The 42 papers presented in this volume were carefully reviewed and selected from 172 submissions. They are...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux : Piterman Nir (Directeur de publication), Smolka Scott (Directeur de publication)
Format : Livre
Langue : anglais
Titre complet : Tools and Algorithms for the Construction and Analysis of Systems : 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings / edited by Nir Piterman, Scott A. Smolka.
Publié : Berlin, Heidelberg : Springer Berlin Heidelberg , 2013
Cham : Springer Nature
Collection : Theoretical computer science and general issues (Online) ; 7795
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 de l'éditeur (Springer)
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 : chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017
Sujets :
Documents associés : Autre format: Tools and Algorithms for the Construction and Analysis of Systems
Autre format: Tools and Algorithms for the Construction and Analysis of Systems
LEADER 07579clm a2200709 4500
001 PPN168330393
003 http://www.sudoc.fr/168330393
005 20241001155300.0
010 |a 978-3-642-36742-7 
017 7 0 |a 10.1007/978-3-642-36742-7  |2 DOI 
035 |a (OCoLC)829434189 
035 |a Springer978-3-642-36742-7 
035 |a SPRINGER_EBOOKS_LN_PLURI_10.1007/978-3-642-36742-7 
035 |a Springer-11645-978-3-642-36742-7 
100 |a 20130325d2013 u u0frey0103 ba 
101 0 |a eng  |2 639-2 
102 |a DE 
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 Tools and Algorithms for the Construction and Analysis of Systems  |e 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings  |f edited by Nir Piterman, Scott A. Smolka. 
214 0 |a Berlin, Heidelberg  |c Springer Berlin Heidelberg 
214 2 |a Cham  |c Springer Nature  |d 2013 
225 0 |a Theoretical Computer Science and General Issues  |x 2512-2029  |v 7795 
330 |a This book constitutes the proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2013, held in Rome, Italy, in March 2013. The 42 papers presented in this volume were carefully reviewed and selected from 172 submissions. They are organized in topical sections named: Markov chains; termination; SAT/SMT; games and synthesis; process algebra; pushdown; runtime verification and model checking; concurrency; learning and abduction; timed automata; security and access control; frontiers (graphics and quantum); functional programs and types; tool demonstrations; explicit-state model checking; Büchi automata; and competition on software verification. 
359 1 |a On-the-Fly Exact Computation of Bisimilarity Distances -- The Quest for Minimal Quotients for Probabilistic Automata -- LTL Model Checking of Interval Markov Chains -- Ramsey vs. Lexicographic Termination Proving -- Structural Counter Abstraction -- Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors -- The MathSAT5 SMT Solver -- Formula Preprocessing in MUS Extraction -- Proof Tree Preserving Interpolation -- Asynchronous Multi-core Incremental SAT Solving -- Model-Checking Iterated Games -- PRISM-games: A Model Checker for Stochastic Multi-Player Games -- PIC2LNT: Model Transformation for Model Checking an Applied Pi-Calculus -- An Overview of the mCRL2 Toolset and Its Recent Advances -- Analysis of Boolean Programs -- Weighted Pushdown Systems with Indexed Weight Domains -- Underapproximation of Procedure Summaries for Integer Programs -- Runtime Verification Based on Register Automata -- Unbounded Model-Checking with Interpolation for Regular Language Constraints -- eVolCheck: Incremental Upgrade Checker for C -- Intertwined Forward-Backward Reachability Analysis Using Interpolants -- An Integrated Specification and Verification Technique or Highly Concurrent Data Structures -- A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems -- Identifying Dynamic Data Structures by Learning Evolving Patterns in Memory -- Synthesis of Circular Compositional Program Proofs via Abduction -- As Soon as Probable: Optimal Scheduling under Stochastic Uncertainty -- Integer Parameter Synthesis for Timed Automata -- LTL Model-Checking for Malware Detection -- Policy Analysis for Self-administrated Role-Based Access Control -- Model Checking Agent Knowledge in Dynamic Access Control Policies -- Frontiers (Graphics and Quantum) Automatic Testing of Real-Time Graphics Systems -- Equivalence Checking of Quantum Protocols -- Encoding Monomorphic and Polymorphic Types -- Deriving Probability Density Functions from Probabilistic Functional Programs -- Tool Demonstrations Polyglot: Systematic Analysis for Multiple Statechart Formalisms -- Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO -- BULL: A Library for Learning Algorithms of Boolean Functions -- AppGuard Enforcing User Requirements on Android Apps -- Model Checking Database Applications -- Efficient Property Preservation Checking of Model Refinements -- Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking -- Competition on Software Verification Second Competition on Software Verification (Summary of SV-COMP 2013) -- CPAchecker with Explicit-Value Analysis Based on CEGAR and Interpolation (Competition Contribution) -- CPAchecker with Sequential Combination of Explicit-State Analysis and Predicate Analysis (Competition Contribution) -- CSeq: A Sequentialization Tool for C (Competition Contribution) -- Handling Unbounded Loops with ESBMC 1.20 (Competition Contribution) -- LLBMC: Improved Bounded Model Checking of C Programs Using LLVM (Competition Contribution) -- Predator: A Tool for Verification of Low-Level List Manipulation (Competition Contribution) -- Symbiotic: Synergy of Instrumentation, Slicing, and Symbolic Execution (Competition Contribution) -- Threader: A Verifier for Multi-threaded Programs (Competition Contribution) -- UFO: Verification with Interpolants and Abstract Interpretation (Competition Contribution) -- Ultimate Automizer with SMTInterpol (Competition Contribution). 
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 chttps://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
410 | |0 200114832  |t Theoretical computer science and general issues (Online)  |x 2512-2029  |v 7795 
452 | |t Tools and Algorithms for the Construction and Analysis of Systems  |b Texte imprimé  |y 9783642367410 
452 | |t Tools and Algorithms for the Construction and Analysis of Systems  |b Texte imprimé  |y 9783642367434 
610 1 |a Computer Science 
610 2 |a Logics and Meanings of Programs 
610 2 |a Algorithm Analysis and Problem Complexity 
610 2 |a Programming Languages, Compilers, Interpreters 
610 2 |a Software Engineering 
610 1 |a Computer Science Logic and Foundations of Programming 
610 2 |a Algorithms 
610 2 |a Compilers and Interpreters 
615 |a @Computer Science  |n 11645  |2 Springer 
676 |a 005.1015113  |v 23 
680 |a QA76.9.L63 
680 |a QA76.5913 
680 |a QA76.63 
700 1 |3 PPN253482941  |a Piterman  |b Nir  |f 19..-  |4 651 
701 1 |a Piterman  |b Nir  |4 651 
701 1 |a Smolka  |b Scott  |4 651 
801 3 |a FR  |b Abes  |c 20240814  |g AFNOR 
801 1 |a DE  |b Springer  |c 20240603  |g AACR2 
856 4 |u https://doi.org/10.1007/978-3-642-36742-7  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://doi.org/10.1007/978-3-642-36742-7  |z Accès sur la plateforme de l'éditeur (Springer) 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-BK9GX8QV-1  |z Accès sur la plateforme Istex 
856 4 |5 441099901:830857605  |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-642-36742-7 
915 |5 441099901:830857605  |b SPRING13-00779 
930 |5 441099901:830857605  |b 441099901  |j g 
991 |5 441099901:830857605  |a Exemplaire créé en masse par ITEM le 30-09-2024 16:14 
997 |a NUM  |b SPRING13-00779  |d NUMpivo  |e EM  |s d 
998 |a 978602