語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Computer Aided Verification = 31st I...
~
SpringerLink (Online service)
Computer Aided Verification = 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Computer Aided Verification/ edited by Isil Dillig, Serdar Tasiran.
其他題名:
31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II /
其他作者:
Dillig, Isil.
面頁冊數:
XX, 549 p. 1209 illus., 42 illus. in color.online resource. :
Contained By:
Springer Nature eBook
標題:
Software engineering. -
電子資源:
https://doi.org/10.1007/978-3-030-25543-5
ISBN:
9783030255435
Computer Aided Verification = 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II /
Computer Aided Verification
31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II /[electronic resource] :edited by Isil Dillig, Serdar Tasiran. - 1st ed. 2019. - XX, 549 p. 1209 illus., 42 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11562. - Theoretical Computer Science and General Issues ;9163.
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
Standard No.: 10.1007/978-3-030-25543-5doiSubjects--Topical Terms:
562952
Software engineering.
LC Class. No.: QA76.758
Dewey Class. No.: 005.1
Computer Aided Verification = 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II /
LDR
:04410nam a22004335i 4500
001
1006767
003
DE-He213
005
20200629193030.0
007
cr nn 008mamaa
008
210106s2019 gw | s |||| 0|eng d
020
$a
9783030255435
$9
978-3-030-25543-5
024
7
$a
10.1007/978-3-030-25543-5
$2
doi
035
$a
978-3-030-25543-5
050
4
$a
QA76.758
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
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, Part II /
$c
edited by Isil Dillig, Serdar Tasiran.
250
$a
1st ed. 2019.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2019.
300
$a
XX, 549 p. 1209 illus., 42 illus. in color.
$b
online resource.
336
$a
text
$b
txt
$2
rdacontent
337
$a
computer
$b
c
$2
rdamedia
338
$a
online resource
$b
cr
$2
rdacarrier
347
$a
text file
$b
PDF
$2
rda
490
1
$a
Theoretical Computer Science and General Issues ;
$v
11562
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
0
$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
Software engineering.
$3
562952
650
0
$a
Computer logic.
$3
786340
650
0
$a
Mathematical logic.
$2
bicssc
$3
810627
650
0
$a
Computer system failures.
$3
782237
650
0
$a
Computers.
$3
565115
650
0
$a
Artificial intelligence.
$3
559380
650
1 4
$a
Software Engineering.
$3
669632
650
2 4
$a
Logics and Meanings of Programs.
$3
670058
650
2 4
$a
Mathematical Logic and Formal Languages.
$3
670059
650
2 4
$a
System Performance and Evaluation.
$3
669346
650
2 4
$a
The Computing Profession.
$3
669954
650
2 4
$a
Logic in AI.
$3
1228083
700
1
$a
Dillig, Isil.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1229173
700
1
$a
Tasiran, Serdar.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1074167
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783030255428
776
0 8
$i
Printed edition:
$z
9783030255442
830
0
$a
Theoretical Computer Science and General Issues ;
$v
9163
$3
1253524
856
4 0
$u
https://doi.org/10.1007/978-3-030-25543-5
912
$a
ZDB-2-SCS
912
$a
ZDB-2-SXCS
912
$a
ZDB-2-LNC
912
$a
ZDB-2-SOB
950
$a
Computer Science (SpringerNature-11645)
950
$a
Computer Science (R0) (SpringerNature-43710)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入