Del 15394 - Lecture Notes in Computer Science

Formal Methods and Software Engineering

25th International Conference on Formal Engineering Methods, ICFEM 2024, Hiroshima, Japan, December 2–6, 2024, Proceedings

Häftad, Engelska, 2024

Av Kazuhiro Ogata, Dominique Mery, Meng Sun, Shaoying Liu

979 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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

Produktinformation

Utgivningsdatum2024-11-29
Mått155 x 235 x undefined mm
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor410
FörlagSpringer Nature Switzerland AG
ISBN9789819606160

Tillhör följande kategorier

.- 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.