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

56th Technical Symposium on Computer Science Education

作者： Haldeman, Georgiana Bernal, Judah Robbins Wydra, Alec Denny, Paul Colgate Univ Hamilton NY 13346 USA Univ Auckland Auckland New Zealand

ISBN: (纸本)9798400705311

program decomposition is essential for developing maintainable and efficient software, yet it remains a challenging skill to teach and learn in introductory programming courses. What does program decomposition for procedural CS1 programs entail? How can CS1 students improve the decomposition of their programs? What scaffolded exercises can instructors use to teach program decomposition skills? We aim to answer all these questions by presenting a conceptual framework that (1) is grounded in the established code style principles, (2) provides a systematic approach that can be taught to students as an actionable strategy to improve the program decomposition of their programs, and (3) includes scaffolded exercises to be used in classroom activities. In addition, this systematic approach is automatable and can further be used to implement visualizers, automated feedback generators and digital tutors.

关键词： Code Style program decomposition CS1 Procedural Design Refactoring

来源：评论

学校读者我要写书评

暂无评论

Min-cut program decomposition for thread-level speculation

Min-cut program decomposition for thread-level speculation

引用

Conference on programming Language Design and Implementation

作者： Johnson, TA Eigenmann, R Vijaykumar, TN Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, allowing the compiler to improve performance by speculating on ambiguous dependences without absolute guarantees of independence. The compiler is responsible for decomposing a sequential program into speculatively parallel threads, while considering multiple performance overheads related to data dependence, load imbalance, and thread prediction. Although the decomposition problem lends itself to a min-cut-based approach, the overheads depend on the thread size, requiring the edge weights to be changed as the algorithm progresses. The changing weights make our approach different from graph-theoretic solutions to the general problem of task scheduling. One recent work uses a set of heuristics, each targeting a specific overhead in isolation, and gives precedence to thread prediction, without comparing the performance of the threads resulting from each heuristic. By contrast, our method uses a sequence of balanced min-cuts that give equal consideration to all the overheads, and adjusts the edge weights after every cut. This method achieves an (geometric) average speedup of 74% for floating-point programs and 23% for integer programs on a four-processor chip, improving on the 52% and 13% achieved by the previous heuristics.

关键词： algorithms performance thread-level speculation chip multiprocessor min-cut program decomposition partitioning

来源：评论

学校读者我要写书评

暂无评论

Detecting the Reasons for program decomposition in CS1 and Evaluating Their Impact 2023

Detecting the Reasons for Program Decomposition in CS1 and E...

引用

54th Annual ACM SIGCSE Technical Symposium on Computer Science Education (SIGCSE TS)

作者： Charitsis, Charis Piech, Chris Mitchell, John C. Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450394314

decomposition is considered one of the four cornerstones of computational thinking, which is essential to software development [36]. It requires the ability to assess a problem at a high level, develop a strategy to combat it, and then design a solution. Our study focuses on the metacognitive aspect of decomposition. We try to understand the learner's thought process and, specifically, what makes the novice programmer decide to break down a function. Researchers have studied decomposition in introductory programming courses through guided experiments, case studies, and surveys [23, 37]. In this work, we follow a different, more scalable approach. We develop an automated system to analyze 45,000 code snapshots from 168 students for a challenging CS1 programming assignment, detect the pivotal moments when they decide to decompose their programs, and identify what drives their decisions from the code. We then classify the students and study the relationship between the different categories, the code complexity, and the time to derive the final solution. We evaluate the impact of decomposition on the student's performance in the assignment and the course exams. Finally, we discuss the implications of our results for computing education.

关键词： CS1 program decomposition function decomposition metacognition complexity student performance computing education

来源：评论

学校读者我要写书评

暂无评论

decomposition OF MAGIC REWRITING

引用

JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY 1995年第2期42卷 329-381页

作者： WANG, K ZHANG, W CHAU, SC UNIV LETHBRIDGE DEPT MATH & COMP SCILETHBRIDGEAB T1K 3M4CANADA

