Muutke küpsiste eelistusi

Computer Aided Verification: 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I 1st ed. 2015 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 677 pages, kõrgus x laius: 235x155 mm, 141 Illustrations, black and white; XXIII, 677 p. 141 illus., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 9206
  • Ilmumisaeg: 27-Jul-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319216899
  • ISBN-13: 9783319216898
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 677 pages, kõrgus x laius: 235x155 mm, 141 Illustrations, black and white; XXIII, 677 p. 141 illus., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 9206
  • Ilmumisaeg: 27-Jul-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319216899
  • ISBN-13: 9783319216898
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.

A Trusted Mechanised Specification of JavaScript: One Year On.- Model Checking and Refinements.- On Automation of CTL Verification for Infinite-State Systems.- Algorithms for Model Checking HyperLTL and HyperCTL .- Fairness Modulo Theory: A New Approach to LTL Software Model Checking.- Model Checking Parameterized Asynchronous Shared-Memory Systems.- SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms.- Skipping Refinement.- Quantitative Reasoning.- Percentile Queries in Multi-dimensional Markov Decision Processes.- Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.- Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.- Symbolic Polytopes for Quantitative Interpolation and Verification.- Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks.- PROPhESY: A PRObabilistic ParamEter SYnthesis Tool.- Software Analysis.- Effective Searc

h-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints.- Automata-Based Model Counting for String Constraints.- OpenJDK"s Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case.- Tree Buffers.- Learning Commutativity.- Specifications.- Angelic Verification: Precise Verification Modulo Unknowns.- The SeaHorn Verification Framework.- Automatic Rootcausing for Program Equivalence Failures in Binaries.- Fine-Grained Caching of Verification Results.- Predicting a Correct Program in Programming by Example.- Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation.- Lightning Talks.- ADAM: Causality-Based Synthesis of Distributed Systems.- Alchemist: Learning Guarded Affine Functions.- OptiMathSAT: A Tool for Optimization Modulo Theories.- Systematic Asynchrony Bug Exploration for Android Apps.- Norn: An SMT Solver for String Constraints.- PVSio-web 2.0: Joining PVS to HCI.- The Hanoi Omega-Automata Form

at.- The Open-Source LearnLib: A Framework for Active Automata Learning.- BBS: A Phase-Bounded Model Checker for Asynchronous Programs.- Time-Aware Abstractions in HybridSal.- A Type-Directed Approach to Program Repair.- Formal Design and Safety Analysis of AIR6110 Wheel Brake System.- Meeting a Powertrain Verification Challenge.- Synthesising Executable Gene Regulatory Networks from Single-Cell Gene Expression Data.- Empirical Software Metrics for Benchmarking of Verification Tools.- Interpolation, IC3/PDR, and Invariants Property-Directed Inference of Universal Invariants or Proving Their Absence.- Efficient Anytime Techniques for Model-Based Safety Analysis.- Boosting k-induction with Continuously-Refined Invariants.- Fast Interpolating BMC.- Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation.
A Trusted Mechanised Specification of JavaScript: One Year On.- Model
Checking and Refinements.- On Automation of CTL* Verification for
Infinite-State Systems.- Algorithms for Model Checking HyperLTL and HyperCTL
.- Fairness Modulo Theory: A New Approach to LTL Software Model Checking.-
Model Checking Parameterized Asynchronous Shared-Memory Systems.- SMT and POR
Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based
Distributed Algorithms.- Skipping Refinement.- Quantitative Reasoning.-
Percentile Queries in Multi-dimensional Markov Decision Processes.- Faster
Algorithms for Quantitative Verification in Constant Treewidth Graphs.-
Counterexample Explanation by Learning Small Strategies in Markov Decision
Processes.- Symbolic Polytopes for Quantitative Interpolation and
Verification.- Adaptive Aggregation of Markov Chains: Quantitative Analysis
of Chemical Reaction Networks.- PROPhESY: A PRObabilistic ParamEter SYnthesis
Tool.- Software Analysis.- Effective Search-Space Pruning for Solvers of
String Equations, Regular Expressions and Length Constraints.- Automata-Based
Model Counting for String Constraints.- OpenJDKs
Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst
Case.- Tree Buffers.- Learning Commutativity.- Specifications.- Angelic
Verification: Precise Verification Modulo Unknowns.- The SeaHorn Verification
Framework.- Automatic Rootcausing for Program Equivalence Failures in
Binaries.- Fine-Grained Caching of Verification Results.- Predicting a
Correct Program in Programming by Example.- Abstract Interpretation with
Higher-Dimensional Ellipsoids and Conic Extrapolation.- Lightning Talks.-
ADAM: Causality-Based Synthesis of Distributed Systems.- Alchemist: Learning
Guarded Affine Functions.- OptiMathSAT: A Tool for Optimization Modulo
Theories.- Systematic Asynchrony Bug Exploration for Android Apps.- Norn: An
SMT Solver for String Constraints.- PVSio-web 2.0: Joining PVS to HCI.- The
Hanoi Omega-Automata Format.- TheOpen-Source LearnLib: A Framework for Active
Automata Learning.- BBS: A Phase-Bounded Model Checker for Asynchronous
Programs.- Time-Aware Abstractions in HybridSal.- A Type-Directed Approach to
Program Repair.- Formal Design and Safety Analysis of AIR6110 Wheel Brake
System.- Meeting a Powertrain Verification Challenge.- Synthesising
Executable Gene Regulatory Networks from Single-Cell Gene Expression Data.-
Empirical Software Metrics for Benchmarking of Verification Tools.-
Interpolation, IC3/PDR, and Invariants Property-Directed Inference of
Universal Invariants or Proving Their Absence.- Efficient Anytime Techniques
for Model-Based Safety Analysis.- Boosting k-induction with
Continuously-Refined Invariants.- Fast Interpolating BMC.-
Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange
Interpolation.