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

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)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

When is a function a fold or an unfold?

When is a function a fold or an unfold?

引用

CMCS 2001, Coalgebraic Methods in Computer Science (a Satellite Event of ETAPS 2001)

作者： Gibbons, Jeremy Hutton, Graham Altenkirch, Thorsten Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD United Kingdom Languages and Programming Group School of Computer Science and IT University of Nottingham Jubilee Campus Wollaton Road Nottingham NG8 1BB United Kingdom

We give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, pract... 详细信息

关键词： Recursive functions

来源：评论

学校读者我要写书评

暂无评论

ClangJIT: Enhancing C++ with just-in-time compilation

arXiv

引用

arXiv 2019年

作者： Finkel, Hal Poliakoff, David Richards, David F. Lead Compiler Technology and Programming Languages Leadership Computing Facility Argonne National Laboratory LemontIL United States Lawrence Livermore National Laboratory LivermoreCA United States

The C++ programming language is not only a keystone of the high-performance-computing ecosystem but has proven to be a successful base for portable parallel-programming frameworks. As is well known, C++ programmers use templates to specialize algorithms, thus allowing the compiler to generate highly-efficient code for specific parameters, data structures, and so on. This capability has been limited to those specializations that can be identified when the application is compiled, and in many critical cases, compiling all potentially-relevant specializations is not practical. ClangJIT provides a well-integrated C++ language extension allowing template-based specialization to occur during program execution. This capability has been implemented for use in large-scale applications, and we demonstrate that just-in-time-compilation based dynamic specialization can be integrated into applications, often requiring minimal changes (or no changes) to the applications themselves, providing significant performance improvements, programmer-productivity improvements, and decreased compilation time. Copyright © 2019, The Authors. All rights reserved.

关键词： Just in time production

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Specification, implementation, and verification of Domain Specific languages: A logic programming-based approach

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2002年 2407卷 211-239页

作者： Gupta, Gopal Pontelli, Enrico Applied Logic Programming Languages and Systems Lab. Department of Computer Science University of Texas at Dallas Richardson TX 95083 United States Laboratory for Logic Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM 88003 United States

ISBN: (纸本)3540439595

Domain Specific languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. We present a (constraint) logic programming-based framework for specification, efficient implementation, and automatic verification of domain specific languages (DSLs). Our framework is based on using Horn logic (or pure Prolog), and eventually constraints, to specify denotational semantics of domain specific languages. Both the syntax as well as the semantic specification of the DSL in question are directly executable in our framework: the specification itself serves as an interpreter for the DSL. More efficient implementations of this DSL-a compiler-can be automatically derived via partial evaluation. Additionally, the executable specification can be used for automatic or semi-automatic verification of programs written in the DSL as well as for automatically obtaining traditional debuggers and profilers. The ability to verify DSL programs is a distinct advantage of our approach. In this paper we give a general outline of our approach, and illustrate it with practical examples. © 2002 Springer-Verlag Berlin Heidelberg.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

When is a function a fold or an unfold?

引用

Electronic Notes in Theoretical Computer Science 2001年第1期44卷 146-160页

作者： Jeremy Gibbons Graham Hutton Thorsten Altenkirch Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD United Kingdom Languages and Programming Group School of Computer Science and IT University of Nottingham Jubilee Campus Wollaton Road Nottingham NG8 1BB United Kingdom

关键词：

来源：评论

学校读者我要写书评

暂无评论

Editorial: Special issue dedicated to ICFP 2010

引用

Journal of Functional programming 2012年第4-5期22卷 379-381页

作者： UMUT A. ACAR JAMES CHENEY STEPHANIE WEIRICH Programming Languages and Systems Group Max Planck Institute for Software Systems Germany (e-mail: umut@***) Laboratory for Foundations of Computer Science University of Edinburgh Edinburgh UK (e-mail: jcheney@inf.ed.ac.uk) School of Engineering and Applied Science University of Pennsylvania Philadelphia PA 19104 USA (e-mail: sweirich@cis.upenn.edu)

The 15th ACM SIGPLAN International Conference on Functional programming (ICFP) took place on September 27–29, 2010 in Baltimore, Maryland. After the conference, the programme committee, chaired by Stephanie Weirich, selected several outstanding papers and invited their authors to submit to this special issue of Journal of Functional programming. Umut A. Acar and James Cheney acted as editors for these submissions. This issue includes the seven accepted papers, each of which provides substantial new material beyond the original conference version. The selected papers reflect a consensus by the program committee that ICFP 2010 had a number of strong papers that link core functional programming ideas with other areas, such as multicore, embedded systems, and data compression.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Uvl: Feature Modelling with the Universal Variability Language

SSRN

引用

SSRN 2024年

作者： Benavides, David Sundermann, Chico Feichtinger, Kevin Galindo, José A. Rabiser, Rick Thüm, Thomas Department of Computer Languages and Systems Universidad de Sevilla Av. Reina Mercedes Seville41012 Spain Institute of Software Engineering and Programming Languages University of Ulm Albert-Einstein-Allee 11 Ulm89069 Germany CRC 1608 KASTEL – Dependability of Software-intensive Systems Karlsruhe Institute of Technology Am Fasanengarten 5 Karlsruhe76131 Germany Christian Doppler Laboratory VaSiCS LIT CPS Lab Johannes Kepler University Linz Altenberger Straße 69 Linz4040 Austria

Feature modelling is a cornerstone of software product line engineering, providing a means to represent software variability through features and their relationships. Since its inception in 1990, feature modelling has evolved through various extensions, and after three decades of development, there is a growing consensus on the need for a standardised feature modelling language. Despite multiple endeavours to standardise variability modelling and the creation of various textual languages, researchers and practitioners continue to use their own approaches, impeding effective model sharing. In 2018, a collaborative initiative was launched by a group of researchers to develop a novel textual language for representing feature models. This paper introduces the outcome of this effort: the Universal Variability Language (\UVL), which is designed to be human-readable and serves as a pivot language for diverse software engineering tools. The development of \UVL drew upon community feedback and leveraged established literature in the field of variability modelling. The language is structured into three levels -Boolean, Arithmetic, and Type- and allows for language extensions to introduce additional constructs enhancing its expressiveness. \UVL is integrated into various existing software tools, such as FeatureIDE and FLAMA, and is maintained by a consortium of institutions. © 2024, The Authors. All rights reserved.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Functorial string diagrams for reverse-mode automatic differentiation

arXiv

引用

arXiv 2021年

作者： Alvarez-Picallo, Mario Ghica, Dan R. Sprunger, David Zanasi, Fabio Programming Languages Laboratory Huawei Research Centre 2 Semple Str. EdinburghEH3 8BL United Kingdom Computer Science and University of Birmingham Birmingham EnglandB15 2TT United Kingdom Computer Science University College London London EnglandWC1E 6BT United Kingdom

We enhance the calculus of string diagrams for monoidal categories with hierarchical features in order to capture closed monoidal (and cartesian closed) structure. Using this new syntax we formulate an automatic differentiation algorithm for (applied) simply typed lambda calculus in the style of [Pearlmutter and Siskind 2008] and we prove for the first time its soundness. To give an efficient yet principled implementation of the AD algorithm we define a sound and complete representation of hierarchical string diagrams as a class of hierarchical hypergraphs we call hypernets. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：