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

algorithmic debugging OF EQUIVALENT TRANSFORMATION PROGRAMS USING ORACLE RULES

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2011年第8期7卷 4703-4716页

作者： Miyajima, Shinya Akama, Kiyoshi Mabuchi, Hiroshi Gifu Univ Fac Engn Gifu 5011193 Japan Hokkaido Univ Informat Initiat Ctr Kita Ku Sapporo Hokkaido 060081 Japan Iwate Prefectural Univ Fac Software & Informat Sci Takizawa Iwate 0200193 Japan

A debugging algorithm in equivalent transformation (ET) model is proposed. The proposed algorithm returns a bug rule in a program by receiving new rules from oracles (oracle rules). We construct theory about correctness of the proposed algorithm, present two strategies with respect to the requests of oracle rules, report examples to show the property of the proposed algorithm, and compare the proposed algorithm with the other debugging algorithms in the ET model.

关键词： Equivalent transformation model algorithmic debugging Program correctness

来源：评论

学校读者我要写书评

暂无评论

algorithmic debugging generalized

引用

JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING 2018年 97卷 85-104页

作者： Insa, David Silva, Josep Univ Politecn Valencia Dept Sistemas Informat & Computac Camino Vera S-N E-46022 Valencia Spain

algorithmic debugging is a semi-automatic debugging technique that abstracts the operational details of computations, allowing the programmers to debug their code from an abstract point of view. However, its use in practice is still marginal, and one of the reasons is the lack of precision of this technique when reporting errors (current algorithmic debuggers do not point an expression or line as buggy, but they point a whole procedure/function/method as containing the bug). In this paper, we make a step forward to overcome this problem. We identify two specific causes of that problem in the standard formulation and implementations of algorithmic debugging, and we present a reformulation to solve both problems. We show that the novel ideas included in the reformulation proposed cannot be supported by the standard internal data structures (such as the Execution Tree) used in this technique and, hence, a generalisation of the standard definitions and algorithms is needed. The reformulation has been done in a language independent manner to make it useful and reusable in different programming languages. (C) 2018 Elsevier Inc. All rights reserved.

关键词： algorithmic debugging Transformation Generalization

来源：评论

学校读者我要写书评

暂无评论

algorithmic debugging of Real-World Haskell Programs: Deriving Dependencies from the Cost Centre Stack 15

Algorithmic Debugging of Real-World Haskell Programs: Derivi...

引用

36th ACM SIGPLAN Conference on Programming Language Design and Implementation

作者： Faddegon, Maarten Chitil, Olaf Univ Kent Canterbury CT2 7NZ Kent England

ISBN: (纸本)9781450334686

Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, even libraries that the user does not want to debug and which may use language features not supported by the debugger. This is a pity, because a promising approach to debugging is therefore not applicable to many real-world programs. We use the cost centre stack from the Glasgow Haskell Compiler profiling environment together with runtime value observations as provided by the Haskell Object Observation Debugger (HOOD) to collect enough information for algorithmic debugging. Program annotations are in suspected modules only. With this technique algorithmic debugging is applicable to a much larger set of Haskell programs. This demonstrates that for functional languages in general a simple stack trace extension is useful to support tasks such as profiling and debugging.

关键词： tracing algorithmic debugging lazy evaluation Haskell

来源：评论

学校读者我要写书评

暂无评论

HIGH-LEVEL VLSI DESIGN SPECIFICATION VALIDATION USING algorithmic debugging

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1994年第12期E77A卷 1988-1998页

作者： NAGANUMA, J OGURA, T HOSHINO, T NTT LSI Lab Atsugi Japan

This paper proposes a new environment for high-level VLSI design specification validation using ''algorithmic debugging'' and evaluates its benefits on three significant examples (a protocol processor, an 8-bit CPU, and a Prolog processor). A design is specified at a high-level using the structured analysis (SA) method, which is useful for analyzing and understanding the functionality to be realized. The specification written in SA is transformed into a logic programming language and is simulated in it. The errors (which terminate with an incorrect output in the simulation) included in the three large examples are efficiently located by answering junt a few queries from the algorithmic debugger. The number of interactions between the designer and the debugger is reduced by a factor of ten to a hundred compared to conventional simulation based validation methodologies. The correct SA specification can be automatically translated into a Register Transfer Level (RTL) specification suitable for logic synthesis. In this environment, a designer is freed from the tedious task of debugging a RTL specification, and can concentrate on the design itself. This environment promises to be an important step towards efficient high-level VLSI design specification validation.

关键词： HIGH-LEVEL DESIGN SPECIFICATION VALIDATION STRUCTURED ANALYSIS METHOD algorithmic debugging LOGIC PROGRAMMING LANGUAGES

来源：评论

学校读者我要写书评

暂无评论

A survey on algorithmic debugging strategies

引用

ADVANCES IN ENGINEERING SOFTWARE 2011年第11期42卷 976-991页

作者： Silva, Josep Univ Politecn Valencia DSIC Valencia 46022 Spain

algorithmic debugging is a debugging technique that has been extended to practically all programming paradigms. Roughly speaking, the technique constructs an internal representation of all (sub)computations performed during the execution of a buggy program;and then, it asks the programmer about the correctness of such computations. The answers of the programmer guide the search for the bug until it is isolated by discarding correct parts of the program. After twenty years of research in algorithmic debugging many different techniques have appeared to improve the original proposal. Surprisingly, no study exists that joins together all these techniques and compares their advantages and their performance. This article presents a study that compares all current algorithmic debugging techniques and analyzes their differences and their costs. The research identifies the dimensions on which each strategy relies. This information allows us to combine the strong points of different strategies. (c) 2011 Elsevier Ltd. All rights reserved.

