Computer and information sciences topic list of research papers
-
On leaf permutative theories and occurrence permutation groups
Abstract Leaf permutative theories contain variable-permuting equations, so that rewriting a term may lead to an exponential number of terms which are only permutations of it. In [1] Avenhaus and Plaisted propose to represent such sets by stratified ...
2004 / Thierry Boy de la Tour, Mnacho Echenim -
Towards Proof Planning for M ω+1 1This work was supported in part by the National Science Foundation NSF under grants CCR-0133502 and INT-9909952, and by the German Academic Exchange Service DAAD.
Abstract This paper describes the proof planning system P ω + for the meta theorem prover for LF implemented in Twelf. The main contributions include a...
2004 / Carsten Schürmann, Serge Autexier -
Rule Formats for Timed Processes
Abstract Building on previous work (15,8), this paper describes two syntactic ways of defining ‘well-behaved’ operational semantics for timed processes. In both cases, the semantic rules are derived from abstract operational rules for behaviour...
2004 / Marco Kick -
A Case Study in Abstract Interpretation Based Program Transformation
Abstract We illustrate the design of correct semantics-based program transformations by abstract interpretation on blocking code elimination.
2004 / Patrick Cousot, Radhia Cousot -
Reducts Versus Constructs
Abstract A reduct is one of the main notions in the Rough Sets Theory (RST). The idea of the reduct proved to be interesting enough to inspire a great deal of research resulting in various reduct-related notions and concepts. Reducts have been the...
2004 / Robert Susmaga -
DPO Rewriting and Abstract Semantics via Opfibrations
Abstract The classical DPO graph rewriting construction is re-expressed using the opfibration approach introduced originally for term graph rewriting. Using a skeleton category of graphs, a base of canonical graphs-in-context, with DPO rules as...
2005 / R. Banach -
A Safe Relational Calculus for Functional Logic Deductive Databases1 1This work has been partially supported by the Spanish project of the Ministry of Science and Technology “INDALOG” TIC2002-03968.
Abstract In this paper, we present an extended relational calculus for expressing queries in functional-logic deductive databases. This calculus is based on first-order logic and handles relation predicates, equalities and inequalities over...
2004 / Jesús M. Almendros-Jiménez, Antonio Becerra-Terón -
The Universe of Approximations
Abstract The idea of approximate entailment has been in [13] as a way of modeling the reasoning of an agent with limited resources. They proposed a system in which a family of logics, parameterized by a set of propositional letters, approximates...
2004 / Marcelo Finger, Renata Wassermann -
Preface2005 / Jean-Louis Giavitto, Pierre-Etienne Moreau
-
Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
Abstract We give a high-level overview of our recent results which extend and unify the lines of research initiated by Meseguer and Montanari under the motto “Petri nets are monoids”, and by Marti-Oliet, Meseguer and other authors in their linear...
2004 / Mark-Oliver Stehr, José Meseguer, Peter Csaba Ölveczky -
A Tool Support for Reusing ELAN Rule-Based Components1 1This work is supported by a joint research project funded by CNPq and INRIA. It has been partly performed while the first and third authors were visiting LORIA.
Abstract The adaptation of software components developed for a specific application in order to generate reusable components often includes some kind of generalization. This generalization may be carried out, for instance, by the renaming of some...
2004 / Anamaria Martins, Christophe Ringeissen, Anderson Santana -
A Universal Approach to Refinement and Closure of Automata by Macros and Overloading
Abstract Starting with the notion of a deterministic automaton, we formalize and explore the concepts of macros, operator overloading and refinement. The category of automata whose arrows are refinements is defined and two closure operators...
2005 / Andrew Solomon -
A Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems2003 / Michael S. White, Stuart J. Flockton
-
Formal Verification based on Boolean Expression Diagrams
Abstract This dissertation examines the use of a new data structure called Boolean Expression Diagrams (BEDs) in the area of formal verification. The recently developed data structure allows fast and efficient manipulation of Boolean formulae. Many...
2004 / Poul Frederick Williams -
Exact Acceleration of Real-Time Model Checking
Abstract Different time scales do often occur in real-time systems, e.g., a polling real-time system samples the environment many times per second, whereas the environment may only change a few times per second. When these systems are modeled as...
2004 / Martijn Hendriks, Kim G. Larsen -
Solving Equations by Graph Transformation1 1Research partially supported by the TMR Network GETGRATS and the ESPRIT Working Group APPLIGRAPH.
Abstract We review the concept of term graph narrowing as an approach for solving equations by transformations on term graphs. Term graph narrowing combines term graph rewriting with first-order term unification. This mechanism is complete for all...
2004 / Annegret Habel, Detlef Plump -
Static verification of dynamically detected program invariants
Abstract This paper shows how to integrate two complementary techniques for manipulating program invariants: dynamic detection and static verification. Dynamic detection proposes likely invariants based on program executions, but the resulting...
2004 / Jeremy W. Nimmer, Michael D. Ernst -
Continuous Domains in Logical Form1 1A thesis submitted to The University of Birmingham for the degree of Doctor of Philosophy, June 1999.
Abstract This thesis investigates the mathematical foundations that are necessary for an extension of Abramsky's domain theory in logical form to continuous domains. We present a multi-lingual sequent calculus, that is a positive...
2004 / Mathias Kegelmann -
Scalable System-level CTI Testing through Lightweight Coarse-grained Coordination
Abstract We propose a solution to the problem of system-level testing of functionally complex communication systems based on lightweight coordination. The enabling aspect is here the adoption of a coarse-grained approach to test design, which is...
2004 / Tiziana Margaria, Bernhard Steffen -
Augmentative and Alternative Communication – Support for People with Severe Speech Disorders
Abstract Frequently, a child with severe disabilities is in an early stage of communication development, which is a disadvantage compared to the chronological age. Although the child may display a repertoire of some early communication behaviors, it ...
2014 / Elena Simion