國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Computer aided verification31st Inte...

(1998 :)

Computer aided verification31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019 : proceedings.Part II /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Computer aided verificationedited by Isil Dillig, Serdar Tasiran.
其他題名:	31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019 : proceedings.
其他題名:	CAV 2019
其他作者:	Dillig, Isil.
團體作者:
出版者:	Cham :Springer International Publishing :2019.
面頁冊數:	xx, 549 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer programsCongresses.Verification
電子資源:	https://doi.org/10.1007/978-3-030-25543-5
ISBN:	9783030255435$q(electronic bk.)

Computer aided verification31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019 : proceedings.Part II /
Computer aided verification31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019 : proceedings.Part II /[electronic resource] :CAV 2019edited by Isil Dillig, Serdar Tasiran. - Cham :Springer International Publishing :2019. - xx, 549 p. :ill., digital ;24 cm. - Lecture notes in computer science,115620302-9743 ;. - Lecture notes in computer science ;4891..

Logics, Decision Procedures, and Solvers -- Satisfiability Checking for Mission-Time LTL -- High-Level Abstractions for Simplifying Extended String Constraints in SMT -- Alternating Automata Modulo First Order Theories -- Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors -- CVC4SY: Smart and Fast Term Enumeration for Syntax-Guided Synthesis -- Incremental Determinization for Quantifier Elimination and Functional Synthesis -- Numerical Programs -- Loop Summarization with Rational Vector Addition Systems -- Invertibility Conditions for Floating-Point Formulas -- Numerically-Robust Inductive Proof Rules for Continuous Dynamical Systems -- Icing: Supporting Fast-math Style Optimizations in a Verified Compiler -- Sound Approximation of Programs with Elementary Functions -- Verification -- Formal verification of quantum algorithms using quantum Hoare logic -- SecCSL: Security Concurrent Separation Logic -- Reachability Analysis for AWS-based Networks -- Distributed Systems and Networks -- Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics -- Gradual Consistency Checking -- Checking Robustness Against Snapshot Isolation -- Efficient verification of network fault tolerance via counterexampleguided refinement -- On the Complexity of Checking Consistency for Replicated Data Types -- Communication-closed asynchronous protocols -- Verification and Invariants -- Interpolating Strong Induction -- Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers -- Inferring Inductive Invariants from Phase Structures -- Termination of Triangular Integer Loops is Decidable -- AliveInLean: A Verified LLVM Peephole Optimization Verifier -- Concurrency -- Automated Parameterized Verification of CRDTs -- What's wrong with on-the-y partial order reduction -- Integrating Formal Schedulability Analysis into a Verifed OS Kernel -- Rely-guarantee Reasoning about Concurrent Memory Management in Zephyr RTOS -- Violat: Generating Tests of Observational Refinement for Concurrent Objects.

Open access.

The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency.

ISBN: 9783030255435$q(electronic bk.)

Standard No.: 10.1007/978-3-030-25543-5doiSubjects--Topical Terms:

384456
Computer programs
--Verification--Congresses.

LC Class. No.: QA76.758 / .C38 2019

Dewey Class. No.: 005.1

Computer aided verification31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019 : proceedings.Part II /
LDR:04111nmm a2200373 a 4500 001 563702
003 DE-He213
005 20190712192057.0
006 m d
007 cr nn 008maaau
008 200311s2019 gw s 0 eng d
020 $a 9783030255435$q(electronic bk.)
020 $a 9783030255428$q(paper)
024 7 $a 10.1007/978-3-030-25543-5 $2 doi
035 $a 978-3-030-25543-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.758 $b .C38 2019
072 7 $a UMZ $2 bicssc
072 7 $a COM051230 $2 bisacsh
072 7 $a UMZ $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.758 $b .C376 2019
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Computer aided verification $h [electronic resource] : $b 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019 : proceedings. $n Part II / $c edited by Isil Dillig, Serdar Tasiran.
246 3 $a CAV 2019
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a xx, 549 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 11562
490 1 $a Theoretical computer science and general issues
505 0 $a Logics, Decision Procedures, and Solvers -- Satisfiability Checking for Mission-Time LTL -- High-Level Abstractions for Simplifying Extended String Constraints in SMT -- Alternating Automata Modulo First Order Theories -- Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors -- CVC4SY: Smart and Fast Term Enumeration for Syntax-Guided Synthesis -- Incremental Determinization for Quantifier Elimination and Functional Synthesis -- Numerical Programs -- Loop Summarization with Rational Vector Addition Systems -- Invertibility Conditions for Floating-Point Formulas -- Numerically-Robust Inductive Proof Rules for Continuous Dynamical Systems -- Icing: Supporting Fast-math Style Optimizations in a Verified Compiler -- Sound Approximation of Programs with Elementary Functions -- Verification -- Formal verification of quantum algorithms using quantum Hoare logic -- SecCSL: Security Concurrent Separation Logic -- Reachability Analysis for AWS-based Networks -- Distributed Systems and Networks -- Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics -- Gradual Consistency Checking -- Checking Robustness Against Snapshot Isolation -- Efficient verification of network fault tolerance via counterexampleguided refinement -- On the Complexity of Checking Consistency for Replicated Data Types -- Communication-closed asynchronous protocols -- Verification and Invariants -- Interpolating Strong Induction -- Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers -- Inferring Inductive Invariants from Phase Structures -- Termination of Triangular Integer Loops is Decidable -- AliveInLean: A Verified LLVM Peephole Optimization Verifier -- Concurrency -- Automated Parameterized Verification of CRDTs -- What's wrong with on-the-y partial order reduction -- Integrating Formal Schedulability Analysis into a Verifed OS Kernel -- Rely-guarantee Reasoning about Concurrent Memory Management in Zephyr RTOS -- Violat: Generating Tests of Observational Refinement for Concurrent Objects.
506 $a Open access.
520 $a The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency.
650 0 $a Computer programs $x Verification $v Congresses. $3 384456
650 0 $a Software engineering. $3 184729
650 0 $a Computer science. $3 199325
650 0 $a Information theory. $3 183013
650 0 $a Artificial intelligence. $3 194058
650 0 $a Computer simulation. $3 182122
650 0 $a Computer network architectures. $3 197806
650 1 4 $a Software Engineering. $3 274511
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a System Performance and Evaluation. $3 273898
650 2 4 $a The Computing Profession. $3 275271
650 2 4 $a Logic in AI. $3 836108
700 1 $a Dillig, Isil. $3 849336
700 1 $a Tasiran, Serdar. $3 849337
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-25543-5
950 $a Computer Science (Springer-11645)