000 | 03175nam a22003495i 4500 | ||
---|---|---|---|
001 | 321449 | ||
003 | MX-SnUAN | ||
005 | 20160429161503.0 | ||
007 | cr nn 008mamaa | ||
008 | 160111s2015 gw | s |||| 0|eng d | ||
020 |
_a9783319216683 _9978-3-319-21668-3 |
||
035 | _avtls000421973 | ||
039 | 9 |
_y201601111019 _zstaff |
|
050 | 4 | _aQA76.9.L63 | |
245 | 1 | 0 |
_aComputer aided verification : _b27th international conference, cav 2015, san francisco, ca, usa, july 18-24, 2015, proceedings, part ii / _cedited by Daniel Kroening, Corina S. P?s?reanu. |
264 | 1 |
_aCham : _bSpringer International Publishing : _bSpringer, _c2015. |
|
300 |
_axviii, 469 páginas : _b107 ilustraciones |
||
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 ; _v9207 |
|
500 | _aSpringer eBooks | ||
505 | 0 | _aSMT Techniques and Applications -- POLING: SMT Aided Linearizability Proofs -- Finding Bounded Path in Graph Using SMT for Automatic Clock Routing -- Cutting the Mix -- The Inez Mathematical Programming Modulo Theories Framework -- Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets -- Deciding Local Theory Extensions via E-matching -- HW Verification -- Modular Deductive Verification of Multiprocessor Hardware Designs -- Word-Level Symbolic Trajectory Evaluation -- Verifying Linearizability of Intel® Software Guard Extensions -- Synthesis Synthesis Through Unification -- From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis -- Counterexample-Guided Quantifier Instantiation for Synthesis in SMT -- Deductive Program Repair -- Quantifying Conformance Using the Skorokhod Metric -- Pareto Curves of Multidimensional Mean-Payoff Games -- Termination -- Conflict-Driven Conditional Termination -- Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs -- Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions -- Measuring with Timed Patterns -- Automatic Verification of Stability and Safety for Delay Differential Equations -- Time Robustness in MTL and Expressivity in Hybrid System Falsification -- Concurrency -- Adaptive Concretization for Parallel Program Synthesis -- Automatic Completion of Distributed Protocols with Symmetry -- An Axiomatic Specification for Sequential Memory Models -- Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems -- Automated and Modular Refinement Reasoning for Concurrent Programs. | |
590 | _aPara consulta fuera de la UANL se requiere clave de acceso remoto. | ||
700 | 1 |
_aKroening, Daniel, _eeditor. _9332942 |
|
700 | 1 |
_aP?s?reanu, Corina S, _eeditor. _9337852 |
|
710 | 2 |
_aSpringerLink (Servicio en línea) _9299170 |
|
776 | 0 | 8 |
_iEdición impresa: _z9783319216676 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-319-21668-3 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c321449 _d321449 |