Uppsala Theses in Computing Science

Two series of theses in partial fulfillment of the requirements for the degrees of Licentiate or Doctor of Philosophy at the Computing Science Department, Uppsala University. The theses were presented in the subjects of Computing Science in Datalogi and ADB.

The first two theses are listed also as UPMAIL Technical Reports. ISSN 0283-359X

Theses in Computing Science (datalogi)

  1. Lars Thalmann, Term-Modal Logic and Quantifier-free Dynamic Assignment Logic, thesis for the degree of doctor of philosophy. December 2000, 140 pages.
  2. Greger Ottosson, Integration of Constraint Programming and Integer Programming for Combinatorial Optimization, thesis for the degree of doctor of philosophy. March 2000, 143 pages.
  3. Erik Johansson, Performance Measurements and Process Optimization for Erlang , thesis for the degree of licentiate of philosophy. October 1999, 108 pages.
  4. Per Mildner, Type Domains for Abstract Interpretation: A Critical Study , thesis for the degree of doctor of philosophy. June 1999, 236 pages.
  5. Pierangelo Dell'Acqua, Reflection Principles in Computational Logic , thesis for the degree of doctor of philosophy. September 1998.
  6. Margus Veanes, On Simultaneous Rigid E-Unification, thesis for the degree of doctor of philosophy, June 1997.
  7. Johan Montelius, Exploiting Fine-grain Parallelism in Concurrent Constraint Languages thesis for the degree of Doctor of Philosophy, May 1997.
  8. Thomas Lindgren, Compilation Techniques for Prolog , thesis for the degree of doctor of philosophy, December 1996. (summary).
  9. Johan Bevemyr, Data-parallel Implementation of Prolog , thesis for the degree of doctor of philosophy, November 1996. (summary).
  10. Sven-Olof Nyström, Denotational Semantics for Asynchronous Concurrent Languages , thesis for the degree of doctor of philosophy, April 1996. 182 pages.
  11. Magnus Nordin, IGOR: A tool for developing abstract domains for Prolog analyzers , thesis for the degree of licentiate of philosophy. September, 1995, 61 pages.
  12. Björn Carlson, Compiling and Executing Finite Domain Constraints, thesis for the degree of Doctor of Philosophy, May 1995.
  13. Pierangelo Dell'Acqua, SLD-Resolution with Reflection, thesis for the degree of Licentiate of Philosophy, January 1995.
  14. Sverker Janson, AKL --- A Multiparadigm Programming Language , thesis for the degree of Doctorate of Philosophy, June 1994.
  15. Thomas Lindgren, The Compilation and Execution of Recursion-Parallel Prolog on Shared Memory Multiprocessors, thesis for the degree of Licentiate of Philosophy, November 1993.
  16. Margus Veanes, Cycletrees: a Novel Class of Interconnection Graphs, thesis for the degree of Licentiate of Philosophy, March 1993.
  17. Johan Bevemyr, A Recursion Parallel Prolog Engine, thesis for the degree of Licentiate of Philosophy, March 1993.
  18. Björn Carlson, An Approximation Theory for Constraint Logic Programs, thesis for the degree of Licentiate of Philosophy, December 1991.
  19. Mattias Waldau, Verification of Logic Programs using Verification Sentences, thesis for the degree of Licentiate of Philosophy, December 1991.
  20. Håkan Millroth, Reforming Compilation of Logic Programs, thesis for the degree of Doctor of Philosophy, October 1990.
  21. Jonas Barklund, Parallel Unification, thesis for the degree of Doctor of Philosophy, October 1990.
  22. Sven-Olof Nyström, On the Semantics of Concurrent Logic Programming Languages: a Variable-free Concurrent Language and Its Operational Semantics, thesis for the degree of Licentiate of Philosophy, December 1989.
  23. Jonas Barklund, Efficient Logic Data Structures, thesis for the degree of Licentiate of Philosophy, May 1988.
  24. Lennart Beckman, Towards an Operational Semantics for Concurrent Logic Programming Languages, thesis for the degree of Licentiate of Philosophy, February 1987.
  25. Mats Carlsson, LM-Prolog -- the Language and its Implementation, (UPMAIL TR 30), thesis for the degree of Licentiate of Philosophy, October 1984.

Theses in Computing Science (ADB)

  1. Kent Andersson, Integrating Heuristic and Model-Based Diagnosis , thesis for the degree of Licentiate of Philosophy, May 1997.
  2. Torkel Hjerpe, High-level Specification and Efficient Solving of Constraint Satisfaction Problems , thesis for the degree of Doctor of Philosophy, September 1995.
  3. Andreas Hamfelt, Metalogic Representation of Multilayered Knowledge, thesis for the degree of Doctor of Philosophy, October 1990.
  4. Torkel Hjerpe, A First-order Theory for Representing a Class of Configuration Problems, thesis for the degree of Licentiate of Philosophy, October 1991.
  5. Lars Oestreicher, Executable Formal Descriptions for Software Design Logic and Logic Programming as a Design Tool, thesis for the degree of Licentiate of Philosophy, September 1991.
  6. Andreas Hamfelt, The Multilevel Structure of Legal Knowledge and its Representation, thesis for the degree of Licentiate of Philosophy, January 1990.
  7. Agneta Eriksson-Granskog, An Abstract Description of a Derivation Editor thesis for the degree of Licentiate of Philosophy, May 1987.
  8. Göran Hagert, Logic Modeling of Conceptual Structures: Steps Towards a Computational Theory of Reasoning, thesis for the degree of Doctor of Philosophy, May 1986.
  9. Anna-Lena Johansson, Using Symmetry and Substitution in Program Derivation, (UPMAIL TR 33), thesis for the degree of Licentiate of Philosophy, December 1985.
Thomas Lindgren / thomasl@csd.uu.se, lindgren@sics.se