作者:
Chris McDonaldProgramming
Languages and Systems Group Department of Computer Science The University of Western Australia Crawley Western Australia
One of the greatest benefits provided by computer networks, in particular local area networks, is the ability to access files served by other computers in a network. Whereas file system concepts are first introduced i...
ISBN:
(纸本)9780897917575
One of the greatest benefits provided by computer networks, in particular local area networks, is the ability to access files served by other computers in a network. Whereas file system concepts are first introduced in Operating Systems units, many file system concepts need to be readdressed and generalized in later computer Networks units. Moreover, as students become increasingly familiar with internetworking and programs such as ftp, many of the strong links between the Operating Systems and computer Networks units may be reinforced. This paper discusses the successes experienced with two strongly related projects offered in our third year computer Networks unit. Each project requires students to support a minimal distributed file system by implementing user-level libraries which redefine a handful of operating system system calls supporting remote file access.
We consider the problem of solving linear equations over various semirings. In particular, solving of linear equations over polynomial rings with the additional restriction that the solutions must have only non-negati...
详细信息
We consider the problem of solving linear equations over various semirings. In particular, solving of linear equations over polynomial rings with the additional restriction that the solutions must have only non-negative coefficients is shown to be undecidable. Applications to undecidability proofs of several unification problems are illustrated, one of which, unification modulo one associative-commutative function and one endomorphism, has been a long-standing open problem. The problem of solving multiset constraints is also shown to be undecidable.
Building large, heterogeneous, distributed software systems poses serious problems for the software engineer;achieving interoperability of software systems is still a major challenge. We describe an experiment in desi...
详细信息
It is well known that extracting parallel loops plays a significant role in designing parallelizing compilers. The execution efficiency of a loop is enhanced when the loop can be executed in parallel or partial parall...
详细信息
ISBN:
(纸本)0818672676
It is well known that extracting parallel loops plays a significant role in designing parallelizing compilers. The execution efficiency of a loop is enhanced when the loop can be executed in parallel or partial parallel, like a DOALL or DOACROSS loop. This paper reports on the practical parallelism detector (PPD) that is implemented in PFPC (a portable FORTRAN parallelizing compiler running on OSF/1) at NCTU to concentrate on finding the parallelism available in loops. The PPD can extract the potential DOALL and DOACROSS loops in a program by invoking a combination of the ZIV test and the I test for verifying array subscripts. Furthermore, if DOACROSS loops are available, an optimization of synchronization statement is made. Experimental results show that PPD is more reliable and accurate than previous approaches.
The notion of "time" plays an important role when coordinating large, heterogeneous, distributed software systems. We present a generic coordination architecture that supports relative and absolute, discrete...
详细信息
We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for in...
详细信息
We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.
In this paper we show that the critical part of a correctness proof for implementations of higher-order functional languages is amenable to machine-assisted proof. An extended version of the lambda-calculus is conside...
详细信息
ISBN:
(纸本)3540600175
In this paper we show that the critical part of a correctness proof for implementations of higher-order functional languages is amenable to machine-assisted proof. An extended version of the lambda-calculus is considered, and the congruence between its direct and continuation semantics is proved. The proof has been constructed with the help of a generic theorem prover - Isabelle. The major part of the problem lies in establishing the existence of predicates which describe the congruence. This has been solved using Milne's inclusive predicate strategy [5]. The most important intermediate results and the main theorem as derived by Isabelle are quoted in the paper.
For finite convergent term-rewriting systems the equational unification problem is shown to be recursively independent of the equational matching problem, the word matching problem, and the (simultaneous) 2nd-order eq...
详细信息
Results of extensive computational experiments aimed at comparing performance quality (accuracy of an approximate solution and the running time) of the Threshold Accept (TA) approach versus the Simulated Annealing (SA...
详细信息
暂无评论