| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Lerner, Mark D., et al.
(author)
-
A LISP Compiler for the DADO Parallel Computer.
- 1985
-
Reports (other academic/artistic)abstract
- This describes a LISP implementation for the Intel MCS-51 family of microprocessors, the processor used by the DADO parallel computer. This LISP IS the implementation language for the high-level parallel LISP (PPSL). It is based upon the Portable Standard Lisp (PSL) of the University of Utah. By writing PPSL in PSL we have achieved a significant degree of portability.
|
|
| 5. |
|
|
| 6. |
- Dybjer, Peter, 1953
(author)
-
Program Verification In A Logical Theory Of Constructions
- 1985
-
In: Lecture Notes in Computer Science (Functional Programming Languages and Computer Architecture, Nancy, France, September 16-19, 1985, Proceedings.; Jean-Pierre Jouannaud (Ed.). - 0302-9743 .- 1611-3349. - 3540159754 ; 201, s. 334-349
-
Conference paper (peer-reviewed)
|
|
| 7. |
- Dybjer, Peter, 1953
(author)
-
Using Domain Algebras To Prove The Correctness Of A Compiler
- 1985
-
In: Lecture Notes in Computer Science (STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings; Kurt Mehlhorn (Ed.)). - 0302-9743 .- 1611-3349. ; 182, s. 98-108
-
Conference paper (peer-reviewed)
|
|
| 8. |
- Fagerström, Johan
(author)
-
Simulation and evaluation of an architecture based on asynchronous processes
- 1985
-
Licentiate thesis (other academic/artistic)abstract
- Much research today is devoted to finding new and improved computer architectures in which parallel computations can be performed, the goal being an exploitation of the natural parallelism inherent in many problem descriptions. This thesis describes a register level simulator for a family of architectures based on asynchronous processes. An important aspect of this class of architectures is its modularity. Within the architecture, we hope to avoid the problem of dynamically binding every operation as in dataflow machines. A silicon compiler can use the modularity of descriptions to perform various optimizations on instances of the architecture. The simulator is written in a language called Occam, in which parallel execution at the statement level can be expressed. A short description of the language is given and some of the issues of designing, testing and maintaining concurrent programs are discussed. The added complexity of parallelism especially makes the debugging phase very difficult.
|
|
| 9. |
- Nordin, Henrik
(author)
-
On the use of typical cases for knowledge-based consultation and teaching
- 1985
-
Licentiate thesis (other academic/artistic)abstract
- Knowledge-based approaches to software development promise to result in important break-through both regarding our ability to solve complex problems and in improved software productivity in general. A key technique here is to separate domain knowledge from control information needed for the procedural execution of a program. However, general-purpose inference mechanisms entail certain disadvantages with respect to e.g. efficiency, focusing in problem-solving, and transparency in knowledge representation. In this licentiate thesis we propose an approach, where domain-dependent control is introduced in the form of prototypes, based on typical cases from the application domain. It is shown how this scheme results in a more effective problem-solving behaviour as compared with a traditional approach, relying entirely on rules for domain as well as control information. Further we demonstrate how the knowledge base can be easily reused for independent purposes, such as consultative problem solving and teaching respectively. Our claims are supported by implementations, both in a conventional knowledge system environment with the help of the EMYCIN system, and in a system supporting reasoned control of reasoning, namely the economic advice giving in a bank environment, in particular advice on procedures for transfers of real estates.
|
|
| 10. |
- Peng, Zebo, 1958-
(author)
-
Steps towards the formalization of designing VLSI systems
- 1985
-
Licentiate thesis (other academic/artistic)abstract
- This thesis describes an attempt to formalize the design process of VLSI systems as a sequence of semantics-preserving mappings which transforms a program-like behavioral description into a structural description. The produced structural description may then be partitioned into several potential asynchronous modules with well-defined interfaces. The proposed strategy is based on a formal computational model derived from timed Petri net and consisting of separate, but related, models of control and data parts. Partitioning of systems into submodules is provided both on the data part and on the control part, which produces a set of pairs of corresponding data subparts and control subparts and allows potential asynchronous operation of the designed systems as well as physical distribution of the modules. The use of such a formal specification also leads to the effective use of CAD and automatic tools in the synthesis process as well as providing for the possibility of verifying some aspects of a design before it is completed. CAMAD, an integrated design aid system, has been partially developed based on these formalizations. The present thesis attempts also to formulate the control/data path allocation and module partitioning problem as an optimization problem. This differs from previous approaches where ad hoc algorithms and predefined implementation structures are explicitly or implicitly used, and where a centralized control strategy is assumed.
|
|
