Computer Aided Verification : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II (Theoretical Computer Science and General Issues)

個数:

Computer Aided Verification : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II (Theoretical Computer Science and General Issues)

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 469 p.
  • 商品コード 9783319216676

Full Description

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 ofHigher-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.