1 option
Computer Aided Verification : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II / edited by Daniel Kroening, Corina S. Păsăreanu.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 9207
- Theoretical Computer Science and General Issues, 2512-2029 ; 9207
- Language:
- English
- Subjects (All):
- Computer science.
- Software engineering.
- Machine theory.
- Computer engineering.
- Computer networks.
- Computer Science Logic and Foundations of Programming.
- Software Engineering.
- Formal Languages and Automata Theory.
- Computer Engineering and Networks.
- Local Subjects:
- Computer Science Logic and Foundations of Programming.
- Software Engineering.
- Formal Languages and Automata Theory.
- Computer Engineering and Networks.
- Physical Description:
- 1 online resource (XVIII, 469 pages) : 107 illustrations
- Edition:
- 1st ed. 2015.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- System Details:
- text file PDF
- Summary:
- The two-volume set LNCS 9206 and LNCS 9207 constitutes the refereed proceedings of the 27th International Conference on Computer Aided Verification, CAV 2015, held in San Francisco, CA, USA, in July 2015. The total of 58 full and 11 short papers presented in the proceedings was carefully reviewed and selected from 252 submissions. The papers were organized in topical sections named: model checking and refinements; quantitative reasoning; software analysis; lightning talks; interpolation, IC3/PDR, and Invariants; SMT techniques and applications; HW verification; synthesis; termination; and concurrency.
- Contents:
- SMT 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-21668-3
- 9783319216683
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.