Division of Computer Systems: Publications from 2003

1. Algorithmic Improvements in Regular Model Checking. Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso. In CAV'03, 15th Int. Conf. Computer Aided Verification, pp 236-248, 2003.
2. Downward Closed Language Generators. Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylén. Technical report / Department of Information Technology, Uppsala University nr 2003-001, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
3. Forward Reachability Analysis of Timed Petri Nets. Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylén. Technical report / Department of Information Technology, Uppsala University nr 2003-056, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
4. Model checking of systems with many identical timed processes. Parosh Aziz Abdulla and Bengt Jonsson. In Theoretical Computer Science, volume 290, number 1, pp 241-264, 2003. (DOI).
5. Challenges in teaching capstone courses. Liz Adams, Mats Daniels, Annegret Goold, Orit Hazzan, Kathy Lynch, and Ian Newman. In ACM SIGCSE Bulletin, volume 35, number 3, pp 219-220, 2003.
6. Case studies in admission to and early performance in computer science degrees. Sylvia Alexander, June Amillo, Boyle Roger, Clark Martyn, Mats Daniels, Cary Laxer, and Ken Loose. In ACM SIGCSE Bulletin, volume 35, number 4, pp 149-153, 2003.
7. Code synthesis for timed automata. Tobias Amnell. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2003-011, Uppsala University, 2003. (fulltext).
8. TIMES: a Tool for Schedulability Analysis and Code Generation of Real-Time Systems. Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi. In Proceedings of the International Conference of Formal Modeling and Analysis of Timed Systems, 2003. (External link).
9. Times: a Tool for Schedulability Analysis and Code Generation of Real-Time Systems. Amnell T, Fersman E, Mokrushin L, Pettersson P and Yi W. In To appear in Proceedings of the 1st International Workshop on Formal Modeling and Analysis of Timed Systems, FORMATS'03, 2003.
10. A Backward/Forward Strategy for Verifying Safety Properties of Infinite-State Systems. Michael Baldamus, Richard Mayr, and Gerardo Schneider. Technical report / Department of Information Technology, Uppsala University nr 2003-065, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
11. The BDD Space Complexity of Different Forms of Complexity. Baldamus, Michael and Schneider, Klaus. In Fundamenta Informaticae, volume 50, number 2, pp 111-133, 2003.
12. On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata. Johan Bengtsson and Wang Yi. In Formal Methods and Software Engineering, 5th International Conference on Formal Engineering Methods, ICFEM 2003, Singapore, November 5-7, 2003, 2003.
13. Timed Automata: Semantics, Algorithms and Tools. Johan Bengtsson and Wang Yi. In Lectures on Concurrency and Petri Nets, Advances in Petri Nets, pp 87-124, 2003.
14. Low-Overhead Spatial and Temporal Data Locality Analysis. Erik Berg and Erik Hagersten. Technical report / Department of Information Technology, Uppsala University nr 2003-057, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
15. Methods for run time analysis of data locality. Erik Berg. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2003-015, Uppsala University, 2003. (fulltext).
16. StatCache: A Probabilistic Approach to Efficient and Accurate Data Locality Analysis. Erik Berg and Erik Hagersten. Technical report / Department of Information Technology, Uppsala University nr 2003-058, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
17. Insights to Angluin's Learning. Therese Berg, Bengt Jonsson, Martin Leucker, and Mayank Saksena. IT Technical Report 2003-039, Uppsala: Department of Information Technology, Uppsala University, 2003. (External link).
18. A Framework to study learning in an internationally distributed course.. Anders Berglund. In Communities of Practise.: Research Proceedings of the 10th Association for Learning Technology Conference (ALT-C 2003), pp 27-39, 2003.
19. Students' Understanding of Networks in an Internationally Distributed Course.. Anders Berglund and Arnold Pears. In Proceedings of 3rd IEEE International Conference of Advanced Learning Technologies (ICALT 2003)., pp 380-381, 2003.
20. What is good teaching of computer networks?.. Anders Berglund. In Proceedings of 33rd Annual Frontiers in Education, pp 2SD13-2SD19, 2003. (External link).
21. Automated test generation for industrial Erlang applications. Johan Blom and Bengt Jonsson. In Erlang Workshop 2003: Proceedings of the 2003 ACM SIGPLAN Workshop on Erlang, Uppsala, Sweden, August 29, 2003., pp 8-14, 2003.
22. Deciding LTL over Mazurkiewicz traces. Benedikt Bollig and Martin Leucker. In Data & Knowledge Engineering, volume 44, number 2, pp 221-240, 2003. (External link).
23. Model checking probabilistic distributed systems. Benedikt Bollig and Martin Leucker. In ASIAN 2003: Proceedings of the 8th Asian Computing Science Conference, pp 291-304, 2003. (External link).
24. 2D and 3D Introductory Processes in Virtual Groups. Tony Clear and Mats Daniels. In IEEE Frontiers in Education, pp S1F1-S1F6, 2003. (External link).
25. MEAD, Managing Education with Teachers at a Distance. Mats Daniels, Xristine Faulkner, and Ian Newman. In IEEE Frontiers in Education conference, pp S1F26-S1F29, 2003. (External link).
26. Runestone, the Story. Mats Daniels, Anders Berglund, and Arnold Pears. In Grundutbildningsrådets utvecklingskonferens, Gävle, 2003.
27. A Formal Semantics for UML Statecharts. Alexandre David, Johann Deneux, and Julien d'Orso. Technical report / Department of Information Technology, Uppsala University nr 2003-010, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
28. A Tool Architecture for the Next Generation of UPPAAL. Alexandre David, Gerd Behrmann, Kim G. Larsen, and Wang Yi. Technical report / Department of Information Technology, Uppsala University nr 2003-011, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
29. Hierarchical Modeling and Analysis of Real Time Systems. Alexandre David. Ph.D. thesis, Technical report / Department of Information Technology, Uppsala University nr 050, Institutionen för informationsteknologi, Uppsala, 2003.
30. Hierarchical Modeling and Analysis of Timed Systems. Alexandre David. IT Technical Report 2003-050, Uppsala: Department of Information Technology, Uppsala University, 2003. (External link).
31. Unification & Sharing in Timed Automata Verification. Alexandre David, Gerd Behrmann, Kim Larsen, and Wang Yi. In Model Checking Software, 10th International SPIN Workshop. Portland, OR, USA, May 9-10, 2003, 2003.
32. Verification of UML Statecharts with Real-Time Extensions. Alexandre David, M. Oliver Möller, and Wang Yi. Technical report / Department of Information Technology, Uppsala University nr 2003-009, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
33. Analysis of the Execution Time Unpredictability caused by Dynamic Branch Prediction. Jakob Engblom. In RTAS 2003: Proceedings of the 9th IEEE Real-Time and Embedded Technology and Applications Symposium, May 27-30, 2003, Toronto, Canada, pp 152-159, 2003.
34. Der ausgequetschte Code (3 part article). Jakob Engblom, Thomas Watzlawick, and Andreas Barth. In Elektronik, number 8, 10, 12, 2003.
35. Embedded Systems Computer Architecture: Extended abstract in the Proc. of European Summer School on Embedded Systems. Jakob Engblom. In Proceedings of European Summer School on Embedded Systems: Västerås, September 2003, 2003.
36. Execution-Time Analysis for Embedded Real-Time Systems. Jakob Engblom, Andreas Ermedahl, Mikael Sjödin, Jan Gustafsson, and Hans Hansson. In International Journal on Software Tools for Technology Transfer, volume 4, number 4, pp 437-455, 2003.
37. Full-System Simulation Technology: Extended abstract in the proceedings of ESSES 2003 (European Summer School on Embedded Systems). Jakob Engblom. In Proc. of the European Summer School on Embedded Systems: Västerås, September 2003, 2003.
38. Full-System Simulation Technology: Extended abstract appearing in the proceedings of ESSES 2003 (European Summer School on Embedded Systems). Jakob Engblom. 2003.
39. Make Haste, Not Waste: Automated System Testing. Carl Erickson, Ralph Palmer, David Crosby, Michael Marsiglia, and Micah Alles. In Extreme Programming and Agile Methods: XP Agile Universe 2003, Springer, 2003.
40. Make Haste, Not Waste: Automated System Testing. Carl Erickson, Ralph Palmer, David Crosby, Michael Marsiglia, and Micah Alles. In Extreme Programming and Agile Methods - XP/Agile Universe 2003, pp 120-128, 2003. (External link).
41. A Modular Tool Architecture for Worst-Case Execution Time Analysis. Andreas Ermedahl. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 45, Acta Universitatis Upsaliensis, Uppsala, 2003. (fulltext).
42. Clustered Calculation of Worst-Case Execution Times. Andreas Ermedahl, Friedhelm Stappert, and Jakob Engblom. In Proceedings of the 6th International Conference on Compilers, Architectures, and Synthesis for Embedded Systems (CASES 2003), 2003.
43. A Generic Approach to Schedulability Analysis of Real-Time Systems. Elena Fersman. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 49, Acta Universitatis Upsaliensis, Uppsala, 2003. (fulltext).
44. Schedulability Analysis using Two Clocks. Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003. (External link).
45. Breaking symmetries in matrix models: A brief overview.. Pierre Flener, Alan M. Frisch, Brahim Hnich, Chris Jefferson, Zeynep Kiziltan, Ian Miguel, Justin Pearson, and Toby Walsh. In Proceedings of the Tenth Workshop on Automated Reasoning (ARW'03), 2003. (External link).
46. Latency-hiding and Optimizations of the DSZOOM Instrumentation System. Oskar Grenholm, Zoran Radovic, and Erik Hagersten. IT Technical Report 2003-029, Uppsala: Department of Information Technology, Uppsala University, 2003. (External link).
47. Beyond adhoc networking. Selfconfiguring Networks and Terminal. Per Gunningberg. In The first COST-IST(EU)NSF(USA) Workshop on Exchanges and Trends in Networking, 2003. (External link).
48. Communication error reporting mechanism in a multiprocessing computer system. Erik Hagersten. 2003.
49. Methods and apparatus for a directory-less memory access protocol in a distributed shared memory computer system. Erik Hagersten. 2003.
50. Multiprocessing systems employing hierarchical spin locks. Erik Hagersten. 2003.
51. Queuing delay limiter. Erik Hagersten. 2003.
52. Selective address translation in coherent memory replication. Erik Hagersten. 2003.
53. System and method for accessing a shared computer resource using a lock featuring different spin speeds corresponding to multiple states. Erik Hagersten. 2003.
54. Time-Optimal Test Cases for Real-Time Systems. Anders Hessel, Kim Larsen, Brian Nielsen, Paul Pettersson, and Arne Skou. In 1st International Workshop on Formal Modeling and Analysis of Timed Systems, 2003.
55. Generating on-line test oracles from temporal logic specifications. John Håkansson, Bengt Jonsson, and Ola Lundqvist. In International Journal on Software Tools for Technology Transfer, volume 4, number 4, pp 456-471, 2003.
56. Cache memory design trade-offs for current and emerging workloads. Martin Karlsson. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2003-009, Uppsala University, 2003. (fulltext).
57. Memory System Behavior of Java-Based Middleware. Martin Karlsson, Kevin Moore, Erik Hagersten, and David Wood. In Proceedings of the Ninth International Symposium on High Performance Computer Architecture, 2003. (External link).
58. TImestamp-based Selective Cache Allocation. Martin Karlsson and Erik Hagersten. In High Performance Memory Systems, Springer-Verlag, 2003.
59. Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata. Pavel Krcal and Wang Yi. Technical report / Department of Information Technology, Uppsala University nr 2003-051, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
60. Compact Data Structure and State-Space Reduction for Model-Checking Real-Time Systems. Kim Larsen, Fredrik Larsson, Paul Pettersson, and Wang Yi. In The International Journal of Time-Critical Computing Systems, volume 25, number 2, pp 255-275, 2003. (External link).
61. Parallel model checking for LTL, CTL* and Lmu2. Martin Leucker, Rafal Somla, and Michael Weber. In PDMC 2003: 2nd International Workshop on Parallel and Distributed Model Checking, pp 4-16, 2003. (External link).
62. DIMA: Distributed Instant Messaging System. Henrik Lundgren, Erik Nordström, Richard Gold, and Mattias Wiggberg. In 1st Swedish National Computer Networking Conference, 2003.
63. THROOM: Running POSIX Multithreaded Binaries on a Cluster. Henrik Löf, Zoran Radovi?, and Erik Hagersten. Technical report / Department of Information Technology, Uppsala University nr 2003-026, 2003. (fulltext).
64. THROOM — Supporting POSIX Multithreaded Binaries on a Cluster. Henrik Löf, Zoran Radovi?, and Erik Hagersten. In Euro-Par 2003: Parallel Processing, volume 2790 of Lecture Notes in Computer Science, pp 760-769, Springer-Verlag, Berlin, 2003. (DOI).
65. Scalability aspects of validation. Tiziana Margaria and Wang Yi. In International Journal on Software Tools for Technology Transfer, volume 5, number 1, 2003.
66. Probing-Based Approaches to Bandwidth Measurements and Network Path Emulation. Bob Melander. Ph.D. thesis, Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 784, Acta Universitatis Upsaliensis, Uppsala, 2003. (fulltext).
67. Open Ended Group Projects a 'Tool' for More Effective Teaching. Ian Newman, Mats Daniels, and Xristine Faulkner. In Australian Computer Science Communications, volume 25, number 5, pp 95-103, 2003.
68. Open Ended Group Projects a 'tool' for more effective teaching. Ian Newman, Mats Daniels, and Xristine Faulkner. In ACM Australasian computing education conference, Adelaide, 2003.
69. Compact Constraints for Verification of Well Quasi-Ordered Programs. Aletta Nylén. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 51, Acta Universitatis Upsaliensis, Uppsala, 2003.
70. Undecidability of LTL for Timed Petri Nets. Parosh, Aziz Abdulla and Aletta Nylén. 2003.
71. Verification of Probabilistic Systems with Faulty Communication. Parosh, Aziz Abdulla and Alexander Rabinovich. In FOSSACS'03, Foundations of Software Science and Computation Structures, 2003.
72. Deciding Monotonic Games.. Parosh Aziz Abdulla, Ahmed Bouajjani, and Julien d'Orso.. In CSL/KGC'03, Computer Science Logic and 8th Kurt Gödel Colloquium, 2003.
73. Enriching Online Learning Resources with "Explanograms". Arnold Pears and Carl Erickson. In ISICT '03: Proceedings of the 1st international symposium on Information and communication technologies, pp 261-266, 2003. (External link).
74. Structuring CSEd Research Studies: Connecting the Pieces. Arnold Pears and Mats Daniels. In ACM SIGCSE Bulletin, volume 35, number 3, pp 149-153, 2003. (DOI, External link).
75. Where Are You? Wireless Way's to Enhance Collaboration.. Arnold Pears and Marc-Aurele Brothier. In Frontiers in Education, p 2300, 2003. (DOI, External link).
76. Comma-free codes. Justin Pearson. 2003. (External link).
77. Addressing the Requirements of QoS Management for Wireless Ad Hoc Networks. Kaustubh Phanse and Luiz DaSilva. In International Journal on Computer Communications, volume 26, number 12, 2003. (External link).
78. Efficient synchronization and coherence for nonuniform communication architectures. Zoran Radovi?. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2003-008, Uppsala University, 2003. (fulltext).
79. Hierarchical Backoff Locks for Nonuniform Communication Architectures. Zoran Radovic and Erik Hagersten. In Proceedings of the Ninth International Symposium on High Performance Computer Architecture (HPCA-9), Anaheim, California, USA, February 2003., 2003. (External link).
80. Invariance kernels of Polygonal Differential Inclusions. Gerardo Schneider. Technical report / Department of Information Technology, Uppsala University nr 2003-042, 2003. (fulltext).
81. MARCH: a distributed content adaptation architecture. Ardon Sebastien, Per Gunningberg, Björn Landfeldt, Yuri Ismailov, Marcus Portmann, and Aruna Seneviratne. In International Journal of Communication Systems: Special Issue: Wireless Access to the Global Internet: Mobile Radio Networks and Satellite Systems, volume March, number 1, 2003. (External link).
82. The Elbow Cache: A Power-Efficient Alternative to Highly Associative Caches. Mathias Spjuth, Martin Karlsson, and Erik Hagersten. Technical report / Department of Information Technology, Uppsala University nr 2003-046, Uppsala: Department of Information Technology, Uppsala University, 2003. (fulltext).
83. Embedding MANETs in the Real World. Christian Tschudin, Henrik Lundgren, and Erik Nordström. In IFIP-TC6 8th International Conference, Personal Wireless Communications (PWC 2003), Venice, Italy, September 23-25, 2003. Conti, M.; Giardano, S.; Gregori, E.; Olariu, S. (Ed.), pp 578-589, 2003.
84. LUNAR: Lightweight Underlay Network Ad-hoc Routing. Christian Tschudin and Richard Gold. IT Technical Report 2003-021, Uppsala: Department of Information Technology, Uppsala University, 2003. (External link).
85. SelNet: A Translating Underlay Network. Christian Tschudin and Richard Gold. IT Technical Report 2003-020, Uppsala: Department of Information Technology, Uppsala University, 2003. (External link).
86. Polyadic History-Dependent Automata for the Fusion Calculus. Emilio Tuosto, Björn Victor, and Kidane Yemane. Technical report / Department of Information Technology, Uppsala University nr 2003-062, 2003. (fulltext).
87. Concurrency, Time, and Constraints. Frank Valencia. In Logic Programming, 19th International Conference, pp 72-101, 2003.
88. Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL. Frank Valencia. In Logic Programming, 19th International Conference, pp 422-437, 2003.
89. Tractable symmetry breaking for CSPs with interchangeable values.. Pascal Van Hentenryck, Pierre Flener, Justin Pearson, and Magnus Ågren. In Proceedings of the eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003), pp 277-282, 2003. (External link).
90. Bundling: Reducing the Overhead of Multiprocessor Prefetchers. Dan Wallin and Erik Hagersten. IT Technical Report 2003-037, Uppsala: Department of Information Technology, Uppsala University, 2003. (External link).
91. Cache Memory Behavior of Advanced PDE Solvers. Dan Wallin, Henrik Johansson, and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2003-044, 2003. (fulltext).
92. Exploiting data locality in adaptive architectures. Dan Wallin. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2003-010, Uppsala University, 2003. (fulltext).
93. Miss Penalty Reduction Using Bundled Capacity Prefetching in Multiprocessors. Dan Wallin and Erik Hagersten. In Proceedings of the 17th InternationalParallel and Distributed Processing Symposium (IPDPS 2003), Nice, France, 2003.
94. Inter-networking MPLS and SelNet. Andreas Westling. Uppsala Universitet, 2003.
95. Industrial Requirements for WCET Tools -- Answers to the ARTIST Questionnaire. Reinhard Wilhelm, Jakob Engblom, Stephan Thesing, and David Whalley. In WCET 2003: Proceedings of the 3rd International Workshop on Worst-Case Execution Time Analysis, WCET 2003 - a Satellite Event to ECRTS 2003, Polytechnic Institute of Porto, Portugal, July 1,, pp 39-43, 2003.
96. New Directions in Symbolic Model Checking. Julien d'Orso. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 50, Acta Universitatis Upsaliensis, Uppsala, 2003. (fulltext).