Skip to main content
Department of Information Technology

Division of Computer Systems: Publications from 2006

  1. Eager Markov Chains: Eager Markov Chains. Parosh Abdulla, Noomene Ben Henda, Richard Mayr, and Sven Sandberg. In Proceedings of the fourth international symposium on Automated Technology for Verification and Analysis (ATVA), pp 24-38, 2006.
  2. Limiting Behavior of Markov Chains with Eager Attractors. Parosh Abdulla, Noomene Ben Henda, Richard Mayr, and Sven Sandberg. In Third International Conference on the Quantitative Evaluation of Systems (QEST), pp 253-262, 2006.
  3. Bisimulation Minimization of Tree Automata. Parosh Aziz Abdulla, Lisa Kaati, and Johanna Högberg. In Implementation and Application of Automata, volume 4094 of Lecture Notes in Computer Science, pp 173-185, Springer-Verlag, Berlin, 2006. (DOI).
  4. Minimization of Non-deterministic Automata with Large Alphabets. Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, and Marcus Nilsson. In Implementation and Application of Automata, volume 3845 of Lecture Notes in Computer Science, pp 31-42, Springer Berlin/Heidelberg, 2006. (DOI).
  5. Proving Liveness by Backwards Reachability. Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, and Mayank Saksena. 2006.
  6. Tree Regular Model Checking: A simulation-based approach. Parosh Aziz Abdulla, Axel Legay, Julien d'Orso, and Ahmed Rezine. In Journal of Logic and Algebraic Programming, volume 69, number 1-2, pp 93-121, 2006. (DOI).
  7. Implementing Agreement Protocols in Sensor. Andreas Achtzehn, Zinaida Benenson, and Christian Rohner. In The Second International Workshop on Wireless and Sensor Networks Security (WSNS'06), 2006. (External link).
  8. Uppsala Underdogs - A Robot Soccer Project. Marianne Ahlford, Martin Andersson, Hanna Blomquist, Magnus Ekström, Lars Ericsson, Johannes Gumbel, Anna Holmgren, Petter Holmberg, Leonard Kia, Anton Lindström, Magnus Lyrberg, Shaman Mahmoudi, Bengt Nolin, Jesper Sundien, Henrik Wallentin, Olle Gällmo, Anders Hessel, Leonid Mokrushin, and Paul Pettersson. 2006. (External link).
  9. Presenter First: Organizing Complex GUI Applications for TDD. Micah Alles, David Crosby, Carl Erickson, Brian Harleton, Michael Marsiglia, Greg Pattison, and Curt Stiernstra. In Agile International Conference, Minneapolis, MN, 2006.
  10. Project Avatar Developing a Distributed Mobile Phone Game. Mattias Andreasson, Andrée Bylund, Syrus Dargahi, Daniel Johansson, Martin Larsson, Bennie Lundmark, Jonas Mellberg, Fredrik Stenh, Olle Gällmo, Anders Hessel, Leonid Mokrushin, and Paul Pettersson. Technical report / Department of Information Technology, Uppsala University nr 2006-010, 2006. (fulltext).
  11. Developing A-GPS as a Student Project. Bahram Bahar, Adam Bolcsfoldi, Jonas Falkevik, Roger Jakobsen, Kristoer Kobosko, Jimmy Kallström, Alexander Harju, Andreas Hasselberg, Johan Persson, Mattias Wadman, Olle Gällmo, Anders Hessel, Leonid Mokrushin, and Paul Pettersson. 2006. (External link).
  12. Uppaal 4.0. Gerd Behrmann, Alexandre David, Kim G. Larsen, John Håkansson, Paul Pettersson, Wang Yi, and Martijn Hendriks. In Proceedings of 3rd International Conference on Quantitative Evaluation of Systems, 2006.
  13. Verifiable Agreement: Limits of Non-Repudiation in Mobile Peer-to-Peer Ad Hoc Networks. Zinaida Beneson, Felix C. Freiling, Birgit Pfitzmann, Christian Rohner, and Michael Waidner. In Third European Workshop on Security and Privacy in Ad hoc and Sensor Networks, 2006. (External link).
  14. A Statistical Multiprocessor Cache Model. Erik Berg, Håkan Zeffer, and Erik Hagersten. In Proc. International Symposium on Performance Analysis of Systems and Software: ISPASS 2006, pp 89-99, IEEE, Piscataway, NJ, 2006. (DOI).
  15. Regular Inference for State Machines with Parameters.. Therese Berg, Bengt Jonsson, and Harald Raffelt. In Fundamental Approaches to Software Engineering, 9th International Conference, FASE 2006,, pp 107-121, 2006.
  16. Regular inference for reactive systems. Therese Berg. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2006-003, Uppsala University, 2006. (fulltext).
  17. Phenomenography as a way to research learning in computing. Anders Berglund. In Bulletin of Applied Computing and Information Technology, BACIT, volume 4, number 1, 2006. (External link).
  18. Qualitative Research Projects in Computing Education Research: An Overview.. Anders Berglund, Mats Daniels, and Arnold Pears. In Australian Computer Science Communications, volume 28, number 5, pp 25-34, 2006. (External link).
  19. Students learn CS in different ways: Insights from an empirical study. Anders Berglund and Mattias Wiggberg. In SIGCSE Bulletin inroads, volume 38, number 3, pp 265-269, 2006. (DOI).
  20. What do CS students try to learn?: Insights from a distributed, project-based course in computer systems. Anders Berglund and Anna Eckerdal. In Computer Science Education, volume 16, pp 185-195, 2006. (DOI).
  21. Computer system including a promise array. Robert Cypher, Anders Landin, and Erik Hagersten. US, 2006.
  22. A climbing robot for autonomous inspection of live power lines. Torkel Danielsson, Magnus Olsson, Daniel Ohlsson, David Wärmegård, Mattias Wiggberg, and Jakob Carlström. In Proceedings of ASER2006 3rd International Workshop on Advances in Service Robots, 2006. (External link).
  23. Model Checking Timed Automata with Priorities using DBM Subtraction. Alexandre David, John Håkansson, Kim G. Larsen, and Paul Pettersson. In Proceedings of 4th International Conference on Formal Modelling and Analysis of Timed Systems, 2006.
  24. Verification of Parameterized and Timed Systems: Undecidability Results and Efficient Methods. Johann Deneux. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 187, Acta Universitatis Upsaliensis, Uppsala, 2006. (fulltext, cover).
  25. Open Ended Group Projects (OEGP): A way of including diversity in the IT curriculum. Xristine Faulkner, Mats Daniels, and Ian Newman. In Diversity in information technology education: Issues and controversities, pp 166-195, Information Science Publishing, London, 2006.
  26. A model for evaluating asynchronous protocols in Ad hoc Networks. Laura Marie Feeney and Christian Rohner. In 6th Scandinavian Workshop on Wireless Ad-hoc Networks (ADHOC'06), 2006.
  27. Modeling Capacity in Ad Hoc Networks: Extended Poster Abstract. Laura Marie Feeney and Christian Rohner. In : Poster Session Proceedings, 2006. (External link).
  28. Poster abstract: The feasibility of leveraging a power save protocol to improve performance in ad hoc networks. Laura Marie Feeney and Christian Rohner. In The Twelfth Annual International Conference on Mobile Computing and Networking (Mobicom2006), 2006. (External link).
  29. Schedulability Analysis of Fixed Priority Systems using Timed Automata. Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi. In Theoretical Computer Science, volume 354, number 2, pp 301-317, 2006. (External link).
  30. Static and dynamic structural symmetry breaking. Pierre Flener, Justin Pearson, Meinolf Sellmann, and Pascal Van Hentenryck. In Twelfth International Conference on Principles and Practice of Constraint Programming (CP'06), 2006. (DOI, External link).
  31. A Computing Perspective on the Bologna Process. Ursula Fuller, Arnold Pears, June Amillo, Chris Avram, and Linda Mannila. In SIGCSE Bulletin: inroads, volume 38, number 4, pp 115-131, 2006. (DOI).
  32. System and method for reducing shared memory write overhead in multiprocessor systems. Oskar Grenholm, Zoran Radovic, and Erik Hagersten. US, 2006.
  33. Inference of Event-Recording Automata using Timed Decision Trees. Olga Grinchtein, Bengt Jonsson, and Paul Pettersson. In International Conference on Concurrency Theory, 2006.
  34. ARTES - Facts and figures. Roland Grönroos and Hans Hansson. In ARTES - A network for Real-Time research and graduate Education in Sweden 1997 - 2006, pp 27-41, The Department of Information Technology, Uppsala, 2006. (External link).
  35. Computing in a business context: a way to motivate and prepare. Amie Hauer and Mats Daniels. In SEFI 34th Annual Conference: Engineering Education and Active Students, p 47, 2006. (External link).
  36. Model-based Testing of a WAP Gateway: an Industrial Case-Study. Anders Hessel and Paul Pettersson. Technical report nr 045, Uppsala Universitet, Uppsala, 2006. (External link).
  37. Model-based test case selection and generation for real-time systems. Anders Hessel. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2006-002, Uppsala University, 2006. (fulltext).
  38. Simulation and evaluation of unsynchronized power saving mechanisms in wireless ad hoc networks. Philipp Hurni, Torsten Braun, and Laura Marie Feeney. In , 2006.
  39. Analyzing advanced PDE solvers through simulation. Henrik Johansson, Dan Wallin, and Sverker Holmgren. In Applied Parallel Computing: State of the Art in Scientific Computing, volume 3732 of Lecture Notes in Computer Science, pp 893-900, Springer-Verlag, Berlin, 2006. (DOI).
  40. Effective Test Driven Development for Embedded Software. Michael Karlesky, William Bereza, and Carl Erickson. In IEEE Electro/Information Technology Conference, East Lansing, MI, 2006.
  41. Connectivity Models: A New Approach to Modeling Contacts in Opportunistic Networks. Thabotharan Kathiravelu, Arnold Pears, and Nalin Ranasinghe. In Proceedings of the Eighth International Information Technology Conference (IITC) 2006, p 185, 2006.
  42. What & When?: Distributing Content in Opportunistic Networks. Thabotharan Kathiravelu and Arnold Pears. In International Conference on Wireless and Mobile Computing (ICWMC) 2006, 2006.
  43. Communicating Timed Automata: The More Synchronous, the More Difficult to Verify. Pavel Krcal and Wang Yi. IT Technical Report nr 2006-008, Uppsala: Department of Information Technology, Uppsala University, 2006. (External link).
  44. Communicating Timed Automata: The More Synchronous, the More Difficult to Verify. Pavel Krcal and Wang Yi. In Computer Aided Verification (CAV 2006), p 14, 2006. (External link).
  45. Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata. Pavel Krcal and Wang Yi. In ARTES - A network for Real-Time research and graduate Education in Sweden 1997-2006, pp 259-280, Uppsala: Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology, 2006. (External link).
  46. Evaluation of Queueing Policies and Forwarding Strategies for Routing in Intermittently Connected Networks. Anders Lindgren and Kaustubh Phanse. In First IEEE/Create-Net/ICST International Conference on COMmunication System softWAre and MiddlewaRE, 2006. (External link).
  47. Research Perspectives on the Objects-Early Debate. Raymond Lister, Anders Berglund, Tony Clear, Joe Bergin, Kathy Garvin-Doxas, Brian Hanks, Lew Hitchner, Andrew Luxton-Reilly, Kate Sanders, Carsten Schulte, and Jacqueline Whalley. In SIGCSE Bulletin: inroads, volume 38, number 4, pp 146-165, 2006. (DOI).
  48. Proceedings of the 6th ACM & IEEE International conference on Embedded software. Sang Min and Wang Yi (eds). IEEE Press, 2006.
  49. Comparing Simulation, Emulation, and Real-World Experimental Results in Mobile Ad hoc Networks. Erik Nordström, Per Gunningberg, Christian Rohner, and Oskar Wibling. In 6th Scandinavian Workshop on Wireless Ad-hoc Networks (ADHOC'06), 2006.
  50. Encouraging Deep Learning Using Student Reflections: A Case Study. Arnold Pears and Lars-Åke Larzon. In Proc. 6th Baltic Sea Conference on Computing Education Research, pp 38-45, 2006. (External link, ACM digital library).
  51. Modeling cache sharing on chip multiprocessor architectures. Pavlos Petoumenos, Georgios Keramidas, Håkan Zeffer, Stefanos Kaxiras, and Erik Hagersten. In Proc. International Symposium on Workload Characterization: IISWC 2006, pp 160-171, IEEE, Piscataway, NJ, 2006. (DOI).
  52. STATSHARE: A Statistical Model for Managing Cache Sharing via Decay. Pavlos Petoumenos, Georgios Keramidas, Håkan Zeffer, Stefanos Kaxiras, and Erik Hagersten. In 2006th Workshop on Modeling, Benchmarking and Simulation held in conjunction: with the 33rd Annual International Symposium on Computer Architecture, Boston, MA USA, June 2006, 2006.
  53. Modeling and Evaluation of a Policy Provisioning Architecture for Mobile Ad-Hoc Networks. Kaustubh Phanse, Aniket Bhat, and Luiz DaSilva. In International Journal on Network and Systems Management, volume 14, number 2, 2006. (External link).
  54. Opportunistic Wireless Access Networks. Kaustubh Phanse and Johan Nykvist. In First International ICST Conference on Access Networks, 2006.
  55. Study of IEEE 802.11 Wireless Networks in Harsh Environments. Kaustubh Phanse, Mohammad-Reza Akhavan, and Ulf Olsson. In Nineteenth International Congress and Exhibition on Condition Monitoring and Diagnostic Engineering Management, 2006. (External link).
  56. Multiprocessing systems employing hierarchical back-off locks. Zoran Radivic and Erik Hagersten. US, 2006.
  57. A bandwidth study of a DHT in a heterogeneous environment. Olof Rensfelt and Lars-Åke Larzon. 4th Swedish National Computer Networking Workshop SNCNW, Luleå, October 26-27, 2006., 2006.
  58. Maintaining a Core Literature of Computing Education Research. Stephen Seidman, Arnold Pears, Crystal Eney, Päivi Kinnunen, and Lauri Malmi. In Koli Calling: 5th Annual Finnish/Baltic Sea Conference on Computer Science Education, p 185, 2006. (External link).
  59. Methods for Creating and Exploiting Data Locality. Dan Wallin. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 176, Acta Universitatis Upsaliensis, Uppsala, 2006. (fulltext).
  60. Multigrid and Gauss-Seidel smoothers revisited: Parallelization on chip multiprocessors. Dan Wallin, Henrik Löf, Erik Hagersten, and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2006-018, 2006. (fulltext).
  61. Multigrid and Gauss-Seidel smoothers revisited: Parallelization on chip multiprocessors. Dan Wallin, Henrik Löf, Erik Hagersten, and Sverker Holmgren. In Proc. 20th ACM International Conference on Supercomputing, pp 145-155, ACM Press, New York, 2006. (DOI).
  62. Multiprocessing computer system employing capacity prefetching. Dan Wallin and Erik Hagersten. US, 2006.
  63. NoteNet. Sven Westergren, Olof Rensfelt, and Lars-Åke Larzon. In , 2006.
  64. “I Think it’s Better if Those Who Know the Area Decide About it: A Pilot Study Concerning Power in Student Project Groups in CS. Mattias Wiggberg. In Proc. 6th Annual Finnish/Baltic Sea Conference on Computer Science Education: Koli Calling, pp 27-34, 2006. (External link).
  65. Relations in Models of Calculi and Logics with Names. Kidane Yemane. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 132, Acta Universitatis Upsaliensis, Uppsala, 2006. (fulltext, cover).
  66. Exploiting Locality: A Flexible DSM Approach. Håkan Zeffer, Zoran Radovi?, and Erik Hagersten. In Proc. 20th IEEE International Parallel and Distributed Processing Symposium: (IPDPS 2006) Rhodes, Greece, April 2006, 2006.
  67. TMA: A Trap-based Memory Architecture. Håkan Zeffer, Zoran Radovi?, Martin Karlsson, and Erik Hagersten. In Proc. 20th ACM International Conference on Supercomputing, pp 259-268, 2006.
  68. Towards Low-Complexity Scalable Shared-Memory Architectures. Håkan Zeffer. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 217, Universitetsbiblioteket, Uppsala, 2006. (fulltext, cover).
  69. Inferring variable conflicts for local search. Magnus Ågren, Pierre Flener, and Justin Pearson. In Principles and Practice of Constraint Programming - CP 2006: 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006. Proceedings, 2006. (DOI).
  70. Handling Subsystems using the SaveComp Component Technology. Mikael Åkerholm, Jan Carlson, Johan Fredriksson, Hans Hansson, Mikael Nolin, Thomas Nolte, John Håkansson, and Paul Pettersson. In Proceedings of Workshop on Models and Analysis for Automotive Systems (WMAAS'06): in conjunction with the 27th IEEE Real-Time Systems Symposium (RTSS'06), 2006.

Updated  2016-12-09 16:26:05 by Peter Waites.