Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing slices directly from semantic specifica...
详细信息
ISBN:
(纸本)9780897916929
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing slices directly from semantic specifications. These algorithms are based on combining the notion of dynamic dependence tracking in term rewriting systems [13] with a program representation whose behavior is defined via an equational logic [12]. Our approach is distinguished by the fact that changes to the behavior of the slicing algorithm can be accomplished through simple changes in rewriting rules that define the semantics of the program representation. Thus, e.g., different notions of dependence may be specified, properties of language-specific datatypes can be exploited, and various time, space, and precision tradeoffs may be made. This flexibility enables us to generalize the traditional notions of static and dynamic slices to that of a constrained slice, where any subset of the inputs of a program may be supplied.
We study the relationship between the infinitary logic L(Formula presented) with finitely many variables and implicit definability in effective fragments of L(Formula presented) on finite structures. We show that fixp...
详细信息
The proceedings contain 57 papers. The special focus in this conference is on Concurrency, Automata and Formal Languages. The topics include: Theory of 2-structures;a domain for concurrent termination;nonfinite axioma...
ISBN:
(纸本)3540600841
The proceedings contain 57 papers. The special focus in this conference is on Concurrency, Automata and Formal Languages. The topics include: Theory of 2-structures;a domain for concurrent termination;nonfinite axiomatizability of the equational theory of shuffle;the algebraic equivalent of AFL theory;finite state transformations of images;post correspondence problem;computing the closure of sets of words under partial commutations;intervalizing k-colored graphs;NC algorithms for finding a maximal set of paths with application to compressing strings;on the construction of classes of suffix trees for square matrices;fast gossiping by short messages;break finite automata public key cryptosystem;short memory in stochastic graphs;on the number of random bits in totally private computation;lower time bounds for randomized computation;new collapse consequences of NP having small circuits;the complexity of searching succinctly represented graphs;characterizations and applications;placing resources in a tree;shortest path queries in digraphs of small treewidth;a dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs;parallel algorithms with optimal speedup for bounded treewidth;approximating minimum cuts under insertions;linear time algorithms for dominating pairs in asteroidai triple-free graphs;on-line resource management with applications to routing and scheduling;alternation in simple devices;hybrid automata with finite bisimulations;generalized sturmian languages;polynomial closure and unambiguous product;lower bounds on algebraic random access machines and improved deterministic pram simulation on the mesh.
This conference proceedings contain 62 papers. The following topics are dealt with: device-based circuits;test;logic minimization;neural networks;circuit design;algebra;reliable systems;current-mode circuits;VLSI;comp...
详细信息
ISBN:
(纸本)0818626801
This conference proceedings contain 62 papers. The following topics are dealt with: device-based circuits;test;logic minimization;neural networks;circuit design;algebra;reliable systems;current-mode circuits;VLSI;completeness;spectral techniques;logic design;fuzzy logic;and EXOR logic.
The proceedings contain 22 papers. The special focus in this conference is on internationallogicprogramming Summer School. The topics include: Theory and practice in logicprogramming;constraint logicprogramming;sc...
ISBN:
(纸本)9783540559306
The proceedings contain 22 papers. The special focus in this conference is on internationallogicprogramming Summer School. The topics include: Theory and practice in logicprogramming;constraint logicprogramming;scheduling and optimisation in the automobile industry;factory scheduling using finite domains;the prince project and its applications;knowledge based PPS applications in PROTOS-L;the SECReTS banking expert system from phase 1 to phase 2;logic engineering and clinical dilemmas;a knowledge-based approach to strategic planning;expert systems in mining;natural and formal language processing;PUndIT — natural language interfaces;the esteam-316 dialogue manager;legislation as logic programs;knowledge representation for natural language processing;a set of tools for VHDL design;reasoning about logic programs;software formal specification by logicprogramming: the example of standard prolog;reverse engineering in prolog;opium — an advanced debugging system and automatic theorem proving within the portable AI lab.
The NSF/IEEE Center for Computer Applications in Electromagnetic Education (CAEME) was established in early 1990 as a result of a grant from the Undergraduate Science, Engineering, and Mathematics Division of the Nati...
详细信息
The NSF/IEEE Center for Computer Applications in Electromagnetic Education (CAEME) was established in early 1990 as a result of a grant from the Undergraduate Science, Engineering, and Mathematics Division of the National Science Foundation. To help provide broad andinternational participation in its activities, the Center is managed by the executive office of IEEE. CAEME's objective is to stimulate and accelerate the use of computers and software tools to help boost electrmagnetic education. It is shown in this paper that the Center has helped in propagating effective EM education by providing seed funds for software development projects, organizing workshops and special sessions, and through the publication of software books that contain diskettes of developed software. The Center also developed interactive video lessons and is almost self-supporting through corporate sponsorship.
Unification is known to be the most repeated operation in logicprogramming and PROLOG interpreters. To speed up the execution of logic programs, the performance of unification must be improved. We propose a parallel ...
详细信息
The CRIS language and a related temporal logic proof scheme are presented. The CRIS language, based on an extended finite-state machine model, is applied to the formal specification and implementation of logic control...
详细信息
The CRIS language and a related temporal logic proof scheme are presented. The CRIS language, based on an extended finite-state machine model, is applied to the formal specification and implementation of logic control problems and to discrete event control in general. The associated temporal logic framework allows the verification of properties of programs written in CRIS. An example, the control of a jacketed reactor, is presented, which shows the applicability of CRIS language for logic control problems and its related temporal logic framework as a tool for proving program properties.
A new approach to solving various NP-hard problems in logic synthesis, logicprogramming, graph theory, and related areas is presented. A problem to be solved is reduced to solving one or several generic combinatorial...
详细信息
A new approach to solving various NP-hard problems in logic synthesis, logicprogramming, graph theory, and related areas is presented. A problem to be solved is reduced to solving one or several generic combinatorial problems;this is called generalized propositional formula (GPF) minimization. A special massively parallel computer architecture for GPF minimization is discussed. The architecture is composed of a host computer and a data-flow tree of processors (Boolean product processor, or BPP). Each BPP consists of a product management unit and a sorting and absorbing architecture.
An algorithm is described for the location of faults in combinational circuits using the logicprogramming paradigm in the form of Prolog. It is based on the deep reasoning approach to circuit fault diagnosis, and sin...
详细信息
An algorithm is described for the location of faults in combinational circuits using the logicprogramming paradigm in the form of Prolog. It is based on the deep reasoning approach to circuit fault diagnosis, and since a failure is defined as a mismatch between expected and measured behavior, it can deal with a wider range of different types of faults than traditional test pattern generation techniques and fault dictionaries. As an example, this fault diagnosis algorithm is applied to a moderately complex combinational circuit. Very encouraging results are obtained.
暂无评论