The magic rewriting focuses on relevant data but suffers from additional rules, predicates, and tuples that are generated in search for the relevant data. Reducing the arity of predicates can cut down the number of such rules, predicates, and tuples by an exponential factor. In this paper, we consider a subclass of linear single-IDB programs and show that the magic rewriting can be decomposed in such a way that it is applied to only programs having smaller arities and fewer recursive rules, without losing the binding capacity. The decomposed rewriting is shown to be much more efficient than the standard one and amenable to distributed and parallel environments. The considered subclass significantly generalizes recursions previously proposed for efficient implementation. The decomposed rewriting and the standard generalized magic rewriting are extended to multi-binding queries in such a way that data relevant to one binding is not necessarily considered as relevant to other bindings. The work in this paper shows the use of tuple ID as an important technique in optimizing logic programs.

关键词： ARITY REDUCTION BOTTOM-UP EVALUATION DATABASE DEDUCTIVE DATABASE LOGIC program MAGIC REWRITING program decomposition

来源：评论

学校读者我要写书评

暂无评论

SYNCHRONIZATION AND COMMUNICATION COSTS OF LOOP PARTITIONING ON SHARED-MEMORY MULTIPROCESSOR SYSTEMS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1992年第4期3卷 505-512页

作者： GUPTA, R Department of Computer Science University of Pittsburgh Pittsburgh PA USA

To exploit loop level parallelism on shared memory multiprocessor systems, loops are decomposed and their execution scheduled on different processors in parallel. This paper presents strategies for static loop decomposition and scheduling as well as compiler assisted run-time scheduling that take into account, in addition to the cost of performing operations, the overhead costs associated with a decomposition and schedule. An algorithm for static decomposition of multidimensional loops based upon the operation execution costs, communication costs, and synchronization costs is discussed. Following the decomposition of a program, synchronization instructions are introduced to ensure correct program execution. An algorithm for determining the explicit synchronization instructions that should be introduced in a program to ensure correct execution of the program with arbitrarily nested loops is presented. Techniques for reducing run-time scheduling, communication and synchronization costs due to self scheduling, a compiler assisted run-time scheduling technique, of multidimensional loops are also presented. Experiments performed on the Encore multiprocessor system demonstrate that the techniques developed can reduce overhead costs.

关键词： COMMUNICATION PARALLELIZING COMPILERS program decomposition RUN-TIME SCHEDULING SHARED MEMORY MULTIPROCESSOR SYSTEMS SYNCHRONIZATION

来源：评论

学校读者我要写书评

暂无评论

REASONING ABOUT INTERACTIVE SYSTEMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1988年第2期14卷 272-276页

作者： AMBRIOLA, V NOTKIN, D UNIV WASHINGTON DEPT COMP SCISEATTLEWA 98195

Interactive systems have goals and characteristics that differ from those of batch systems. These differences lead to a need for new techniques, methods, and tools for manipulating and constructing interactive systems. We consider the difference in structure between batch and interactive systems, focusing on the distinction between command decomposition and component decomposition. We describe the possible ways of solving a problem using an interactive system using action paths, which account for the relatively unconstrained actions of interactive users. We demonstrate that interactivity is not an inherent characteristic of a system but rather a characteristic that depends on the error profile of its users. We consider the requirements that interaction places on the underlying implementation, specifically the need for incrementality and integration. We apply our results to several existing classes of systems. [ABSTRACT FROM AUTHOR]

关键词： Index Terms: Incremental computation integration interaction interactive systems program decomposition user error profile

来源：评论

学校读者我要写书评

暂无评论

CHALLENGING PROBLEMS IN PARTIAL EVALUATION AND MIXED COMPUTATION

引用

NEW GENERATION COMPUTING 1988年第2-3期6卷 291-302页

作者： JONES, ND 1. DIKU University of Copenhagen Universitetsparken 1 DK-2100 Copenhagen ? Denmark

This paper collects together a variety of problems in partial evaluation and mixed computation that appear to be worth solving but as yet lack solutions or (in some cases) precise formulations. The problems come largely from discussions with and notes by participants in the 1987 workshop on Partial Evaluation and Mixed Computation.

关键词： Partial Evaluation Mixed Computation program Specialisation Challenging Problems Open Problems Automation Automatic programming Semantics Based program Manipulation Self Applicable programs programming Tools program Composition program decomposition

来源：评论

学校读者我要写书评

暂无评论

