語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
到查詢結果
[ subject:"Formal methods (Computer science)" ]
切換:
標籤
|
MARC模式
|
ISBD
NASA formal methods = 14th Internati...
~
NFM (Symposium) (2022 :)
FindBook
Google Book
Amazon
博客來
NASA formal methods = 14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24-27, 2022 : proceedings /
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
NASA formal methods/ edited by Jyotirmoy V. Deshmukh, Klaus Havelund, Ivan Perez.
其他題名:
14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24-27, 2022 : proceedings /
其他題名:
NFM 2022
其他作者:
Deshmukh, Jyotirmoy.
團體作者:
NFM (Symposium)
出版者:
Cham :Springer International Publishing : : 2022.,
面頁冊數:
xxii, 828 p. :ill. (chiefly col.), digital ;24 cm.
內容註:
Invited Keynotes -- Formal Methods for Trusted Space Autonomy: Boon or Bane -- An Essence of Domain Engineering - A Basis for Trustworthy Aeronautics and Space Software -- Concept Design Moves -- Automating Program Transformation with Coccinelle -- The Prusti Project: Formal Verification for Rust -- Summers Reachability Analysis for Cyber-Physical Systems: Are we there yet -- Regular Submissions -- Towards Better Test Coverage: Merging Unit Tests for Autonomous Systems -- Quantification of Battery Depletion Risk Made Efficient -- Hierarchical Contract-based Synthesis for Assurance Cases -- Verified Probabilistic Policies for Deep Reinforcement Learning -- NNLander-VeriF: A Neural Network Formal Verification Framework for Vision-Based Autonomous Aircraft Landing -- The Black-Box Simplex Architecture for Runtime Assurance of Autonomous CPS -- Case Studies for Computing Density of Reachable States for Safe Autonomous Motion Planning -- Towards Refactoring FRETish Requirements -- Neural Network Compression of ACAS Xu Early Prototype is Unsafe: Closed-Loop Verification through Quantized State Backreachability -- ZoPE: A Fast Optimizer for ReLU Networks with Low-Dimensional Inputs -- Permutation Invariance of Deep Neural Networks with ReLUs -- Configurable Benchmarks for C Model Checkers -- AssumeGuarantee Reasoning with Scheduled Components -- Stateful Black-Box Fuzzing of Bluetooth Devices Using Automata Learning -- From Verified Scala to STIX File System Embedded Code using Stainless -- On the Termination of Borrow Checking in Featherweight Rust -- Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme -- Zone Extrapolations in Parametric Timed Automata -- Exemplifying Parametric Timed Specifications over Signals with Bounded Behavior -- Timed Automata Learning via SMT Solving -- Asynchronous Composition of Local Interface LTL Properties -- Elucidation and Analysis of Specification Patterns in Aerospace System Telemetry -- Robust Computation Tree Logic -- On the-Fly Model Checking with Neural MCTS -- Checking and Test Generation for Comprehensive Verification -- Operational Annotations: a New Method for Sequential Program Verification -- Byzantine Fault Tolerant Consensus in Agda -- DSV: Disassembly Soundness Validation without Assuming a Ground Truth -- Probabilistic Hyperproperties with Rewards -- Hypercontracts -- Monitorability of Expressive Verdicts -- BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees -- Approximate Translation from Floating-Point to Real-Interval Arithmetic -- Synthesis of Optimal Defenses for System Architecture Design Model in MaxSMT -- Certified Computation of Nondeterministic Limits -- The Power of Disjoint Support Decompositions in Decision Diagrams -- Incremental Transitive Closure for Zonal Abstract Domain -- Proof Mate: an Interactive Proof Helper for PVS -- Runtime Verification Triggers -- Real-time, Autonomous Fault Recovery on the CySat-I.
Contained By:
Springer Nature eBook
標題:
Formal methods (Computer science) - Congresses. -
電子資源:
https://doi.org/10.1007/978-3-031-06773-0
ISBN:
9783031067730
NASA formal methods = 14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24-27, 2022 : proceedings /
NASA formal methods
14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24-27, 2022 : proceedings /[electronic resource] :NFM 2022edited by Jyotirmoy V. Deshmukh, Klaus Havelund, Ivan Perez. - Cham :Springer International Publishing :2022. - xxii, 828 p. :ill. (chiefly col.), digital ;24 cm. - Lecture notes in computer science,132600302-9743 ;. - Lecture notes in computer science ;13260..
Invited Keynotes -- Formal Methods for Trusted Space Autonomy: Boon or Bane -- An Essence of Domain Engineering - A Basis for Trustworthy Aeronautics and Space Software -- Concept Design Moves -- Automating Program Transformation with Coccinelle -- The Prusti Project: Formal Verification for Rust -- Summers Reachability Analysis for Cyber-Physical Systems: Are we there yet -- Regular Submissions -- Towards Better Test Coverage: Merging Unit Tests for Autonomous Systems -- Quantification of Battery Depletion Risk Made Efficient -- Hierarchical Contract-based Synthesis for Assurance Cases -- Verified Probabilistic Policies for Deep Reinforcement Learning -- NNLander-VeriF: A Neural Network Formal Verification Framework for Vision-Based Autonomous Aircraft Landing -- The Black-Box Simplex Architecture for Runtime Assurance of Autonomous CPS -- Case Studies for Computing Density of Reachable States for Safe Autonomous Motion Planning -- Towards Refactoring FRETish Requirements -- Neural Network Compression of ACAS Xu Early Prototype is Unsafe: Closed-Loop Verification through Quantized State Backreachability -- ZoPE: A Fast Optimizer for ReLU Networks with Low-Dimensional Inputs -- Permutation Invariance of Deep Neural Networks with ReLUs -- Configurable Benchmarks for C Model Checkers -- AssumeGuarantee Reasoning with Scheduled Components -- Stateful Black-Box Fuzzing of Bluetooth Devices Using Automata Learning -- From Verified Scala to STIX File System Embedded Code using Stainless -- On the Termination of Borrow Checking in Featherweight Rust -- Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme -- Zone Extrapolations in Parametric Timed Automata -- Exemplifying Parametric Timed Specifications over Signals with Bounded Behavior -- Timed Automata Learning via SMT Solving -- Asynchronous Composition of Local Interface LTL Properties -- Elucidation and Analysis of Specification Patterns in Aerospace System Telemetry -- Robust Computation Tree Logic -- On the-Fly Model Checking with Neural MCTS -- Checking and Test Generation for Comprehensive Verification -- Operational Annotations: a New Method for Sequential Program Verification -- Byzantine Fault Tolerant Consensus in Agda -- DSV: Disassembly Soundness Validation without Assuming a Ground Truth -- Probabilistic Hyperproperties with Rewards -- Hypercontracts -- Monitorability of Expressive Verdicts -- BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees -- Approximate Translation from Floating-Point to Real-Interval Arithmetic -- Synthesis of Optimal Defenses for System Architecture Design Model in MaxSMT -- Certified Computation of Nondeterministic Limits -- The Power of Disjoint Support Decompositions in Decision Diagrams -- Incremental Transitive Closure for Zonal Abstract Domain -- Proof Mate: an Interactive Proof Helper for PVS -- Runtime Verification Triggers -- Real-time, Autonomous Fault Recovery on the CySat-I.
This book constitutes the proceedings of the 14th International Symposium on NASA Formal Methods, NFM 2022, held in Pasadena, USA, during May 24-27, 2022. The 33 full and 6 short papers presented in this volume were carefully reviewed and selected from 118submissions. The volume also contains 6 invited papers. The papers deal with advances in formal methods, formal methods techniques, and formal methods in practice. The focus on topics such as interactive and automated theorem proving; SMT and SAT solving; model checking; use of machine learning and probabilistic reasoning in formal methods; formal methods and graphical modeling languages such as SysML or UML; usability of formal method tools and application in industry, etc.
ISBN: 9783031067730
Standard No.: 10.1007/978-3-031-06773-0doiSubjects--Topical Terms:
622707
Formal methods (Computer science)
--Congresses.
LC Class. No.: QA76.9.F67
Dewey Class. No.: 004.0151
NASA formal methods = 14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24-27, 2022 : proceedings /
LDR
:04893nmm a2200349 a 4500
001
2299979
003
DE-He213
005
20220519124033.0
006
m d
007
cr nn 008maaau
008
230324s2022 sz s 0 eng d
020
$a
9783031067730
$q
(electronic bk.)
020
$a
9783031067723
$q
(paper)
024
7
$a
10.1007/978-3-031-06773-0
$2
doi
035
$a
978-3-031-06773-0
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.9.F67
072
7
$a
UMZ
$2
bicssc
072
7
$a
COM051230
$2
bisacsh
072
7
$a
UMZ
$2
thema
082
0 4
$a
004.0151
$2
23
090
$a
QA76.9.F67
$b
N575 2022
111
2
$a
NFM (Symposium)
$n
(14th :
$d
2022 :
$c
Pasadena, Calif.)
$3
3597973
245
1 0
$a
NASA formal methods
$h
[electronic resource] :
$b
14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24-27, 2022 : proceedings /
$c
edited by Jyotirmoy V. Deshmukh, Klaus Havelund, Ivan Perez.
246
3
$a
NFM 2022
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2022.
300
$a
xxii, 828 p. :
$b
ill. (chiefly col.), digital ;
$c
24 cm.
490
1
$a
Lecture notes in computer science,
$x
0302-9743 ;
$v
13260
505
0
$a
Invited Keynotes -- Formal Methods for Trusted Space Autonomy: Boon or Bane -- An Essence of Domain Engineering - A Basis for Trustworthy Aeronautics and Space Software -- Concept Design Moves -- Automating Program Transformation with Coccinelle -- The Prusti Project: Formal Verification for Rust -- Summers Reachability Analysis for Cyber-Physical Systems: Are we there yet -- Regular Submissions -- Towards Better Test Coverage: Merging Unit Tests for Autonomous Systems -- Quantification of Battery Depletion Risk Made Efficient -- Hierarchical Contract-based Synthesis for Assurance Cases -- Verified Probabilistic Policies for Deep Reinforcement Learning -- NNLander-VeriF: A Neural Network Formal Verification Framework for Vision-Based Autonomous Aircraft Landing -- The Black-Box Simplex Architecture for Runtime Assurance of Autonomous CPS -- Case Studies for Computing Density of Reachable States for Safe Autonomous Motion Planning -- Towards Refactoring FRETish Requirements -- Neural Network Compression of ACAS Xu Early Prototype is Unsafe: Closed-Loop Verification through Quantized State Backreachability -- ZoPE: A Fast Optimizer for ReLU Networks with Low-Dimensional Inputs -- Permutation Invariance of Deep Neural Networks with ReLUs -- Configurable Benchmarks for C Model Checkers -- AssumeGuarantee Reasoning with Scheduled Components -- Stateful Black-Box Fuzzing of Bluetooth Devices Using Automata Learning -- From Verified Scala to STIX File System Embedded Code using Stainless -- On the Termination of Borrow Checking in Featherweight Rust -- Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme -- Zone Extrapolations in Parametric Timed Automata -- Exemplifying Parametric Timed Specifications over Signals with Bounded Behavior -- Timed Automata Learning via SMT Solving -- Asynchronous Composition of Local Interface LTL Properties -- Elucidation and Analysis of Specification Patterns in Aerospace System Telemetry -- Robust Computation Tree Logic -- On the-Fly Model Checking with Neural MCTS -- Checking and Test Generation for Comprehensive Verification -- Operational Annotations: a New Method for Sequential Program Verification -- Byzantine Fault Tolerant Consensus in Agda -- DSV: Disassembly Soundness Validation without Assuming a Ground Truth -- Probabilistic Hyperproperties with Rewards -- Hypercontracts -- Monitorability of Expressive Verdicts -- BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees -- Approximate Translation from Floating-Point to Real-Interval Arithmetic -- Synthesis of Optimal Defenses for System Architecture Design Model in MaxSMT -- Certified Computation of Nondeterministic Limits -- The Power of Disjoint Support Decompositions in Decision Diagrams -- Incremental Transitive Closure for Zonal Abstract Domain -- Proof Mate: an Interactive Proof Helper for PVS -- Runtime Verification Triggers -- Real-time, Autonomous Fault Recovery on the CySat-I.
520
$a
This book constitutes the proceedings of the 14th International Symposium on NASA Formal Methods, NFM 2022, held in Pasadena, USA, during May 24-27, 2022. The 33 full and 6 short papers presented in this volume were carefully reviewed and selected from 118submissions. The volume also contains 6 invited papers. The papers deal with advances in formal methods, formal methods techniques, and formal methods in practice. The focus on topics such as interactive and automated theorem proving; SMT and SAT solving; model checking; use of machine learning and probabilistic reasoning in formal methods; formal methods and graphical modeling languages such as SysML or UML; usability of formal method tools and application in industry, etc.
650
0
$a
Formal methods (Computer science)
$v
Congresses.
$3
622707
650
1 4
$a
Software Engineering.
$3
890874
700
1
$a
Deshmukh, Jyotirmoy.
$3
3503913
700
1
$a
Havelund, Klaus.
$3
1071785
700
1
$a
Perez, Ivan.
$3
3597974
710
2
$a
SpringerLink (Online service)
$3
836513
773
0
$t
Springer Nature eBook
830
0
$a
Lecture notes in computer science ;
$v
13260.
$3
3597975
856
4 0
$u
https://doi.org/10.1007/978-3-031-06773-0
950
$a
Computer Science (SpringerNature-11645)
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9441871
電子資源
11.線上閱覽_V
電子書
EB QA76.9.F67
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入