LEADER 04023nam 22005895 450 001 9910512185103321 005 20230329235012.0 010 $a3-030-92124-7 024 7 $a10.1007/978-3-030-92124-8 035 $a(CKB)5100000000152667 035 $a(MiAaPQ)EBC6858400 035 $a(Au-PeEL)EBL6858400 035 $a(DE-He213)978-3-030-92124-8 035 $a(PPN)259384933 035 $a(EXLCZ)995100000000152667 100 $a20211202d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aSoftware Engineering and Formal Methods $e19th International Conference, SEFM 2021, Virtual Event, December 6?10, 2021, Proceedings /$fedited by Radu Calinescu, Corina S. P?s?reanu 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (524 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13085 311 $a3-030-92123-9 327 $aInvited 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. 330 $aChapter 'Configuration Space Exploration for Digital Printing Systems' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v13085 606 $aSoftware engineering 606 $aArtificial intelligence 606 $aComputer science 606 $aSoftware Engineering 606 $aArtificial Intelligence 606 $aTheory of Computation 615 0$aSoftware engineering. 615 0$aArtificial intelligence. 615 0$aComputer science. 615 14$aSoftware Engineering. 615 24$aArtificial Intelligence. 615 24$aTheory of Computation. 676 $a005.1 702 $aPa?sa?reanu$b Corina S. 702 $aCalinescu$b Radu C.$f1968- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910512185103321 996 $aSoftware Engineering and Formal Methods$92915885 997 $aUNINA