关键词： debugging algorithmic debugging algorithmic debugging strategy Divide & query Execution tree Software engineering

来源：评论

学校读者我要写书评

暂无评论

Application of program slicing in algorithmic debugging

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1998年第11-12期40卷 637-645页

作者： Kamkar, M Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

debugging has always been a costly part of software development and software maintenance, which makes it important to find methods and tools to support this activity. algorithmic program debugging is an interactive process where the debugging system acquires knowledge about the intended behavior of the debugged program and uses this knowledge to localize errors semi-automatically. This knowledge is a set of partial specifications collected by the debugging system through a number of questions to the user. Although in theory the specifications about the intended program behavior can be stored in advance, this is still an error-prone task in practice. Thus, knowledge collection during debugging is a necessity. A major drawback of this method is the large number of user interactions during bug localization. An important improvement would be to supply the debugging system with some information which can reduce this number. This is achieved by combining program slicing with algorithmic debugging. Program slicing improves the search method by eliminating many irrelevant questions to the user during bug localization. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： algorithmic debugging program slicing

来源：评论

学校读者我要写书评

暂无评论

debugging techniques for declarative languages: Profiling, program slicing and algorithmic debugging

引用

AI COMMUNICATIONS 2008年第1期21卷 91-92页

作者： Silva, Josep Univ Politecn Valencia Dept Sistemas Informat & Computac E-46022 Valencia Spain

There is no doubt about the relevance of debugging in the software development process. However, the scientific community has put little attention on this task and the same debugging techniques used twenty years ago are still being used today. The thesis firstly studies and compares current debugging techniques and then it proposes new methods for the debugging of declarative languages putting special attention on profiling, program slicing and algorithmic debugging.

关键词： debugging profiling program slicing algorithmic debugging

来源：评论

学校读者我要写书评

暂无评论

State of the Practice in algorithmic debugging

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2009年 246卷 55-70页

作者： Cheda, Diego Silva, Josep Univ Politecn Valencia DSIC Camino Vera S-N E-46022 Valencia Spain

algorithmic debugging is a semi-automatic debugging technique which is based on the answers of an oracle (usually the programmer) to a series of questions generated automatically by the algorithmic debugger. The technique typically traverses a record of the execution-the so-called execution tree-which only captures the declarative aspects of the execution and hides operational details. In this work we review and compare the most important algorithmic debuggers of different programming paradigms. In the study we analyze the features incorporated by current algorithmic debuggers, and we identify some features not supported yet by any debugger. We then compare all the debuggers giving rise to a map of the state of the practice in algorithmic debugging.

关键词： debugging algorithmic debugging

来源：评论

学校读者我要写书评

暂无评论

A Higher-Order Logical Framework for the algorithmic debugging and Verification of Declarative Programs

A Higher-Order Logical Framework for the Algorithmic Debuggi...

引用

11th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 09)

作者： del Vado Virseda, Rafael Univ Complutense Madrid Dpto Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9781605585680

We propose a higher-order logical framework for declarative programming as an extension to the setting of the simply typed lambda calculus of a first-order rewriting logic, where programs are now presented by conditional pattern rewrite systems on lambda abstractions. We use this new logical framework to obtain a natural model-theoretic semantics from traditional theories in higher-order declarative (functional and logic) programming, and we provide a fixpoint semantics that matches the pattern model of a program as the least fixpoint of an operator defined over pattern algebras. We use this higher-order semantic framework as a basis for the verification of declarative programs and the development of efficient algorithmic debugging techniques. Our debugging approach proceeds by exploring an abridged computational tree built on a higher-order proof calculus with A-abstractions that provides a purely declarative view of the computation, in order to detect a function rule that is incorrect in the intended model of the program's semantics. For verification purposes, our higher-order logical framework can be mapped into higher-order logic programming, and we can use this translation as a starting point to explore how to prove properties valid in the least pattern model of a program by means of different existing interactive proof assistants, as the Isabelle theorem prover.

关键词： Multiparadigm Declarative Programming Lambda Calculus algorithmic debugging Declarative Verification

来源：评论

学校读者我要写书评

暂无评论

Combining Program Slicing and algorithmic debugging to Diagnose a PLC program 16

Combining Program Slicing and Algorithmic Debugging to Diagn...

引用

16th International Multi-Conference on Systems, Signals and Devices (SSD)

作者： Baniyounis, Mohammed Mesmar, AlMutazbellah Philadelphia Univ Mechatron Engn Dept Amman Jordan

ISBN: (纸本)9781728118208

Program logic controllers are widely used in industry either to control the manufacturing process or the processing plant. Thus, any faulty behavior in the program logic controller will have a crucial effect on both of the industry or/and labors. Therefore, it is important to be able to detect and diagnose any fault in the program logic controller. This paper introduces a new debugging technique;it combines both of the program slicing and the algorithmic debugging techniques. This is attained by making use of the instruction list programming to perform the debugging techniques and then it is converted into a control flow graph before applying the new combination between the slicing and algorithmic debugging. Through the use of these techniques, the debugger can utilize the feedback from the user to detcet the fault and find the source of this fault.

关键词： PLC Program Slicing debugging algorithmic debugging Diagnosability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：