检索结果-内蒙古大学图书馆

54th IEEE Frontiers in Education Conference, FIE 2024

作者： Läufer, Konstantin Mertin, Gunda Thiruvathukal, George K. Loyola University Software and Systems Laboratory Department of Computer Science Chicago United States Institute for Software Engineering and Programming Languages University of Lübeck Germany

ISBN: (纸本)9798350351507

Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions (TLA+), into computer science education, targeting undergraduate juniors/seniors and graduate students. Many safety-critical systems and services crucially depend on correct and reliable behavior. Formal methods can play a key role in ensuring correct and safe system behavior, yet remain underutilized in educational and industry contexts. Aims: We aim to (1) qualitatively assess the state of formal methods in computer science programs, (2) construct level-appropriate examples that could be included midway into one's undergraduate studies, (3) demonstrate how to address successive 'failuresy' through progressively stringent safety and liveness requirements, and (4) establish an ongoing framework for assessing interest and relevance among students. Methods: We detail our pedagogical strategy for embedding TLA+ into an intermediate course on formal methods at our institution. After starting with a refresher on mathematical logic, students specify the rules of simple puzzles in TLA+ and use its included model checker (known as TLC) to find a solution. We gradually escalate to more complex, dynamic, event-driven systems, such as the control logic of a microwave oven, where students will study safety and liveness requirements. We subsequently discuss explicit concurrency, along with thread safety and deadlock avoidance, by modeling bounded counters and buffers. Results: Our initial findings suggest that through careful curricular design and choice of examples and tools, it is possible to inspire and cultivate a new generation of software engineers proficient in formal methods. Conclusions: Our initial efforts suggest that 84% of our students had a positive experience in our formal methods course. Our future plans include a longitudinal analysis within our own institution and

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Functorial String Diagrams for Reverse-Mode Automatic Differentiation 31

Functorial String Diagrams for Reverse-Mode Automatic Differ...

引用

31st EACSL Annual Conference on computer Science Logic, CSL 2023

作者： Alvarez-Picallo, Mario Ghica, Dan Sprunger, David Zanasi, Fabio Programming Languages Laboratory Huawei Research Centre Cambridge United Kingdom Department of Computer Science University of Birmingham United Kingdom Department of Computer Science University College London United Kingdom

ISBN: (纸本)9783959772648

We formulate a reverse-mode automatic differentiation (RAD) algorithm for (applied) simply typed lambda calculus in the style of Pearlmutter and Siskind [27], using the graphical formalism of string diagrams. Thanks to string diagram rewriting, we are able to formally prove for the first time the soundness of such an algorithm. Our approach requires developing a calculus of string diagrams with hierarchical features in the spirit of functorial boxes, in order to model closed monoidal (and cartesian closed) structure. To give an efficient yet principled implementation of the RAD algorithm, we use foliations of our hierarchical string diagrams. © Mario Alvarez-Picallo, Dan Ghica, David Sprunger, and Fabio Zanasi.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

Rewriting for Monoidal Closed Categories 7

Rewriting for Monoidal Closed Categories

引用

7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022

作者： Alvarez-Picallo, Mario Ghica, Dan Sprunger, David Zanasi, Fabio Programming Languages Laboratory Huawei Research Centre United Kingdom Department of Computer Science University of Birmingham United Kingdom Programming Languages Laboratory Huawei Research Centre Reading United Kingdom Department of Computer Science University College London United Kingdom

ISBN: (纸本)9783959772334

This paper develops a formal string diagram language for monoidal closed categories. Previous work has shown that string diagrams for freely generated symmetric monoidal categories can be viewed as hypergraphs with interfaces, and the axioms of these categories can be realized by rewriting systems. This work proposes hierarchical hypergraphs as a suitable formalization of string diagrams for monoidal closed categories. We then show double pushout rewriting captures the axioms of these closed categories. © Mario Alvarez-Picallo, Dan Ghica, David Sprunger, and Fabio Zanasi

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Object Specialization to Partially Reduce Polymorphism of Attributes 23

Object Specialization to Partially Reduce Polymorphism of At...

引用

Proceedings of the 2023 7th International Conference on computer Science and Artificial Intelligence

作者： Alena Vasileva Yegor Bugayenko Faculty of Computer Science HSE University Russia System Programming Laboratory Huawei RRI Russia

ISBN: (纸本)9798400708688

