ICIS Technical Reports:


2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987

1993

[All BiBTeX entries for this year]

A.Th.and Eekelen Peters, M.J. Plasmeijer, and Th.P. van der Weide. A CASE-tool for the development of Information Systems implemented in a pure functional language. Technical report, Computing Science Institute, Nijmegen, The Netherlands, EU, 1993.

[ Missing PDF ] [ Bibtex ]

H. Elbers, and W. Dekkers. Computer aided construction of real numbers. Technical report: CSI-N9301, September, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

P. van Bommel, C. Lucasius, and Th.P. van der Weide. Genetic Algorithms for Optimal Database Design. Technical report: CSI-R9301, February, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

T. Arts, and W. Dekkers. Embedding first order predicate logic in second order propositional logic. Technical report: CSI-R9302, February, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

P. Achten, and M.J. Plasmeijer. Beauty and the Beast. Technical report: CSI-R9303, March, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

J.E.W. Smetsers, E. Barendsen, M.C.J.D. van Eekelen, and M.J. Plasmeijer. Guaranteeing Safe Destructive Updates through a Type System with Uniqueness Information for Graphs. Technical report: CSI-R9304, June, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

H.P. Barendregt, M. Bunder, and W. Dekkers. Systems of Illative Combinatory Logic complete for first order propositional and predicate calculus. Technical report: CSI-R9305, April, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

M.-J. Nederhof, and J.J. Sarbo. Increasing the Applicability of LR Parsing. Technical report: CSI-R9306, March, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

M. Massink, and L. Rooijakkers. Completeness of the Equiational Semantics for Basic LOTOS (an extended version). Technical report: CSI-R9308, May, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

P. van Bommel. Using Conceptual Data Models for Index Selection by Means of Evolutionary Search. Technical report: CSI-R9309, Information Systems Group, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, 1993.

[ Missing PDF ] [ Bibtex ]

M.-J. Nederhof, and C.H.A. Koster. Top-Down Parsing for Left-Recursive Grammars. Technical report: CSI-R9310, June, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

L. Rooijakkers. Reshaping Funmath - Influential Documents. Technical report: CSI-R9311, June, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

M.C.J.D. van Eekelen, H. Huitema, EG.J.M.H. N�cker, J.E.W. Smetsers, and M.J. Plasmeijer. Concurrent Clean language manual. Technical report: CSI-R9313, June, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

H. Huitema, and M.J. Plasmeijer. The Concurrent Clean System User's Manual & PABCstat User's Manual. Technical report: CSI-R9314, June, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

M. van Hulst, and J.-J.Ch. Meyer. An Epistemic Proof system for Parallel Processes. Technical report: CSI-R9317, August, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

A. Compagnoni, and B.C. Pierce. Multiple Inheritance via Intersection Types. Technical report: CSI-R9318, August, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

M. Seutter. Informal introduction to the Extended Affix Grammar formalism and its compiler. Technical report: CSI-R9319, September, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

E.A. Boiten, A. Max Geerling, and Helmut A. Partsch. Transformational derivation of (parallel) programs using skeletons. Technical report: CSI-R9320, September, Radboud University Nijmegen, 1993.

[ Missing PDF ] [ Bibtex ]

A.M. Geerling. Formal derivation of SIMD parallelism from non-linear recursive specifications. Technical report: CSI-R9324, September, Radboud University Nijmegen, 1993.

This paper presents a strategy for deriving SIMD-parallel (SIMD = Single-Instruction-Multiple-Data) programs. In our formalism, programs are derived in a transformational style and parallelism is expressed by means of skeletons � higher-order functions that have a straightforward implementation on a particular architecture. Linear array and hypercube architectures and their skeletons are discussed in more detail.The strategy described is based on transformation rules for parallelisation of non-linear-recursive specifications. The rules and their interaction are illustrated by various derivations, for instance the transformation of a generic specification for divide & conquer algorithms to a linear-time implementation on hypercube architectures.

[ Missing PDF ] [ Bibtex ]

R.C.J. de Beijer. A performance comparison of asynchronous atomic broadcast protocols. Technical report: CSI-R9325, November, Radboud University Nijmegen, 1993.

A distributed fault-tolerant application is commonly structured as a group of processes communicating among themselves to perform a given task. An atomic broadcast service provides a mechanism by which a member of a group can send a message to all members of the group, and either all live members of the group recieve a message, or none do. In addition, multiple broadcast messages in a group are delivered in some specific order such as causal, or total.In this Technical Report, we compare the performance of five atomic broadcast protocols by using the discrete event simulation technique to simulate the protocols, the cummunication network and communication failures. We measure the average broadcast delivery time: average time it takes from the start of a broadcast to the time at which all group members know that all group members have delivered the broadcast; maximum message buffer size; and average number of messages per broadcast: average number of physical messages to complete the broadcast of a message. These parameters are measured under different group sizes and boradcast rates both under the assumption that no communication failures occur and under the assumption that one message is lost per broadcast.

[ Missing PDF ] [ Bibtex ]

P. van Bommel. Performance Engineering by Computer Aided Schema Transformations. Technical report: CSI-R9327, December, Information Systems Group, Computing Science Institute, University of Nijmegen, The Netherlands, 1993.

[ Missing PDF ] [ Bibtex ]

E. Barendsen, and S. Smetsers. Conventional and uniqueness typing in graph rewrite systems. Technical report: CSI-R9328, December, Radboud University Nijmegen, 1993.

In this paper we describe a Curry-like type system for graphs and extend it with uniqueness information to indicate that certain objects are only `locally accessible'. The correctness of type assignment guarantees that no external access on such an object will take place in the future. We prove that types are preserved under reduction (for both type systems) for a large class of rewrite systems. Adding uniqueness information provides a solution to two problems in implementations of functional languages: efficient space management and interfacing with non-functional operations.

[ Missing PDF ] [ Bibtex ]

N. van Diepen. From formal specification towards derivation: the MacMahon (Swiss) system. Technical report: CSI-R9329, December, Radboud University Nijmegen, 1993.

The Swiss System is originally developed as a tournament system allowing many participants to play a chess tournament in a limited number of rounds. It both avoids the drawbacks of round-robin tournaments (limited capacity) and knock-out tournaments (early drop\-outs). The system has been introduced in 1895 by Dr. J. Muller in Z\""{u}rich. Since that time it has been used in many variations at chess tournaments, and (sometimes adapted to the circumstances) at bridge, draughts and go tournaments as well. The latter variation is called the MacMahon system. Though many rule sets for the Swiss System try to formulate the proceedings for finding a pairing in an unambiguous way, it proves to be surprisingly hard to find an efficient implementation. This is due to the fact that an algorithm both has to steer clear of computing a combinatorial explosion of possible solutions when there is an abundance of allowed solutions, and on the other hand of missing a solution when there is a scarcity of allowed solutions. In this paper an attempt is made to use transformational techniques to find an almost linear algorithm for average cases from a formal specification of the problem.

[ Missing PDF ] [ Bibtex ]