000 04255nam a22005535i 4500
001 978-3-030-92124-8
003 DE-He213
005 20240730180934.0
007 cr nn 008mamaa
008 211202s2021 sz | s |||| 0|eng d
020 _a9783030921248
_9978-3-030-92124-8
024 7 _a10.1007/978-3-030-92124-8
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aSoftware Engineering and Formal Methods
_h[electronic resource] :
_b19th International Conference, SEFM 2021, Virtual Event, December 6-10, 2021, Proceedings /
_cedited by Radu Calinescu, Corina S. Păsăreanu.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXV, 522 p. 146 illus., 68 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v13085
505 0 _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.
520 _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.
650 0 _aSoftware engineering.
_94138
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science.
_99832
650 1 4 _aSoftware Engineering.
_94138
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aTheory of Computation.
_9122614
700 1 _aCalinescu, Radu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122615
700 1 _aPăsăreanu, Corina S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9122616
710 2 _aSpringerLink (Online service)
_9122617
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030921231
776 0 8 _iPrinted edition:
_z9783030921255
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v13085
_9122618
856 4 0 _uhttps://doi.org/10.1007/978-3-030-92124-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c90597
_d90597