In object-oriented programming languages, objects with polymorphic attributes can negatively impact performance and hinder static analysis. These attributes require dynamic dispatch, which is slower than static binding, and complicate the analysis process. We propose a novel algorithm for object specialization that addresses this issue by replacing polymorphic attributes with monomorphic ones, resulting in improved performance and simplified static analysis. Our algorithm is a new approach compared to existing function specialization algorithms. We provide a proof of the algorithm’s soundness and correctness, and present an implementation of the algorithm as a software tool. Empirical evaluation shows that our approach achieves significant improvements in performance and simplifies the static analysis process. Our algorithm can be applied to a variety of object-oriented languages such as Java and Python.

关键词： Object-Oriented programming Polymorphism Specialization

来源：评论

学校读者我要写书评

暂无评论

Optimizations and Deoptimizations for Escape Analysis in Open World

引用

Chinese Journal of Electronics 2023年第2期19卷 211-216页

作者： Xiaohua Shi Gansha Wu Jin Maozhong Guei-Yuan Lueh School of Computer Science Beihang University Beijing China Programming System Laboratory Microprocessor Technology Labs Intel Corporation Beijing China

This paper introduced the optimization and deoptimization technologies for Escape analysis in open world. These technologies are used in a novel Escape analysis framework that has been implemented in Open runtime platform, Intel's open-source Java virtual machine. We introduced the optimization technologies for synchronization removal and object stack allocation, as well as the runtime deoptimization and compensation work. The deoptimization and compensation technologies are crucial for a practical Escape analysis in open world. We evaluated the runtime efficiency of the deoptimization and compensation work on benchmarks like SPECjbb2000 and SPECjvm98.

关键词： Java Runtime Education Medical services Benchmark testing Virtual machining Synchronization

来源：评论

学校读者我要写书评

暂无评论

WIP: An Engaging Undergraduate Intro to Model Checking in Software Engineering Using TLA+

WIP: An Engaging Undergraduate Intro to Model Checking in So...

引用

Frontiers in Education (FIE) Conference

作者： Konstantin Läufer Gunda Mertin George K. Thiruvathukal Department of Computer Science Software and Systems Laboratory Loyola University Chicago Institute for Software Engineering and Programming Languages University of Lübeck

ISBN: (数字)9798350351507

ISBN: (纸本)9798350363067

Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions $(\text{TLA}^{+})$ , into computer science education, targeting undergraduate juniors/seniors and graduate students. Many safety-critical systems and services crucially depend on correct and reliable behavior. Formal methods can play a key role in ensuring correct and safe system behavior, yet remain underutilized in educational and industry contexts. Aims: We aim to (1) qualitatively assess the state of formal methods in computer science programs, (2) construct level-appropriate examples that could be included midway into one's undergraduate studies, (3) demonstrate how to address successive “failuresy” through progressively stringent safety and liveness requirements, and (4) establish an ongoing framework for assessing interest and relevance among students. Methods: We detail our pedagogical strategy for embedding $\text { TLA }^{+}$ into an intermediate course on formal methods at our institution. After starting with a refresher on mathematical logic, students specify the rules of simple puzzles in $\text { TLA }^{+}$ and use its included model checker (known as TLC) to find a solution. We gradually escalate to more complex, dynamic, event-driven systems, such as the control logic of a microwave oven, where students will study safety and liveness requirements. We subsequently discuss explicit concurrency, along with thread safety and deadlock avoidance, by modeling bounded counters and buffers. Results: Our initial findings suggest that through careful curricular design and choice of examples and tools, it is possible to inspire and cultivate a new generation of software engineers proficient in formal methods. Conclusions: Our initial efforts suggest that 84% of our students had a positive experience in our formal methods course. Our future plans include a longitudi

关键词： computer science Open Access Model checking System recovery Software Safety Logic Reliability Proposals Software engineering

来源：评论

学校读者我要写书评

暂无评论

Video-Based Real-Time Heart Rate Detection for Drivers Inside the Cabin Using a Smartphone

Video-Based Real-Time Heart Rate Detection for Drivers Insid...

引用

2022 IEEE International Conference on Internet of Things and Intelligence Systems, IoTaIS 2022

作者： Othman, Walaa Kashevnik, Alexey Itmo University Information Technology and Programming Faculty St. Petersburg Russia Laboratory of Computer-aided Integrated Systems Spc Ras St. Petersburg Russia

ISBN: (数字)9798350396454

ISBN: (纸本)9798350396454

