Department of Information Technology
Department of Information Technology
Uppsala UniversityInformation TechnologyResearchComputer Systems
Denna sida på svenska
Listen

Division of Computer Systems: Publications from 2000

  1. Symbolic Reachability Analysis Based on SAT Solvers. P.A Abdulla, P. Bjesse, and N. Een. In Proc. TACAS'00, 6th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, 2000. (External link).
  2. Better is Better than Well: On Efficient Verification of Infinite-State Systems. Parosh Aziz Abdulla and Aletta Nylen. In Proc. LICS' 00, 16th IEEE Int. Symp. on Logic in Computer Science, 2000. (External link).
  3. How do individual portable computers effect students learning?. Anders Berglund and Mats Daniels. In IEEE Frontiers in education conference, Kansas City, pp S3D7-S3D10, 2000. (External link).
  4. Impact of the Ethernet capture effect on bandwidth measurements. Mats Björkman and Bob Melander. In NETWORKING 2000, volume 1815, pp 156-167, 2000.
  5. Regular Model Checking. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. In Proc. 12th Int. Conf. on Computer Aided Verification, 2000. (External link).
  6. Reinforcement learning for admission control and routing. Jakob Carlström. Ph.D. thesis, DoCS nr 116, Acta Universitatis Upsaliensis, Uppsala, 2000.
  7. Using groupware for international collaborative learning. Tony Clear and Mats Daniels. In IEEE Frontiers in education conference, Kansas City, pp F1C18-F1C23, 2000. (External link).
  8. Using a Real-Life Setting to Combine Social and Technical Skills. Mats Daniels, Anders Jansson, Iordanis Kavathatzopoulos, and Marian Petre. In IEEE Frontiers in Education conference, Frontiers in Education, pp F4C6-F4C9, 2000. (DOI, fulltext:print).
  9. Datakommunikation. Per Gunningberg. In Professorsinstallation 2000, Uppsala Universitet, 2000. (External link).
  10. Analyzing execution-time of object-oriented programs using abstract interpretation. Jan Gustafsson. Ph.D. thesis, DoCS nr 115, Acta Universitatis Upsaliensis, Uppsala, 2000.
  11. Directory-based, shared-memory, scaleable multiprocessor computer system having deadlock-free transaction flow sans flow control protocol. Erik Hagersten. 2000.
  12. Hybrid queue and backoff computer resource lock featuring different spin speeds corresponding to multiple-states. Erik Hagersten. 2000.
  13. Method for increasing the speed of data processing in a computer system. Erik Hagersten. 2000.
  14. Teaching inter-institutional courses: sharing challenges and resources. Bruce Klein, Mats Daniels, Dianne Hagan, Anders Berglund, Annegret Goold, Mary Last, Tony Clear, and Erkki Sutinen. In ACM SIGCSE Bulletin, volume 32, number 3, pp 178-179, 2000.
  15. Efficient implementation of model-checkers for networks of timed automata. Fredrik Larsson. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2000-003, Uppsala University, 2000. (fulltext).
  16. On memory-block traversal problems in model-checking timed systems. Fredrik Larsson, Paul Pettersson, and Wang Yi. In Tools and Algorithms for the Construction and Analysis of Systems, pp 127-141, 2000.
  17. Applying configuration management techniques to component-based systems. Magnus Larsson. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2000-007, Uppsala University, 2000. (fulltext).
  18. An International Student/Faculty Collaboration: The Runestone Project. Mary Last, Vicki Almstrum, Mats Daniels, Carl Erickson, and Bruce Klein. In ACM SIGCSE Bulletin: Inroads, 2000.
  19. A complete axiomatisation for timed automata. Huimin Lin and Wang Yi. In FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science, pp 277-289, 2000.
  20. Measurement and simulation based techniques for real-time systems analysis. Markus Lindgren. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2000-010, Uppsala University, 2000. (fulltext).
  21. Distributed computing and safety critical systems in Ada. Kristina Lundqvist. Ph.D. thesis, DoCS nr 114, Acta Universitatis Upsaliensis, Uppsala, 2000.
  22. A flexible framework for detection of feature interactions in telecommunication systems. Gustaf Naeser. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2000-006, Uppsala University, 2000. (fulltext).
  23. Regular model checking. Marcus Nilsson. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2000-008, Uppsala University, 2000. (fulltext).
  24. A formalisation of the ITU-T Intelligent Network standard. Jan Nyström. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2000-009, Uppsala University, 2000. (fulltext).
  25. Time studies as a tool for (computer science) education research. Anna Sandström and Mats Daniels. In ACM Australasian computing education conference, Melbourne, 2000. (External link).
  26. Predictable high-speed communications for distributed real-time systems. Mikael Sjödin. Ph.D. thesis, DoCS nr 117, Acta Universitatis Upsaliensis, Uppsala, 2000.
  27. Active Routing for Ad-hoc Networks. Christian Tschudin, Henrik Gulbrandsen, and Henrik Lundgren. In IEEE Communications Magazine: Special issue on Active and Programmable Networks, number April, 2000. (External link).
  28. A formal approach to analysis of software architectures for real-time systems. Anders Wall. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2000-004, Uppsala University, 2000. (fulltext).
  29. Tags for High Performance Active Networks. Tilamn Wolf, Dan Decaspar, and Christian Tschudin. In The Third IEEE Conference on Open Architectures and Network Programming: OpenARCH 2000, 2000. (External link).

Updated  2016-12-09 16:24:56 by Peter Waites.