Can Guided decomposition Help End-UsersWrite Larger Block-Based programs? A Mobile Robot Experiment

引用

PROCEEDINGS OF THE ACM ON programMING LANGUAGES-PACMPL 2022年第OOPSLA期6卷 233–258页

作者： Ritschel, Nico Fronchetti, Felipe Holmes, Reid Garcia, Ronald Shepherd, David C. Univ British Columbia Vancouver BC Canada Virginia Commonwealth Univ Richmond VA USA

Block-based programming environments, already popular in computer science education, have been successfully used to make programming accessible to end-users in domains like robotics, mobile apps, and even DevOps. Most studies of these applications have examined small programs that fit within a single screen, yet real-world programs often grow large, and editing these large block-based programs quickly becomes unwieldy. Traditional programming language features, like functions, allow programmers to decompose their programs. Unfortunately, both previous work, and our own findings, suggest that end-users rarely use these features, resulting in large monolithic code blocks that are hard to understand. In this work, we introduce a block-based system that provides users with a hierarchical, domain-specific program structure and requires them to decompose their programs accordingly. Through a user study with 92 users, we compared this approach, which we call guided program decomposition, to a traditional system that supports functions, but does not require decomposition. We found that while almost all users could successfully complete smaller tasks, those who decomposed their programs were significantly more successful as the tasks grew larger. As expected, most users without guided decomposition did not decompose their programs, resulting in poor performance on larger problems. In comparison, users of guided decomposition performed significantly better on the same tasks. Though this study investigated only a limited selection of tasks in one specific domain, it suggests that guided decomposition can benefit end-user programmers. While no single decomposition strategy fits all domains, we believe that similar domain-specific sub-hierarchies could be found for other application areas, increasing the scale of code end-users can create and understand.

关键词： Block-based programming program decomposition mobile robots

来源：评论

学校读者我要写书评

暂无评论

Observations on the Design of program Planning Notations for Students 2024

Observations on the Design of Program Planning Notations for...

引用

55th ACM Technical Symposium on Computer Science Education (SIGCSE)

作者： Rivera, Elijah Fisler, Kathi Krishnamurthi, Shriram Brown Univ Providence RI 02912 USA

ISBN: (纸本)9798400704239

program planning is the process of splitting a problem description into subtasks that can be solved independently, then composed into a solution. While much has been written about planning since the 1980s, little research looks at modern contexts such as programs to process data tables. Tool support for this sort of planning is even rarer. As part of a project to develop such tools, we have run two studies to try to identify steps, representations, and interactions that would support novice university students in planning and programming multi-task programs that process data tables. This experience report describes our observations so far, while also raising questions about how to make planning useful for students.

关键词： program planning program decomposition plans

来源：评论

学校读者我要写书评

暂无评论

HITS: High-coverage LLM-based Unit Test Generation via Method Slicing 24

HITS: High-coverage LLM-based Unit Test Generation via Metho...

引用

39th ACM/IEEE International Conference on Automated Software Engineering (ASE)

作者： Wang, Zejun Liu, Kaibo Li, Ge Jin, Zhi MOE Key Lab HCST PKU Beijing Peoples R China SCS Beijing Peoples R China

ISBN: (数字)9798400712487

ISBN: (纸本)9798400712487

Large language models (LLMs) have behaved well in generating unit tests for Java projects. However, the performance for covering the complex focal methods within the projects is poor. Complex methods comprise many conditions and loops, requiring the test cases to be various enough to cover all lines and branches. However, existing test generation methods with LLMs provide the whole method-to-test to the LLM without assistance on input analysis. The LLM has difficulty inferring the test inputs to cover all conditions, resulting in missing lines and branches. To tackle the problem, we propose decomposing the focal methods into slices and asking the LLM to generate test cases slice by slice. Our method simplifies the analysis scope, making it easier for the LLM to cover more lines and branches in each slice. We build a dataset comprising complex focal methods collected from the projects used by existing state-of-the-art approaches. Our experiment results show that our method significantly outperforms current test case generation methods with LLMs and the typical SBST method Evosuite regarding both line and branch coverage scores.

关键词： Unit Test Generation Large Language Model program decomposition program Slicing Testing and Analysis AI for SE

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：