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

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

来源：评论

学校读者我要写书评

暂无评论

Optimistic Versioning for Conflict-tolerant Collaborative Blended Modeling 10

Optimistic Versioning for Conflict-tolerant Collaborative Bl...

引用

STAF 2022 Workshop: 10th International Workshop on Bidirectional Transformations, BX 2022, 2nd International Workshop on Foundations and Practice of Visual Modeling, FPVM 2022 and 2nd International Workshop on MDE for Smart IoT Systems, MeSS 2022

作者： Exelmans, Joeri Pietron, Jakob Raschke, Alexander Vangheluwe, Hans Tichy, Matthias Department of Computer Science University of Antwerp - Flanders Make Antwerp Belgium Institute of Software Engineering and Programming Languages Ulm University Ulm Germany

Optimistic versioning is a key component in supporting collaborative workflows. Text-based versioning has been widely adopted for versioning code, but in model-driven engineering, dealing with visual concrete syntaxes, new methods are required. In the case of blended modeling, a mixture of both textual and visual syntaxes, concurrently editable and synchronizable, introduces additional challenges. We propose a type of operation-based versioning to record not only user edits, but also bi-directional change propagations between concrete and abstract syntax. This way we can support blended modeling with layout continuity, and flexible handling of missing information (e. g., layout information) when rendering changes from abstract to concrete syntax. In addition, the proposed versioning approach enables collaborative conflict resolution by allowing partial conflict resolution, thus deferring a final resolution. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Implementing and Executing Static Analysis using LLVM and CodeChecker

arXiv

引用

arXiv 2024年

作者： Horváth, Gábor Kovács, Réka Nikolett Szalay, Richárd Porkoláb, Zoltán Department of Programming Languages and Compilers Institute of Computer Science Faculty of Informatics Eötvös Loránd University Budapest Hungary

Static analysis is a method to analyse the source code without executing it. It is widely used to find bugs and code smells in industrial software. Among other methods, the most important techniques are the one based on the abstract syntax tree and the one performing symbolic execution. Both of these methods found their role in modern software development as they have different advantages and limitations. In this tutorial, we present two problems from the C++ programming language: the elimination of redundant pointers;and how can we deal with dangling pointers originated from the misuse of the std::string class. These two issues have different theoretical backgrounds and finding them requires different implementation techniques. We will provide a step-by-step guide to implement the checkers – software to identify the aforementioned problems –, one is based on the abstract syntax analysis method, the other will explore the possibilities of the symbolic execution. The methods are explained in great detail and supported by code examples. We intend this tutorial both for architects of static analysis tools and for those developers who want to understand the advantages and the constraints of the individual methods. © 2024, CC BY.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

ANCESTRAL PROTEIN SEQUENCE RECONSTRUCTION USING A TREE-STRUCTURED ORNSTEIN-UHLENBECK VARIATIONAL AUTOENCODER 10

ANCESTRAL PROTEIN SEQUENCE RECONSTRUCTION USING A TREE-STRUC...

引用

10th International Conference on Learning Representations, ICLR 2022

作者： Moreta, Lys Sanz Rønning, Ola Al-Sibahi, Ahmad Salim Hein, Jotun Theobald, Douglas Hamelryck, Thomas Probabilistic Programming Group PLTC Section University of Copenhagen Copenhagen Denmark Department of Statistics University of Oxford Oxford United Kingdom Brandeis University Biochemistry Department MA United States Probabilistic Programming Group SCARB PLTC Section Department of Biology Computer Science University of Copenhagen Copenhagen Denmark

We introduce a deep generative model for representation learning of biological sequences that, unlike existing models, explicitly represents the evolutionary process. The model makes use of a tree-structured Ornstein-Uhlenbeck process, obtained from a given phylogenetic tree, as an informative prior for a variational autoencoder. We show the model performs well on the task of ancestral sequence reconstruction of single protein families. Our results and ablation studies indicate that the explicit representation of evolution using a suitable tree-structured prior has the potential to improve representation learning of biological sequences considerably. Finally, we briefly discuss extensions of the model to genomic-scale data sets and the case of a latent phylogenetic tree. © 2022 ICLR 2022 - 10th International Conference on Learning Representationss. All rights reserved.

关键词： Genome

来源：评论

学校读者我要写书评

暂无评论

Integration of weighted majority voting in machine learning algorithms to enhance pine tree crown mapping on UAV imagery

Integration of weighted majority voting in machine learning ...

引用

2024 Symposium on Beyond the Canopy: Technologies and Applications of Remote Sensing

作者： Hosingholizade, Ali Erfanifard, Yousef Alavipanah, Seyed Kazem Pirasteh, Saied Garcia Millan, Virginia Dept. of Remote Sensing and GIS Faculty of Geography University of Tehran Tehran Iran Institute of Artificial Intelligence School of Mechanical and Electrical Engineering Shaoxing University China Department of Geotechnics and Geomatics Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Chennai602105 India Dept. of Computer Science and Programming Languages School of Computer Science and Enginering University of Málaga Málaga Spain

The shape and area of the crown of each tree are among the most influential parameters for identifying and controlling the processes of photosynthesis, respiration, transpiration and its management. In such a way that various physiographic functions, such as carbon dioxide absorption, light energy absorption, oxygen release and transpiration, which are vital for the growth and development of the tree, are done in the crown. In this research, the RGB image of the UAV with a spatial resolution of 2 cm was resampled to three pixel sizes of 10, 30 and 50 cm. Then, each image was classified separately by SVM, ANN and MLC algorithms, which are all part of Ensemble. In the next step, each of the obtained crowns was compared with the digitization of the same crown, and based on the area of the crown obtained from each classification and normalization method, the weight was obtained specifically for the same crown. Finally, by using the weighted majority voting method, classifications were fusioned at the decision level. The results showed that the ANN method gives better results in all pixel sizes compared to MLC and SVM. Also, the combination of different classification methods with the weighted majority voting method based on the weight assigned to the same crown based on each classification method has significantly increased the classification accuracy of the tree crown in all the sizes of the analyzed pixels. © Author(s) 2024.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Model-based Generation of Attack-Fault Trees

arXiv

引用

arXiv 2023年

作者： Groner, Raffaela Witte, Thomas Raschke, Alexander Hirn, Sophie Pekaric, Irdin Frick, Markus Tichy, Matthias Felderer, Michael Institute of Software Engineering and Programming Languages Ulm University Germany Department of Computer Science University of Innsbruck Austria Department of Information Systems and Computer Science University of Liechtenstein Liechtenstein Germany Department of Mathematics and Computer Science University of Cologne Germany

Joint safety and security analysis of cyber-physical systems is a necessary step to correctly capture inter-dependencies between these properties. Attack-Fault Trees represent a combination of dynamic Fault Trees and Attack Trees and can be used to model and model-check a holistic view on both safety and security. Manually creating a complete AFT for the whole system is, however, a daunting task. It needs to span multiple abstraction layers, e.g., abstract application architecture and data flow as well as system and library dependencies that are affected by various vulnerabilities. We present an AFT generation tool-chain that facilitates this task using partial Fault and Attack Trees that are either manually created or mined from vulnerability databases. We semi-automatically create two system models that provide the necessary information to automatically combine these partial Fault and Attack Trees into complete AFTs using graph transformation rules. © 2023, CC BY-NC-ND.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：