Developing vehicles with the Internet of Thing technology including driver health monitoring systems, driver safety systems, and accident prevention has drawn the attention of researchers in the last few years. The monitoring system should prevent any dangerous situation and be comfortable for the driver inside the cabin. In this paper, we introduce a remote video-based method for detecting the heart rate in real-time using smartphone cameras, which can be used for the analysis of the driver's physiological parameters to enhance driving safety. We propose to use 3DDFA for automatic facial landmarks detection to extract the driver's face and a 3d-classification-based model for detecting the heart rate. The experiments showed good results with mean absolute error (MAE) equal to 6.8 on the LGI-PPGI dataset and 18.68 on our DriverMVT dataset that was recorded in the wild. © 2022 IEEE.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

Simulating Structural Plasticity of the Brain more Scalable than Expected

arXiv

引用

arXiv 2022年

作者： Czappa, Fabian Geiß, Alexander Wolf, Felix Laboratory for Parallel Programming Department of Computer Science Technical University of Darmstadt Germany

Structural plasticity of the brain describes the creation of new and the deletion of old synapses over time. Rinke et al. (JPDC 2018) introduced a scalable algorithm that simulates structural plasticity for up to one billion neurons on current hardware using a variant of the Barnes–Hut algorithm. They demonstrate good scalability and prove a runtime complexity of O(n log2 n). In this comment paper, we show that with careful consideration of the algorithm and a rigorous proof, the theoretical runtime can even be classified as O(n log n). © 2022, CC BY-NC-ND.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WIP: An Engaging Undergraduate Intro to Model Checking in Software Engineering Using TLA+

arXiv

引用

arXiv 2024年

作者： Läufer, Konstantin Mertin, Gunda Thiruvathukal, George K. Software and Systems Laboratory Department of Computer Science Loyola University Chicago United States Institute for Software Engineering and Programming Languages University of Lübeck Germany

Background: In this Innovative Practice Work in Progress, we present our initial efforts to integrate formal methods, with a focus on model-checking specifications written in Temporal Logic of Actions (TLA+), into computer science education, targeting undergraduate juniors/seniors and graduate students. Many safety-critical systems and services crucially depend on correct and reliable behavior. Formal methods can play a key role in ensuring correct and safe system behavior, yet remain underutilized in educational and industry contexts. Aims: We aim to (1) qualitatively assess the state of formal methods in computer science programs, (2) construct level-appropriate examples that could be included midway into one’s undergraduate studies, (3) demonstrate how to address successive "failures" through progressively stringent safety and liveness requirements, and (4) establish an ongoing framework for assessing interest and relevance among students. Methods: We detail our pedagogical strategy for embedding TLA+ into an intermediate course on formal methods at our institution. After starting with a refresher on mathematical logic, students specify the rules of simple puzzles in TLA+ and use its included model checker (known as TLC) to find a solution. We gradually escalate to more complex, dynamic, event-driven systems, such as the control logic of a microwave oven, where students will study safety and liveness requirements. We subsequently discuss explicit concurrency, along with thread safety and deadlock avoidance, by modeling bounded counters and buffers. Results: Our initial findings suggest that through careful curricular design and choice of examples and tools, it is possible to inspire and cultivate a new generation of software engineers proficient in formal methods. Conclusions: Our initial efforts suggest that 84% of our students had a positive experience in our formal methods course. Our future plans include a longitudinal analysis within our own institution and

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers

arXiv

引用

arXiv 2022年

作者： Daggitt, Matthew L. Kokke, Wen Atkey, Robert Arnaboldi, Luca Komendantskya, Ekaterina Department of Computer Science Heriot-Watt University Edinburgh United Kingdom Mathematically Structured Programming Group University of Strathclyde Glasgow United Kingdom Laboratory for Foundations of Computer Science University of Edinburgh Edinburgh United Kingdom

Verification of neural networks is currently a hot topic in automated theorem proving. Progress has been rapid and there are now a wide range of tools available that can verify properties of networks with hundreds of thousands of nodes. In theory this opens the door to the verification of larger control systems that make use of neural network components. However, although work has managed to incorporate the results of these verifiers to prove larger properties of individual systems, there is currently no general methodology for bridging the gap between verifiers and interactive theorem provers (ITPs). In this paper we present Vehicle, our solution to this problem. Vehicle is equipped with an expressive domain specific language for stating neural network specifications which can be compiled to both verifiers and ITPs. It overcomes previous issues with maintainability and scalability in similar ITP formalisations by using a standard ONNX file as the single canonical representation of the network. We demonstrate its utility by using it to connect the neural network verifier Marabou to Agda and then formally verifying that a car steered by a neural network never leaves the road, even in the face of an unpredictable cross wind and imperfect sensors. The network has over 20,000 nodes, and therefore this proof represents an improvement of 3 orders of magnitude over prior proofs about neural network enhanced systems in ITPs. © 2022, CC BY.

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：