Formal Methods and Software Engineering
25th International Conference on Formal Engineering Methods, ICFEM 2024, Hiroshima, Japan, December 2-6, 2024, Proceedings
Herausgegeben:Ogata, Kazuhiro; Mery, Dominique; Sun, Meng; Liu, Shaoying
Formal Methods and Software Engineering
25th International Conference on Formal Engineering Methods, ICFEM 2024, Hiroshima, Japan, December 2-6, 2024, Proceedings
Herausgegeben:Ogata, Kazuhiro; Mery, Dominique; Sun, Meng; Liu, Shaoying
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This volume LNCS 15394 constitutes the refereed proceedings of 25th International Conference on Formal Engineering Methods, ICFEM 2024, in Hiroshima, Japan, in December 2024.
The 22 full papers presented were carefully reviewed and selected from 50 submissions. The conference focuses on wide range of research areas, covering both theoretical foundations and practical applications of formal engineering methods
Andere Kunden interessierten sich auch für
Formal Methods and Software Engineering49,99 €
Formal Methods and Software Engineering38,99 €
Formal Methods and Software Engineering38,99 €
Formal Methods: Foundations and Applications42,99 €
Software Verification42,99 €
Structured Object-Oriented Formal Language and Method38,99 €
A Journey from Process Algebra via Timed Automata to Model Learning38,99 €-
-
-
This volume LNCS 15394 constitutes the refereed proceedings of 25th International Conference on Formal Engineering Methods, ICFEM 2024, in Hiroshima, Japan, in December 2024.
The 22 full papers presented were carefully reviewed and selected from 50 submissions. The conference focuses on wide range of research areas, covering both theoretical foundations and practical applications of formal engineering methods
The 22 full papers presented were carefully reviewed and selected from 50 submissions. The conference focuses on wide range of research areas, covering both theoretical foundations and practical applications of formal engineering methods
Produktdetails
- Produktdetails
- Lecture Notes in Computer Science 15394
- Verlag: Springer / Springer Nature Singapore / Springer, Berlin
- Artikelnr. des Verlages: 978-981-96-0616-0
- Seitenzahl: 424
- Erscheinungstermin: 29. November 2024
- Englisch
- Abmessung: 235mm x 155mm x 23mm
- Gewicht: 639g
- ISBN-13: 9789819606160
- ISBN-10: 9819606160
- Artikelnr.: 71931114
- Herstellerkennzeichnung
- Springer-Verlag GmbH
- Tiergartenstr. 17
- 69121 Heidelberg
- ProductSafety@springernature.com
- Lecture Notes in Computer Science 15394
- Verlag: Springer / Springer Nature Singapore / Springer, Berlin
- Artikelnr. des Verlages: 978-981-96-0616-0
- Seitenzahl: 424
- Erscheinungstermin: 29. November 2024
- Englisch
- Abmessung: 235mm x 155mm x 23mm
- Gewicht: 639g
- ISBN-13: 9789819606160
- ISBN-10: 9819606160
- Artikelnr.: 71931114
- Herstellerkennzeichnung
- Springer-Verlag GmbH
- Tiergartenstr. 17
- 69121 Heidelberg
- ProductSafety@springernature.com
.- NL2CTL: Automatic Generation of Formal Requirements Specifications via Large Language Models.
.- Repairing Event-B Models through Quantifier Elimination.
.- Tuning Trains Speed in Railway Scheduling.
.- The Bright Side of Timed Opacity.
.- Clock-Dependent Probabilistic Timed Automata with One Clock and No Memory.
.- Efficient State Estimation of Discrete-Timed Automata.
.- LRNN: A Formal Logic Rules-Based Neural Network for Software Defect Prediction.
.- Quantitative Symbolic Robustness Verification for Quantized Neural Networks.
.- Graph Convolutional Network Robustness Verification Algorithm Based on Dual Approximation.
.- Formal Kinematic Analysis of Epicyclic Bevel Gear Trains.
.- Deciding the synthesis problem for hybrid games through bisimulation.
.- Formal Analysis of FreeRTOS Scheduler on ARM Cortex-M4 Cores.
.- Differential Property Monitoring for Backdoor Detection.
.- MemSpate: Memory Usage Protocol Guided Fuzzing.
.- The Continuum Hypothesis Implies the Existence of Non-Principal Arithmetical Ultrafilters - A Coq Formal Verification.
.- Observability of Boolean Control Networks: New Definition and Verification Algorithm.
.- Formalizing Potential Flows using the HOL Light Theorem Prover.
.- On-the-Fly Proof-Based Verification of Reachability in Autonomous Vehicle Controllers Relying on Goal-Aware RSS.
.- Efficient SMT-Based Model Checking for HyperTWTL.
.- A Tableau-based Approach to Model Checking Linear Temporal Properties.
.- Simple LTL Model Checking on Finite and Infinite Traces over Concrete Domains.
.- Model Checking Concurrency in Smart Contracts with a Case Study of Safe Remote Purchase.
.- Repairing Event-B Models through Quantifier Elimination.
.- Tuning Trains Speed in Railway Scheduling.
.- The Bright Side of Timed Opacity.
.- Clock-Dependent Probabilistic Timed Automata with One Clock and No Memory.
.- Efficient State Estimation of Discrete-Timed Automata.
.- LRNN: A Formal Logic Rules-Based Neural Network for Software Defect Prediction.
.- Quantitative Symbolic Robustness Verification for Quantized Neural Networks.
.- Graph Convolutional Network Robustness Verification Algorithm Based on Dual Approximation.
.- Formal Kinematic Analysis of Epicyclic Bevel Gear Trains.
.- Deciding the synthesis problem for hybrid games through bisimulation.
.- Formal Analysis of FreeRTOS Scheduler on ARM Cortex-M4 Cores.
.- Differential Property Monitoring for Backdoor Detection.
.- MemSpate: Memory Usage Protocol Guided Fuzzing.
.- The Continuum Hypothesis Implies the Existence of Non-Principal Arithmetical Ultrafilters - A Coq Formal Verification.
.- Observability of Boolean Control Networks: New Definition and Verification Algorithm.
.- Formalizing Potential Flows using the HOL Light Theorem Prover.
.- On-the-Fly Proof-Based Verification of Reachability in Autonomous Vehicle Controllers Relying on Goal-Aware RSS.
.- Efficient SMT-Based Model Checking for HyperTWTL.
.- A Tableau-based Approach to Model Checking Linear Temporal Properties.
.- Simple LTL Model Checking on Finite and Infinite Traces over Concrete Domains.
.- Model Checking Concurrency in Smart Contracts with a Case Study of Safe Remote Purchase.
.- NL2CTL: Automatic Generation of Formal Requirements Specifications via Large Language Models.
.- Repairing Event-B Models through Quantifier Elimination.
.- Tuning Trains Speed in Railway Scheduling.
.- The Bright Side of Timed Opacity.
.- Clock-Dependent Probabilistic Timed Automata with One Clock and No Memory.
.- Efficient State Estimation of Discrete-Timed Automata.
.- LRNN: A Formal Logic Rules-Based Neural Network for Software Defect Prediction.
.- Quantitative Symbolic Robustness Verification for Quantized Neural Networks.
.- Graph Convolutional Network Robustness Verification Algorithm Based on Dual Approximation.
.- Formal Kinematic Analysis of Epicyclic Bevel Gear Trains.
.- Deciding the synthesis problem for hybrid games through bisimulation.
.- Formal Analysis of FreeRTOS Scheduler on ARM Cortex-M4 Cores.
.- Differential Property Monitoring for Backdoor Detection.
.- MemSpate: Memory Usage Protocol Guided Fuzzing.
.- The Continuum Hypothesis Implies the Existence of Non-Principal Arithmetical Ultrafilters - A Coq Formal Verification.
.- Observability of Boolean Control Networks: New Definition and Verification Algorithm.
.- Formalizing Potential Flows using the HOL Light Theorem Prover.
.- On-the-Fly Proof-Based Verification of Reachability in Autonomous Vehicle Controllers Relying on Goal-Aware RSS.
.- Efficient SMT-Based Model Checking for HyperTWTL.
.- A Tableau-based Approach to Model Checking Linear Temporal Properties.
.- Simple LTL Model Checking on Finite and Infinite Traces over Concrete Domains.
.- Model Checking Concurrency in Smart Contracts with a Case Study of Safe Remote Purchase.
.- Repairing Event-B Models through Quantifier Elimination.
.- Tuning Trains Speed in Railway Scheduling.
.- The Bright Side of Timed Opacity.
.- Clock-Dependent Probabilistic Timed Automata with One Clock and No Memory.
.- Efficient State Estimation of Discrete-Timed Automata.
.- LRNN: A Formal Logic Rules-Based Neural Network for Software Defect Prediction.
.- Quantitative Symbolic Robustness Verification for Quantized Neural Networks.
.- Graph Convolutional Network Robustness Verification Algorithm Based on Dual Approximation.
.- Formal Kinematic Analysis of Epicyclic Bevel Gear Trains.
.- Deciding the synthesis problem for hybrid games through bisimulation.
.- Formal Analysis of FreeRTOS Scheduler on ARM Cortex-M4 Cores.
.- Differential Property Monitoring for Backdoor Detection.
.- MemSpate: Memory Usage Protocol Guided Fuzzing.
.- The Continuum Hypothesis Implies the Existence of Non-Principal Arithmetical Ultrafilters - A Coq Formal Verification.
.- Observability of Boolean Control Networks: New Definition and Verification Algorithm.
.- Formalizing Potential Flows using the HOL Light Theorem Prover.
.- On-the-Fly Proof-Based Verification of Reachability in Autonomous Vehicle Controllers Relying on Goal-Aware RSS.
.- Efficient SMT-Based Model Checking for HyperTWTL.
.- A Tableau-based Approach to Model Checking Linear Temporal Properties.
.- Simple LTL Model Checking on Finite and Infinite Traces over Concrete Domains.
.- Model Checking Concurrency in Smart Contracts with a Case Study of Safe Remote Purchase.







