In this paper, we present the rule-Maker System, which is a visualization approach of rule-based programming. Compared to traditional rule-based programming, rule-Maker provides an intuitive graphical interface to red...
详细信息
ISBN:
(纸本)9781595937537
In this paper, we present the rule-Maker System, which is a visualization approach of rule-based programming. Compared to traditional rule-based programming, rule-Maker provides an intuitive graphical interface to reduce programming effort and help developers focus on rule structure rather than rule syntax. Programmers can implement graphical modules of algorithms. By connecting with LRR (Laboratory for Rapid Rewriting), the visualization approach hides the computation detail information from the developer.
This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implem...
详细信息
This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of interest, using order-sorted unification over unsorted unification is able to reduce the total number of unifiers considered, and dramatically improve the performance of the Maude-NRL tool.
In natural situations, movements are often directed toward locations different from that of the evoking sensory stimulus. Movement goals must then be inferred from the sensory cue based on rules. When there is uncerta...
详细信息
In natural situations, movements are often directed toward locations different from that of the evoking sensory stimulus. Movement goals must then be inferred from the sensory cue based on rules. When there is uncertainty about the rule that applies for a given cue, planning a movement involves both 'Choosing the relevant rule and computing the movement goal based on that rule. Under these conditions, it is not clear whether primates compute multiple movement goals based on all possible rules before choosing an action, or whether they first choose a rule and then only represent the movement goal associated with that rule. Supporting the former hypothesis, we show that neurons in the frontoparietal reach areas of monkeys simultaneously represent two different rule-based movement goals, which are biased by the monkeys' choice preferences. Apparently, primates choose between multiple behavioral options by weighing against each other the movement goals associated with each option.
Since a rule-based program[1][2] is composed of a set of rules[3], it is easy to improve the whole program by speeding up each rule in the program. We propose a technology to measure execution time of each rule, in or...
详细信息
Since a rule-based program[1][2] is composed of a set of rules[3], it is easy to improve the whole program by speeding up each rule in the program. We propose a technology to measure execution time of each rule, in order to analyze the interrelation of rules more clearly, and improve the efficiency of rule-based programs by several methods. Our proposal also includes the technology to measure the execution time of failed applicability checking of rules[4], since in a complicated rule-based program, failed applicability checking of rules may consume plenty of execution time. Among all the rule-based languages, we choose Equivalent Transformation (ET) language[5], which can ensure the correctness of the whole program based on the correctness of ET rules in it.
In recent years light-weighted formal methods in construction and analysis of complex concurrent software system are of growing interest. In this paper a new rule-action based term rewriting framework, called TermWare...
详细信息
In recent years light-weighted formal methods in construction and analysis of complex concurrent software system are of growing interest. In this paper a new rule-action based term rewriting framework, called TermWare, is proposed and its application to software system analysis is described to provide better cost effectiveness of software maintenance under varied requirements and specifications of operation. The main advantage is light-weighted formal model based on not computational semantics but on particular properties of software system to be analyzed. Such approach eliminates the need in full formal analysis of software system and allows extreme flexibility of applications in two major concerns: high adaptability to changeable environment and easy reengineering and component reuse. The language and formal semantics of the system are defined. A new semantic model, called term system with action, is proposed for TermWare. A case study with some representative examples in source code analysis and software development with TermWare framework is presented.
Research is generating large quantities of digital material, much of it irreplaceable, and there is a pressing need to maintain long-term access to it. Not only is the quantity of data growing in size, it is becoming ...
详细信息
Research is generating large quantities of digital material, much of it irreplaceable, and there is a pressing need to maintain long-term access to it. Not only is the quantity of data growing in size, it is becoming Much more diverse and complex, significantly complicating the issues around its curation. Automation Of curation is key if a scalable solution is to be found. We describe an approach to automation in which digital curation policies and strategies are represented as rules, which are implemented in data grids based oil the iRODS middleware. (C) 2008 Elsevier B.V. All rights reserved.
Diaplan is a language for programming with graphs and diagrams that is currently being designed and implemented by the authors. In this paper, a programming example, declaration grids, shall illustrate how Diaplan sup...
详细信息
Diaplan is a language for programming with graphs and diagrams that is currently being designed and implemented by the authors. In this paper, a programming example, declaration grids, shall illustrate how Diaplan supports a functional and object-oriented style of programming. The example also indicates which features are needed beyond those discussed in previous work on the language [9].
based on an analysis of the capability operators of the Calculus of Mobile Ambients, three fairness principles are proposed to safeguard the interactions of the ambients. The Calculus of Fair Ambient is designed to me...
详细信息
based on an analysis of the capability operators of the Calculus of Mobile Ambients, three fairness principles are proposed to safeguard the interactions of the ambients. The Calculus of Fair Ambient is designed to meet these fairness principles. A labeled transition semantics for the calculus is defined to support structural investigation. The bisimulation theory of the fair ambients is studied and two coincidence results are established. An expressiveness result of the calculus is formally established by proving that it contains the pi calculus as a sub-calculus.
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/O-examples). Potential applications for automatic program or algorithm induction are to enable end users to create...
详细信息
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/O-examples). Potential applications for automatic program or algorithm induction are to enable end users to create their own simple programs, to assist professional programmers, or to automatically invent completely new and efficient algorithms. In our approach, functional programs are represented as constructor term rewriting systems (CSs) containing recursive rules. I/O-examples for a target function to be implemented are a set of pairs of terms (F(i(i)),o(i)) meaning that F(i(i))-denoting application of function F to input i(i)-is rewritten to oi by a CS implementing the function F. Induction is based on detecting syntactic regularities between example terms. In this paper we present theoretical results and describe an algorithm for inducing CSs over arbitrary signatures/data types which consist of one function defined by an arbitrary number of rules with an arbitrary number of non-nested recursive calls in each rule. Moreover, we present empirical results based on a prototypical implementation.
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very difficult or even impossible to modula...
详细信息
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very difficult or even impossible to modularize with traditional modularization mechanisms because they are crosscutting. Recently, aspect-oriented programming has enjoyed recognition as a practical solution for separating these concerns. In this paper we describe an extension to the Stratego term rewriting language for capturing such properties. We show our aspect language offers a concise, practical and adaptable solution for dealing with unanticipated algorithm extension for forward data-flow propagation and dynamic type checking of terms. We briefly discuss some of the challenges faced when designing and implementing an aspect extension for and in a rule-based term rewriting system.
暂无评论