Computer and information sciences topic list of research papers
-
Term Rewriting with Operator Evaluation Strategies
Abstract We consider a number of problems which arise when performing term rewriting in algebraic specifications with each operator having an evaluation strategy for its arguments. Each problem is illustrated with an 0BJ3 example. We propose a...
2005 / Steven Eker -
Integration of “Components” to Test Software Components
Abstract We present an ongoing research project aimed at developing a framework for component-based testing, in which we re-use and suitably combine some existing tools: the system architecture and the components are specified by the UML, and...
2004 / Antonia Bertolino, Eda Marchetti, Andrea Polini -
Getting Train Timetables into the Main Storage1 1This research was done in cooperation with DB Systems, Frankfurt/Main, Germany.
Abstract Organizing the data such that accesses to the background device are widely avoided is one of the main challenges in applications with large data sets. We present helpful experiences from an on-going project in which we develop an...
2004 / Matthias Müller-Hannemann, Mathias Schnee, Karsten Weihe -
Quantifier-free logic for multialgebraic theories
Abstract We develop a new quantifier-free logic for deriving consequences of multialgebraic theories. Multilagebras are used as models for nondeterminism in the context of algebraic specifications. They are many sorted algebras with set valued...
2004 / Yngve Lamo, Michał Walicki -
Enforcing Security and Safety with Proof-Carrying Code
Abstract In an environment where more and more code cannot be trusted to behave safety it is becoming necessary to employ mechanisms for detecting and preventing unsafe program behavior. This paper first reviews various such mechanisms and then...
2004 / George C. Necula -
Evaluation Strategies for Functional Logic Programming
Abstract Recent advances in the foundations and the development of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. Narrowing is a computation similar to rewriting which yields...
2004 / Sergio Antoy -
Computability and Complexity from a Programming Perspective (MFPS Draft preview)
Abstract The author's forthcoming book proves central results in computability and complexity theory from a programmer-oriented perspective. In addition to giving more natural definitions, proofs and perspectives on classical theorems by Cook,...
2004 / Neil D. Jones -
Simulating Liveness by Reduction Strategies
Abstract We define a general framework to handle liveness and related properties by reduction strategies in abstract reduction and term rewriting. Classically, reduction strategies in rewriting are used to simulate the evaluation process in...
2005 / Jürgen Giesl, Hans Zantema -
The ideal completion is not sequentially adequate
Abstract It is well known that for the case of a countable partial order, the ideal completion and the chain completion coincide. We investigate the boundary at which the chain and ideal completion do not coincide. We show in particular that the...
2005 / H.P. Künzi, M.P. Schellekens -
Annotations for Portable Intermediate Languages
Abstract This paper identifies high-level program properties that can be discovered by static analysis in a compiler front end, and that are useful for classical low-level optimizations. We suggest how intermediate language code could be annotated...
2005 / Fermín Reig -
The Leader Election Protocol of IEEE 1394 in Maude⋆ ⋆Research supported by CICYT project Desarrollo Formal de Sistemas Distribuidos (TIC97-0669-C03-01).
Abstract In this paper we consider two descriptions in Maude of the leader election protocol from the IEEE 1394 serial multimedia bus. Particularly, the time aspects of the protocol are studied. The descriptions are first validated by an exhaustive...
2005 / Alberto Verdejo, Isabel Pita, Narciso Martí-Oliet -
Comparing Calculi of Explicit Substitutions with Eta-reduction1 1Partially supported by the Brazilian CNPq research council grant number 47488101-6.
Abstract The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the implementation of typed functional programming languages and...
2004 / Mauricio Ayala-Rincón, Flávio L.C. de Moura, Fairouz Kamareddine -
An Overview of CafeOBJ2005 / Răzvan Diaconescu, Kokichi Futatsugi, Makoto Ishisone, Ataru T. Nakagawa, Toshimi Sawada
-
A Dual Language Approach Extension to UML for the Development of Time-Critical Component-Based Systems
Abstract A “dual language” component-based approach to the development of real-time critical applications is proposed. UML provides the constructs for modeling the structure of the system and the behavior of the system's components. A new...
2004 / Luigi Lavazza, Sandro Morasca, Angelo Morzenti -
Dependent Coercions1 1This work is partly supported by the UK EPSRC grant on “Subtyping, Inheritance and Reuse” (GR/K79130)
Abstract A notion of dependent coercion is introduced and studied in the context of dependent type theories. It extends our earlier work on coercive subtyping into a uniform framework which increases the expressive power with new applications. ...
2005 / Zhaohui Luo, Sergei Soloviev -
Translating a Linear Logic Programming Language into Java
Abstract There have been several proposals for logic programming language based on linear logic: Lolli [8], Lygon [7], LO [3], LinLog [2], Forum [11], HACL [10]. In these languages, it is possible to create and consume resources dynamically as...
2005 / Mutsunori Banbara, Naoyuki Tamura -
Reduction Strategies for Declarative Programming
Abstract This paper surveys reduction or evaluation strategies for functional and functional logic programs. Reasonable reduction strategies for declarative languages must be efficiently implementable to be useful in practice. On the other hand,...
2004 / Michael Hanus -
Electronic Purse Applet Certification
Abstract The paper describes the status of a joint project between Gemplus and ONERA. Gemplus developed an electronic purse running on Java enabled smart cards. The project goal is to verify security properties that should be enforced by the applets ...
2004 / P. Bieber, J. Cazin, V. Wiels, G. Zanon, P. Girard, et al. -
Generic type-preserving traversal strategies
Abstract A typed model of strategic rewriting with coverage of generic traversals is developed. The corresponding calculus offers, for example, a strategy operator □(·), which applies the argument strategy to all immediate subterms. To provide a...
2004 / Ralf Lämmel -
Fast matching in combinations of regular equational theories
Abstract We consider the problem of efficient term matching, modulo combinations of regular equational theories. Our general approach to the problem consists of three phases: compilation, matching and subproblem solving. We describe a technique for...
2004 / S. Eker