Atjaunināt sīkdatņu piekrišanu

Formal Methods and Software Engineering: 25th International Conference on Formal Engineering Methods, ICFEM 2024, Hiroshima, Japan, December 26, 2024, Proceedings [Mīkstie vāki]

Edited by , Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 410 pages, height x width: 235x155 mm, 70 Illustrations, color; 33 Illustrations, black and white; XII, 410 p. 103 illus., 70 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 15394
  • Izdošanas datums: 29-Nov-2024
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 9819606160
  • ISBN-13: 9789819606160
  • Mīkstie vāki
  • Cena: 61,19 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 71,99 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 410 pages, height x width: 235x155 mm, 70 Illustrations, color; 33 Illustrations, black and white; XII, 410 p. 103 illus., 70 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 15394
  • Izdošanas datums: 29-Nov-2024
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 9819606160
  • ISBN-13: 9789819606160
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
.- 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.