04023nam 22005895 450 991051218510332120230329235012.03-030-92124-710.1007/978-3-030-92124-8(CKB)5100000000152667(MiAaPQ)EBC6858400(Au-PeEL)EBL6858400(DE-He213)978-3-030-92124-8(PPN)259384933(EXLCZ)99510000000015266720211202d2021 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierSoftware Engineering and Formal Methods 19th International Conference, SEFM 2021, Virtual Event, December 6–10, 2021, Proceedings /edited by Radu Calinescu, Corina S. Păsăreanu1st ed. 2021.Cham :Springer International Publishing :Imprint: Springer,2021.1 online resource (524 pages)Theoretical Computer Science and General Issues,2512-2029 ;130853-030-92123-9 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.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.Theoretical Computer Science and General Issues,2512-2029 ;13085Software engineeringArtificial intelligenceComputer scienceSoftware EngineeringArtificial IntelligenceTheory of ComputationSoftware engineering.Artificial intelligence.Computer science.Software Engineering.Artificial Intelligence.Theory of Computation.005.1Păsăreanu Corina S.Calinescu Radu C.1968-MiAaPQMiAaPQMiAaPQBOOK9910512185103321Software Engineering and Formal Methods2915885UNINA