東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Software engineering and formal meth...

International Conference on Software Engineering and Formal Methods (2021 :)

FindBook

Google Book

Amazon

博客來

Software engineering and formal methods = 19th International Conference, SEFM 2021, virtual event, December 6-10, 2021 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Software engineering and formal methods/ edited by Radu Calinescu, Corina S. Pasareanu.
其他題名:	19th International Conference, SEFM 2021, virtual event, December 6-10, 2021 : proceedings /
其他題名:	SEFM 2021
其他作者:	Calinescu, Radu.
團體作者:	International Conference on Software Engineering and Formal Methods
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xv, 522 p. :ill. (some col.), digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Software engineering - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-92124-8
ISBN:	9783030921248

Software engineering and formal methods = 19th International Conference, SEFM 2021, virtual event, December 6-10, 2021 : proceedings /
Software engineering and formal methods19th International Conference, SEFM 2021, virtual event, December 6-10, 2021 : proceedings /[electronic resource] :SEFM 2021edited by Radu Calinescu, Corina S. Pasareanu. - Cham :Springer International Publishing :2021. - xv, 522 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,130850302-9743 ;. - Lecture notes in computer science ;13085..

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.

ISBN: 9783030921248

Standard No.: 10.1007/978-3-030-92124-8doiSubjects--Topical Terms:

696781
Software engineering
--Congresses.

LC Class. No.: QA76.758 / .I57 2021

Dewey Class. No.: 005.1

Software engineering and formal methods = 19th International Conference, SEFM 2021, virtual event, December 6-10, 2021 : proceedings /
LDR:03332nmm 22003615a 4500 001 2258788
003 DE-He213
005 20211202173351.0
006 m d
007 cr nn 008maaau
008 220422s2021 sz s 0 eng d
020 $a 9783030921248 $q (electronic bk.)
020 $a 9783030921231 $q (paper)
024 7 $a 10.1007/978-3-030-92124-8 $2 doi
035 $a 978-3-030-92124-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.758 $b .I57 2021
072 7 $a UMZ $2 bicssc
072 7 $a COM051230 $2 bisacsh
072 7 $a UMZ $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.758 $b .I61 2021
111 2 $a International Conference on Software Engineering and Formal Methods $n (19th : $d 2021 : $c Online) $3 3531587
245 1 0 $a Software engineering and formal methods $h [electronic resource] : $b 19th International Conference, SEFM 2021, virtual event, December 6-10, 2021 : proceedings / $c edited by Radu Calinescu, Corina S. Pasareanu.
246 3 $a SEFM 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xv, 522 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13085
490 1 $a Theoretical computer science and general issues
505 0 $a 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.
520 $a 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.
650 0 $a Software engineering $x Congresses. $3 696781
650 0 $a Formal methods (Computer science) $v Congresses. $3 622707
650 1 4 $a Software Engineering. $3 890874
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Theory of Computation. $3 892514
700 1 $a Calinescu, Radu. $3 1620956
700 1 $a Pasareanu, Corina S. $3 2157672
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13085. $3 3531588
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-92124-8
950 $a Computer Science (SpringerNature-11645)