000			05396nam a22003855i 4500
001			294834
003			MX-SnUAN
005			20170705134231.0
007			cr nn 008mamaa
008			150903s2005 gw | o |||| 0|eng d
020			_a9783540319801 _99783540319801
024	7		_a10.1007/b107194 _2doi
035			_avtls000348095
039		9	_a201509031111 _bVLOAD _c201405070459 _dVLOAD _y201402071019 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA76.9.L63
100	1		_aHalbwachs, Nicolas. _eeditor. _9328761
245	1	0	_aTools and Algorithms for the Construction and Analysis of Systems : _b11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings / _cedited by Nicolas Halbwachs, Lenore D. Zuck.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2005.
300			_axvii, 588 páginas Also available online. _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v3440
500			_aSpringer eBooks
505	0		_aInvited Paper -- Applications of Craig Interpolants in Model Checking -- Regular Model-Checking -- Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking -- Simulation-Based Iteration of Tree Transducers -- Using Language Inference to Verify Omega-Regular Properties -- Infinite State Systems -- On-the-Fly Reachability and Cycle Detection for Recursive State Machines -- Empirically Efficient Verification for a Class of Infinite-State Systems -- Context-Bounded Model Checking of Concurrent Software -- A Generic Theorem Prover of CSP Refinement -- Abstract Interpretation -- Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems -- An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation -- Dependent Types for Program Understanding -- Automata and Logics -- A Note on On-the-Fly Verification Algorithms -- Truly On-the-Fly LTL Model Checking -- Complementation Constructions for Nondeterministic Automata on Infinite Words -- Using BDDs to Decide CTL -- Probabilistic Systems, Probabilistic Model-Checking -- Model Checking Infinite-State Markov Chains -- Algorithmic Verification of Recursive Probabilistic State Machines -- Monte Carlo Model Checking -- Satisfiability -- Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit -- Bounded Validity Checking of Interval Duration Logic -- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic -- A Two-Tier Technique for Supporting Quantifiers in a Lazily Proof-Explicating Theorem Prover -- Testing -- Symbolic Test Selection Based on Approximate Analysis -- Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution -- Abstraction and Reduction -- Dynamic Symmetry Reduction -- Localization and Register Sharing for Predicate Abstraction -- On Some Transformation Invariants Under Retiming and Resynthesis -- Specification, Program Synthesis -- Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs -- Temporal Logic for Scenario-Based Specifications -- Mining Temporal Specifications for Error Detection -- A New Algorithm for Strategy Synthesis in LTL Games -- Model-Checking -- Shortest Counterexamples for Symbolic Model Checking of LTL with Past -- Snapshot Verification -- Time-Efficient Model Checking with Magnetic Disk -- Tool Presentations -- jMoped: A Java Bytecode Checker Based on Moped -- Java-MOP: A Monitoring Oriented Programming Environment for Java -- JML-Testing-Tools: A Symbolic Animator for JML Specifications Using CLP -- jETI: A Tool for Remote Tool Integration -- FocusCheck: A Tool for Model Checking and Debugging Sequential C Programs -- SATABS: SAT-Based Predicate Abstraction for ANSI-C -- DiVer: SAT-Based Model Checking Platform for Verifying Large Scale Systems -- BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking.
520			_aThis book constitutes the refereed proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2005, held in Edinburgh, UK in April 2005 as part of ETAPS. The 33 revised full research papers and 8 revised tool demonstration papers presented together with an invited paper were carefully reviewed and selected from a total of 161 submissions. The papers are organized in topical sections on regular model-checking, infinite state machines, abstract interpretation, automata and logics, probabilistic systems and probabilistic model checking, satisfiability, testing, abstraction and reduction, specification and program synthesis, and model-checking.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aZuck, Lenore D. _eeditor. _9328762
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783540253334
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/b107194 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c294834 _d294834