000 05839nam a22005895i 4500
001 978-3-319-21690-4
003 DE-He213
005 20240730182316.0
007 cr nn 008mamaa
008 150715s2015 sz | s |||| 0|eng d
020 _a9783319216904
_9978-3-319-21690-4
024 7 _a10.1007/978-3-319-21690-4
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aComputer Aided Verification
_h[electronic resource] :
_b27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I /
_cedited by Daniel Kroening, Corina S. Păsăreanu.
250 _a1st ed. 2015.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aXXIII, 677 p. 141 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9206
505 0 _aA 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 -- 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 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.
520 _aThe 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.
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aMachine theory.
_9127792
650 0 _aComputer engineering.
_910164
650 0 _aComputer networks .
_931572
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aFormal Languages and Automata Theory.
_9127793
650 2 4 _aComputer Engineering and Networks.
_9127794
700 1 _aKroening, Daniel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127795
700 1 _aPăsăreanu, Corina S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9127796
710 2 _aSpringerLink (Online service)
_9127797
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319216898
776 0 8 _iPrinted edition:
_z9783319216911
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9206
_9127798
856 4 0 _uhttps://doi.org/10.1007/978-3-319-21690-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91305
_d91305