國立高雄大學圖資館 |

Language: English

Back

Formal methods25th international symposium, FM 2023, Lubeck, Germany, March 6-10, 2023 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Formal methodsedited by Marsha Chechik, Joost-Pieter Katoen, Martin Leucker.
Reminder of title:	25th international symposium, FM 2023, Lubeck, Germany, March 6-10, 2023 : proceedings /
other author:	Chechik, Marsha.
corporate name:
Published:	Cham :Springer International Publishing :2023.
Description:	xvi, 659 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Formal methods (Computer science)
Online resource:	https://doi.org/10.1007/978-3-031-27481-7
ISBN:	9783031274817$q(electronic bk.)

Formal methods25th international symposium, FM 2023, Lubeck, Germany, March 6-10, 2023 : proceedings /
Formal methods25th international symposium, FM 2023, Lubeck, Germany, March 6-10, 2023 : proceedings /[electronic resource] :edited by Marsha Chechik, Joost-Pieter Katoen, Martin Leucker. - Cham :Springer International Publishing :2023. - xvi, 659 p. :ill., digital ;24 cm. - Lecture notes in computer science,140000302-9743 ;. - Lecture notes in computer science ;4891..

Keynotes -- Symbolic Computation in Automated Program Reasoning -- The next big thing: from embedded systems to embodied actors -- Intelligent and Dependable Decision-Making Under Uncertainty -- A Coq formalization of Lebesgue Induction Principle and Tonelli's Theorem -- SAT/SMT -- Railway Scheduling Using Boolean Satisfiability Modulo Simulations -- SMT Sampling via Model-Guided Approximation -- Efficient SMT-based Network Fault Tolerance Verification -- Verification I -- Formalising the Prevention of Microarchitectural Timing Channels by Operating Systems -- Can we Communicate? Using Dynamic Logic to Verify Team Automata -- The ScalaFix equation solver -- HHLPy: Practical Verification of Hybrid Systems using Hoare Logic -- Quantitative Verification -- symQV: Automated Symbolic Verification of Quantum Programs -- PFL: a Probabilistic Logic for Fault Trees -- Energy Buechi Problems -- QMaude: quantitative specification and verification in rewriting logic -- Concurrency and Memory Models -- Minimisation of Spatial Models using Branching Bisimilarity -- Reasoning about Promises in Weak Memory Models with Event Structures -- A fine-grained semantics for arrays and pointers under weak memory models -- VeyMont: Parallelising Verified Programs instead of Verifying Parallel Programs -- Verification 2 -- Verifying At the Level of Java Bytecode -- Abstract Alloy Instances -- Monitoring the Internet Computer -- Word Equations in Synergy with Regular Constraints -- Formal Methods in AI -- Verifying Feedforward Neural Networks for Classification in Isabelle/HOL -- SMPT: A Testbed for Reachabilty Methods in Generalized Petri Nets -- The Octatope Abstract Domain for Verification of Neural Networks -- Program Semantics and Verification Technique for AI-centred Programs -- Safety and Reliability -- Tableaux for Realizability of Safety Specifications -- A Decision Diagram Operation for Reachability -- Formal Modelling of Safety Architecture for Responsibility-Aware Autonomous Vehicle via Event-B Refinement -- A Runtime Environment for Contract Automata -- Industry Day -- Formal and Executable Semantics of the Ethereum Virtual Machine in Dafny -- Shifting Left for Early Detection of Machine-Learning Bugs -- A Systematic Approach to Automotive Security -- Specification-Guided Critical Scenario Identification for Automated Driving -- Runtime Monitoring for Out-of-Distribution Detection in Object Detection Neural Networks -- Backdoor Mitigation in Deep Neural Networks via Strategic Retraining -- veriFIRE: Verifying an Industrial, Learning-Based Wildfire Detection System.

This book constitutes the refereed proceedings of the 25th International Symposium on Formal Methods, FM 2023, which took place in Lübeck, Germany, in March 2023. The 26 full paper, 2 short papers included in this book were carefully reviewed and selected rom 95 submissions. They have been organized in topical sections as follows: SAT/SMT; Verification; Quantitative Verification; Concurrency and Memory Models; Formal Methods in AI; Safety and Reliability. The proceedings also contain 3 keynote talks and 7 papers from the industry day.

ISBN: 9783031274817$q(electronic bk.)

Standard No.: 10.1007/978-3-031-27481-7doiSubjects--Topical Terms:

277520
Formal methods (Computer science)

LC Class. No.: QA76.9.F67

Dewey Class. No.: 004.0151

