Del i serien Lecture Notes in Computer Science

Software Engineering and Formal Methods

19th International Conference, SEFM 2021, Virtual Event, December 6–10, 2021, Proceedings

Häftad, Engelska, 2021

1 159 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the 19th International Conference on Software Engineering and Formal Methods, SEFM 2021, held as a virtual event, in December 2021.The 22 full papers presented together with 4 short papers were carefully reviewed and selected from 86 submissions. Also included are 2 invited talks and an abstract of a keynote talk. The papers cover a large variety of topics, including testing, formal verification, program analysis, runtime verification, meta-programming and software development and evolution. Chapter 'Configuration Space Exploration for Digital Printing Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Produktinformation

Utgivningsdatum2021-12-03
Mått155 x 235 x 29 mm
Vikt809 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor522
FörlagSpringer Nature Switzerland AG
ISBN9783030921231

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Artificiell intelligens inom Data och IT

Invited Papers.- RoboWorld: Where Can My Robot Work?.- Validating Safety Arguments with Lean.- Run-time Analysis and Testing.- Runtime Enforcement with Reordering, Healing, and Suppression.- Monitoring First-Order Interval Logic.- Exhaustive Property Oriented Model-based Testing With Symbolic Finite State Machines.- nfer - A Tool for Event Stream Abstraction.- Mining Shape Expressions with ShapeIt.- Security and Privacy.- Refining Privacy-Aware Data Flow Diagrams.- Hybrid Information Flow Control for Low-level Code.- Upper Bound Computation of Information Leakages for Unbounded Recursion.- On the Security and Safety of AbU Systems.- Parallel Composition/CSP and Probabilistic Reasoning.- Parallelized sequential composition and hardware weak memory models.- Checking Opacity and Durable Opacity with FDR.- Translation of CCS into CSP, Correct up toStrong Bisimulation.- Probabilistic BDI Agents: Actions, Plans, and Intentions.- A Debugger for Probabilistic Programs.- Verification and Synthesis.- Verification of Programs with Exceptions through Operator-Precedence Automata.- Counterexample Classification.- Be Lazy and Don't Care: Faster CTL Model Checking for Recursive State Machines.- Fairness, Assumptions, and Guarantees for Extended Bounded Response LTL synthesis.- TACoS: A Tool for MTL Controller Synthesis.- Emerging Domains.- Lightweight Nontermination Inference with CHCs.- A Denotational Semantics of Solidity in Isabelle/HOL.- Configuration Space Exploration for Digital Printing Systems.- Bit-precise Verification of Discontinuity Errors Under Fixed-point Arithmetic.- Machine Learning and Cyber-Physical Systems.- OSIP: Tightened Bound Propagation for the Verification of ReLU Neural Networks.- Active Model Learning of Stochastic Reactive Systems.- Mixed-Neighborhood, Multi-Speed Cellular Automata for Safety-Aware Pedestrian Prediction.