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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Provenance-enhanced algorithmic debugging 19

Provenance-enhanced Algorithmic Debugging

引用

33rd Brazilian Symposium on Software Engineering (SBES) / 10th Brazilian Conference on Software (CBSoft)

作者： Linhares, Henrique Pimentel, Joao Felipe Kohwalter, Troy Paulino Murta, Leonardo Gresta Univ Fed Fluminense Inst Comp Niteroi RJ Brazil

ISBN: (纸本)9781450376518

Localizing defects in a faulty software is a notoriously difficult activity. Researchers proposed several techniques to help developers to locate defects. One of these techniques is algorithmic debugging, which consists on executing the defective program, building an execution tree with the subcomputations, asking questions to the developer about the correctness of some specific subcomputations, and pruning the search space according to the answers to those questions. However, depending on the complexity of the program, the number of questions can be high, increasing the duration of the debug session. In this work we propose DebugProv, an algorithmic debugging approach for Python programs that enhances the execution tree with provenance to reduce the number of necessary questions to locate the defect, and, consequently, reduce the duration of debug sessions. We evaluated our technique over different programs and found that it was able to reduce the number of questions in 25.26%, on average.

关键词： algorithmic debugging provenance program slicing software defects

来源：评论

学校读者我要写书评

暂无评论

A Survey of algorithmic debugging

引用

ACM COMPUTING SURVEYS 2017年第4期50卷 60-60页

作者： Caballero, Rafael Riesco, Adrian Silva, Josep Univ Complutense Madrid Dept Sistemas Informat & Computac C Prof Jose Garcia Santesmases 9 E-28040 Madrid Spain Univ Politecn Valencia Dept Sistemas Informat & Computac Camino Vera S-N E-46022 Valencia Spain

algorithmic debugging is a technique proposed in 1982 by E.Y. Shapiro in the context of logic programming. This survey shows how the initial ideas have been developed to become a widespread debugging schema fitting many different programming paradigms and with applications out of the program debugging field. We describe the general framework and the main issues related to the implementations in different programming paradigms and discuss several proposed improvements and optimizations. We also review the main algorithmic debugger tools that have been implemented so far and compare their features. From this comparison, we elaborate a summary of desirable characteristics that should be considered when implementing future algorithmic debuggers.

关键词： Languages Theory algorithmic debugging declarative debugging software engineering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Resolving counterintuitive consequences in law using legal debugging

引用

ARTIFICIAL INTELLIGENCE AND LAW 2021年第4期29卷 541-557页

作者： Fungwacharakorn, Wachara Tsushima, Kanae Satoh, Ken Sokendai Univ Natl Inst Informat Tokyo Japan

There are cases in which the literal interpretation of statutes may lead to counterintuitive consequences. When such cases go to high courts, judges may handle these counterintuitive consequences by identifying problematic rule conditions. Given that the law consists of a large number of rule conditions, it is demanding and exhaustive to figure out which condition is problematic. For solving this problem, our work aims to assist judges in civil law systems to resolve counterintuitive consequences using logic program representation of statutes and Legal debugging. The core principle of Legal debugging is to cooperate with a user to find a culprit, a root cause of counterintuitive consequences. This article proposes an algorithm to resolve a culprit. Since the statutes are represented by logic rules but changes in law are initiated by cases, we adopt a prototypical case with judgement specified by a set of rules. Then, to resolve a culprit, we reconstruct a program so that it provides reasons as if we applied case-based reasoning to a new set of prototypical cases with judgement, which include a new set of facts relevant to a considering case.

关键词： Legal debugging Legal reasoning Legal representation algorithmic debugging

来源：评论

学校读者我要写书评

暂无评论

Legal debugging in Propositional Legal Representation 10th

Legal Debugging in Propositional Legal Representation

引用

Japanese-Society-of-Artificial-Intelligence 10th International Symposium on Artificial Intelligence (JSAI-isAI)

作者： Fungwacharakorn, Wachara Satoh, Ken Sokendai Univ Natl Inst Informat Tokyo Japan

ISBN: (纸本)9783030316051;9783030316044

Literal interpretation on laws may produce unexpected consequences. They are difficult to be recognized unless exceptional cases were taken to the court. The court may decide a literal interpretation as exceptional, and then they have to identify which rule is a source of exception. To assist the court, we proposed an idea called legal debugging, to find out which rule condition, called a culprit, causes unexpected consequences in such exceptional cases. We adapt the algorithmic program debugging with consideration of characteristics in reasoning in judgement, such as non-recursive stratified structures and factual propositions in order to find a culprit at last. This paper presents legal debugging in propositional Prolog as well as PROLEG (PROlog based LEGal reasoning support system) specialized for legal reasoning. An example of legal debugging that interacts with a user and finds a culprit is also shown under the PROLEG representation of the case adapted from the real Supreme Court case.

关键词： Legal reasoning Legal representation algorithmic debugging

来源：评论

学校读者我要写书评

暂无评论

Implementation of an Optimal Strategy for algorithmic debugging

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2012年 282卷 47-60页

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

One of the most automatic debugging techniques is algorithmic debugging because it allows us to debug a program without the need to inspect the source code. In order to find a bug, an algorithmic debugger asks questions to the programmer about the correctness of subcomputations in an execution. Reducing the number and complexity of these questions is an old objective in this field. Recently, an strategy for algorithmic debuggers that minimizes the number of questions has been released. This new strategy is called Optimal Divide and Query and, provided that all questions can be answered, it finds any bug in the source code with a minimum set of questions. In this work we discuss the implementation of such a strategy in different algorithmic debugging architectures.

关键词： debugging algorithmic debugging

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：