大葉大學圖書館 |

Computer aided verification[electronic resource] :27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015 : proceedings.Part I /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	004.24
書名/作者:	Computer aided verification : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015 : proceedings./ edited by Daniel Kroening, Corina S. Pasareanu.
其他題名:	CAV 2015
其他作者:	Kroening, Daniel.
團體作者:	Clark Conference
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	xxiii, 677 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Computer software - Congresses. - Verification
標題:	Computer Science.
標題:	Logics and Meanings of Programs.
標題:	Software Engineering/Programming and Operating Systems.
標題:	Mathematical Logic and Formal Languages.
標題:	Computer Systems Organization and Communication Networks.
ISBN:	9783319216904 (electronic bk.)
ISBN:	9783319216898 (paper)
內容註:	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 -- 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 -- 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.
摘要、提要註:	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.
電子資源:	http://dx.doi.org/10.1007/978-3-319-21690-4

Computer aided verification[electronic resource] :27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015 : proceedings.Part I /
Computer aided verification27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015 : proceedings.Part I /[electronic resource] :CAV 2015edited by Daniel Kroening, Corina S. Pasareanu. - Cham :Springer International Publishing :2015. - xxiii, 677 p. :ill., digital ;24 cm. - Lecture notes in computer science,92060302-9743 ;. - Lecture notes in computer science ;7103..

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

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.

ISBN: 9783319216904 (electronic bk.)

Standard No.: 10.1007/978-3-319-21690-4doiSubjects--Topical Terms:

466241
Computer software
--Verification--Congresses.

LC Class. No.: QA76.76.V47

Dewey Class. No.: 004.24

Computer aided verification[electronic resource] :27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015 : proceedings.Part I /
LDR:04686nam a2200361 a 4500 001 442988
003 DE-He213
005 20160225104441.0
006 m d
007 cr nn 008maaau
008 160715s2015 gw s 0 eng d
020 $a 9783319216904 (electronic bk.)
020 $a 9783319216898 (paper)
024 7 $a 10.1007/978-3-319-21690-4 $2 doi
035 $a 978-3-319-21690-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.76.V47
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 004.24 $2 23
090 $a QA76.76.V47 $b C376 2015
111 2 $a Clark Conference $d (2005 : $c Sterling and Francine Clark Art Institute) $3 347558
245 1 0 $a Computer aided verification $h [electronic resource] : $b 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015 : proceedings. $n Part I / $c edited by Daniel Kroening, Corina S. Pasareanu.
246 3 $a CAV 2015
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xxiii, 677 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9206
505 0 $a 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 -- 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 -- 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.
520 $a 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.
650 0 $a Computer software $x Verification $v Congresses. $3 466241
650 1 4 $a Computer Science. $3 423143
650 2 4 $a Logics and Meanings of Programs. $3 466905
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 464445
650 2 4 $a Mathematical Logic and Formal Languages. $3 463478
650 2 4 $a Computer Systems Organization and Communication Networks. $3 463914
700 1 $a Kroening, Daniel. $3 633226
700 1 $a Pasareanu, Corina S. $3 633227
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-21690-4
950 $a Computer Science (Springer-11645)