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

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 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Automated debugging based on a constraint model of the program and a test case

引用

JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING 2012年第4期81卷 390-407页

作者： Wotawa, Franz Nica, Mihai Moraru, Iulia Graz Univ Technol Inst Software Technol A-8010 Graz Austria

debugging, i.e., fault localization, in case of a detected failure is a time consuming and intricate task. The automation or at least partial automation of debugging is therefore highly desired. In this paper, we discuss some of the most recent approaches for debugging namely spectrum-based, slicing-based, and model-based debugging. We focus on the latter, and introduce the underlying theory as well as discuss empirical results obtained from our implementation. The model-based approach we present in this paper relies on a constraint representation of a program that is equivalent to the original program in terms of the input-output behavior under some reasonable assumptions. By using constraints for representing programs and subsequently test cases we are able to state the debugging problem as a constraint satisfaction problem that can be effectively solved using a todays constraint solver. The given empirical results indicate that the approach can be used for debugging smaller programs in less than 1 s. Moreover, we briefly compare the three approaches and suggest a combination of them in order to improve the results and the overall necessary running time. (C) 2012 Elsevier Inc. All rights reserved.

关键词： Automated debugging algorithmic debugging Model-based debugging Constraints Constraint satisfaction problem

来源：评论

学校读者我要写书评

暂无评论

Systematic debugging method for attribute grammar description

引用

INFORMATION PROCESSING LETTERS 1997年第6期62卷 305-313页

作者： Sassa, M Ookubo, T Department of Mathematical Computing Sciences Tokyo Institute of Technology O-okayama Meguro-ku Tokyo 152 Japan

A debugging method for attribute grammars based on algorithmic debugging is proposed. This technique was originally proposed for debugging logic programming languages. It presents to the programmer the local computational results of predicates during program execution. Through examination of whether these results agree with the programmer's intention, it systematically narrows the search space in which bugs can exist. It is formally shown how algorithmic debugging can be applied to attribute grammars by introducing an abstract function, and this technique is expanded in order to realize more efficient debugging by utilizing characteristic features of attribute grammar. It is also demonstrated that this technique is applicable to almost all classes of attribute grammars, making correspondence with their attribute evaluators.

关键词： attribute grammar algorithmic debugging debugging compilers formal semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Logical Framework for debugging in Declarative Constraint Programming

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2009年 256卷 119-135页

作者： del Vado Virseda, Rafael Univ Complutense Madrid Dept Sistemas Informat & Computac Madrid Spain

We present a logical and semantic framework for diagnosing wrong computed answers in CFLP(D), a newly proposed generic scheme for lazy Constraint Functional Logic Programming which can be instantiated by any constraint domain D given as parameter, and supports a powerful combination of functional and constraint logic programming over D. Our approach extends and combines declarative debugging techniques previously developed for less expressive programming paradigms, namely the CLP(D) scheme and lazy functional logic languages. debugging starts with the observation of a wrong computed answer which the user regards as incorrect w.r.t. an intended model that provides a declarative description of the program's semantics. debugging proceeds by exploring an abridged proof tree that provides a purely declarative view of the computation, so that the user does not need to understand the complex underlying operational mechanisms. debugging ends with the detection of a function rule in the program that is incorrect w.r.t. the intended model. We prove the logical correctness of the debugging method for any sound CFLP(D)system whose computed answers are logical consequences of the program, and we describe a practical tool which implements the debugging method for the domain of arithmetic constraints over the real numbers.

关键词： Logical Frameworks Declarative Programming algorithmic debugging Constraints

来源：评论

学校读者我要写书评

暂无评论

An Innovative Teaching Tool based on Semantic Tableaux for Verification and debugging of Imperative Programs

An Innovative Teaching Tool based on Semantic Tableaux for V...

引用

International Conference on Computational Science (ICCS) on the Ascent of Computational Excellence

作者： Virseda, Rafael del Vado Morente, Fernando Perez Univ Complutense Madrid Dept Sistemas Informat & Computac E-28040 Madrid Spain

While Computational Logic plays an important role in several areas of Computer Science (CS), most educational software developed for teaching logic is not suitable to be used directly in large portions of the CS education domain where the application of logical notions is usually required. In this paper we describe an innovative methodology based on a logic teaching tool on semantic tableaux that has been developed to help students to use logic as a formal proof technique in other advanced topics of CS, such as the verification of algorithms, the algorithmic debugging of programs, and the derivation of algorithms from logical specifications, which are foundations of good development of software. We present the results of the evaluation of this tool by means of several educational experiences during the academic year 2009/2010. From these results we conclude that the use of the tool in current CS teaching can help our students to understand more advanced CS concepts and clarify the formal process involved in the design and analysis of correct and efficient imperative programs.

关键词： Tools to aid in teaching Semantic tableaux Formal verification 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

来源：评论

学校读者我要写书评

暂无评论

debugging of Wrong and Missing Answers for Datalog Programs with Constraint Handling Rules 15

Debugging of Wrong and Missing Answers for Datalog Programs ...

引用

17th International Symposium on Principles and Practice of Declarative Programming (PPDP)

作者： Caballero, Rafael Garcia-Ruiz, Yolanda Saenz-Perez, Fernando UCM Dept Sistemas Informat & Computac Madrid Spain UCM Dept Ingn Software & Inteligencia Artificial Madrid Spain

ISBN: (纸本)9781450335164

This paper presents a proposal for debugging deductive database programs. Although inspired in the logic programming paradigm, these programs have the particularity of involving large sets of data. In this context, debugging tools employed usually in logic programs, such as traditional trace debuggers, become impractical. Our technique is based on the principles of algorithmic debugging but adapted to the particularities of the deductive database query language Datalog. The debugging process starts when the user detects an initial erroneous result. Then, the debugger asks questions about the validity/nonvalidity of some intermediate results until a bug is located. The debugger allows the user to report the existence of wrong or missing answers. This information is employed for simplifying the following questions using different forms of slicing. During the debugging process the information provided by the user or inferred by the debugger is stored in the form of constraints in a CHR program that combines all the data in order to detect the source of the error as soon as possible. The debugger has been implemented as part of the Datalog system DES.

关键词： Logic Programming Constraint Handling Rules Deductive Databases algorithmic debugging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：