Formal methods25th international symposium, FM 2023, Lubeck, Germany, March 6-10, 2023 : proceedings /
LDR:04271nmm a2200337 a 4500 001 639854
003 DE-He213
005 20230302141019.0
006 m d
007 cr nn 008maaau
008 231025s2023 sz s 0 eng d
020 $a 9783031274817$q(electronic bk.)
020 $a 9783031274800$q(paper)
024 7 $a 10.1007/978-3-031-27481-7 $2 doi
035 $a 978-3-031-27481-7
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 I61 2023
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Formal methods $h [electronic resource] : $b 25th international symposium, FM 2023, Lubeck, Germany, March 6-10, 2023 : proceedings / $c edited by Marsha Chechik, Joost-Pieter Katoen, Martin Leucker.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2023.
300 $a xvi, 659 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 14000
505 0 $a Keynotes -- Symbolic Computation in Automated Program Reasoning -- The next big thing: from embedded systems to embodied actors -- Intelligent and Dependable Decision-Making Under Uncertainty -- A Coq formalization of Lebesgue Induction Principle and Tonelli's Theorem -- SAT/SMT -- Railway Scheduling Using Boolean Satisfiability Modulo Simulations -- SMT Sampling via Model-Guided Approximation -- Efficient SMT-based Network Fault Tolerance Verification -- Verification I -- Formalising the Prevention of Microarchitectural Timing Channels by Operating Systems -- Can we Communicate? Using Dynamic Logic to Verify Team Automata -- The ScalaFix equation solver -- HHLPy: Practical Verification of Hybrid Systems using Hoare Logic -- Quantitative Verification -- symQV: Automated Symbolic Verification of Quantum Programs -- PFL: a Probabilistic Logic for Fault Trees -- Energy Buechi Problems -- QMaude: quantitative specification and verification in rewriting logic -- Concurrency and Memory Models -- Minimisation of Spatial Models using Branching Bisimilarity -- Reasoning about Promises in Weak Memory Models with Event Structures -- A fine-grained semantics for arrays and pointers under weak memory models -- VeyMont: Parallelising Verified Programs instead of Verifying Parallel Programs -- Verification 2 -- Verifying At the Level of Java Bytecode -- Abstract Alloy Instances -- Monitoring the Internet Computer -- Word Equations in Synergy with Regular Constraints -- Formal Methods in AI -- Verifying Feedforward Neural Networks for Classification in Isabelle/HOL -- SMPT: A Testbed for Reachabilty Methods in Generalized Petri Nets -- The Octatope Abstract Domain for Verification of Neural Networks -- Program Semantics and Verification Technique for AI-centred Programs -- Safety and Reliability -- Tableaux for Realizability of Safety Specifications -- A Decision Diagram Operation for Reachability -- Formal Modelling of Safety Architecture for Responsibility-Aware Autonomous Vehicle via Event-B Refinement -- A Runtime Environment for Contract Automata -- Industry Day -- Formal and Executable Semantics of the Ethereum Virtual Machine in Dafny -- Shifting Left for Early Detection of Machine-Learning Bugs -- A Systematic Approach to Automotive Security -- Specification-Guided Critical Scenario Identification for Automated Driving -- Runtime Monitoring for Out-of-Distribution Detection in Object Detection Neural Networks -- Backdoor Mitigation in Deep Neural Networks via Strategic Retraining -- veriFIRE: Verifying an Industrial, Learning-Based Wildfire Detection System.
520 $a This book constitutes the refereed proceedings of the 25th International Symposium on Formal Methods, FM 2023, which took place in Lübeck, Germany, in March 2023. The 26 full paper, 2 short papers included in this book were carefully reviewed and selected rom 95 submissions. They have been organized in topical sections as follows: SAT/SMT; Verification; Quantitative Verification; Concurrency and Memory Models; Formal Methods in AI; Safety and Reliability. The proceedings also contain 3 keynote talks and 7 papers from the industry day.
650 0 $a Formal methods (Computer science) $3 277520
650 1 4 $a Software Engineering. $3 274511
650 2 4 $a Computer Science Logic and Foundations of Programming. $3 913141
650 2 4 $a Special Purpose and Application-Based Systems. $3 274487
650 2 4 $a Programming Language. $3 913494
650 2 4 $a Control Structures and Microprogramming. $3 274663
650 2 4 $a Natural Language Processing (NLP) $3 826373
700 1 $a Chechik, Marsha. $3 286435
700 1 $a Katoen, Joost-Pieter. $3 308078
700 1 $a Leucker, Martin. $3 376038
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-27481-7
950 $a Computer Science (SpringerNature-11645)