Skip to main content
Department of Information Technology

Division of Computer Systems: Publications from 2007

  1. Decisive Markov Chains. Parosh Abdulla, Noomene Ben Henda, and Richard Mayr. In Logical Methods in Computer Science, volume 3, number 4, pp 1-32, 2007. (DOI).
  2. Parameterized Verification of Infinite-state Processes with Global Conditions. Parosh Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Computer Aided Verification, Proceedings, volume 4590 of Lecture Notes in Computer Science, pp 145-157, 2007.
  3. Zone-Based Universality Analysis for Single-Clock Timed Automata. Parosh Abdulla, Joel Ouaknine, Karin Quaas, and James Worrell. In International Symposium on Fundamentals of Software Engineering, Proceedings, volume 4767 of Lecture Notes in Computer Science, pp 98-112, 2007.
  4. Bisimulation minimization of tree automata. Parosh Aziz Abdulla, Johanna Högberg, and Lisa Kaati. In International Journal of Foundations of Computer Science, volume 18, number 4, pp 699-713, 2007. (DOI).
  5. Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness. Parosh Aziz Abdulla, Pritha Mahata, and Richard Mayr. In Logical Methods in Computer Science, volume 3, number 1, pp 1-61, 2007. (DOI).
  6. Regular Model Checking without Transducers. Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, and Ahmed Rezine. In TACAS'07, The 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2007. (External link).
  7. Sampled universality of timed automata. Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi. In Foundations of Software Science and Computational Structures, Proceedings, volume 4423 of Lecture Notes in Computer Science, pp 2-16, 2007. (DOI).
  8. Using Forward Reachability Analysis for Verification of Timed Petri Nets. Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylén. In Nordic Journal of Computing, volume 14, number 1, pp 1-42, 2007.
  9. ARPD: Asynchronous random key predistribution in the LEAP framework for Wireless Sensor Networks. Andreas Achtzehn, Christian Rohner, and Ioana Rodhe. In 3rd IEEE International Workshop on Wireless and Sensor Networks Security (IEEE WSNS 2007), 2007. (External link).
  10. What is the word for "Engineering" in Swedish: Swedish students' conceptions of their discipline. Robin Adams, Sally Fincher, Arnold Pears, Jürgen Börstler, Jonas Boustedt, Peter Dalenius, Gunilla Eken, Tim Heyer, Andreas Jacobsson, Vanja Lindberg, Bengt Molin, Jan Erik Moström, and Mattias Wiggberg. Technical report / Department of Information Technology, Uppsala University nr 2007-018, 2007. (fulltext).
  11. ExPLoIT: Exploiting Past Location Information and Transitivity for positioning in mobile sensor networks. Christophe Baraër, Kaustubh Phanse, Johan Nykvist, and Luka Birsa. In SECOND IEEE/Create-Net/ICST International Conference on COMmunication System softWAre and MiddlewaRE, 2007. (External link).
  12. A doctoral course in research methods in computing education research: How should we teach it?. Anders Berglund, Päivi Kinnunen, and Lauri Malmi. In Proc. 7th Baltic Sea Conference on Computing Education Research: Koli Calling, pp 175-178, 2007. (External link).
  13. Debating the OO debate: Where is the problem?. Anders Berglund and Raymond Lister. In Proc. 7th Baltic Sea Conference on Computing Education Research: Koli Calling, pp 171-174, 2007. (External link).
  14. Do we teach well? Insights from Engineering Education Research: Keynote talk at the ReflekTori 2007. Anders Berglund. Helsinki University of Technology, TKK, Helsinki, Finland, 2007. (External link).
  15. How do students understand computer network protocols?. Anders Berglund and Raymond Lister. In proceedings of the 20th Annual Conference of the National Advisory Committee on Computing Qualifications (NACCQ), pp 15-29, 2007. (External link).
  16. Learning computer systems in a project course: Aims and approaches: Keynote speech at First Australasian Workshop on Applications of Phenomenography in Engineering, Computing and Science Education. Anders Berglund. University Technology, Sydney, Australia, 2007.
  17. Phenomenography: A way to study learning from the students' perspective.: Keynote presentation at Researching Phenomena: Three methodologies, three perspectives. Anders Berglund. Auckland University of Technology, Auckland, New Zeeland, 2007.
  18. Proc. 6th Baltic Sea Conference on Computing Education Research: Koli Calling. Anders Berglund and Mattias Wiggberg (eds). Volume 2007-006 of Technical report / Department of Information Technology, Uppsala University, 2007. (External link).
  19. Why I used phenomenography in "Students learn CS in different ways: Insights from an empirical study". Anders Berglund. In In Annals of Research in Engineering Education, volume 3, number 2, 2007.
  20. Testbed and Methodology for Experimental Evaluation of Opportunistic Networks. Fredrik Bjurefors, Kaustubh Phanse, Oskar Wibling, and Christian Rohner. In 7th Scandinavian Workshop on Wireless Ad-hoc Networks (ADHOC'07), 2007.
  21. Timed calculus of cryptographic communication. Johannes Borgström, Olga Grinchtein, and Simon Kramer. In Formal Aspects in Security and Trust, volume 4691 of Lecture Notes in Computer Science, pp 16-30, Springer-Verlag, Berlin, 2007. (DOI).
  22. Balancing Scaffolding and Complexity in Open Ended Group Projects (OEGPs): A Learning Theory View. Mats Daniels and Amie Hauer. In IEEE Frontiers in Education conference, pp F2G1-F2G2, 2007. (External link).
  23. Ill-structured Problem Solving in Engineering Education. Mats Daniels, Angela Carbone, Amie Hauer, and Dan Moore. In IEEE Frontiers in Education conference, pp F3F1-F3F2, 2007. (External link).
  24. Ill-structured problem solving: Invited panel. Mats Daniels, Angela Carbone, Tony Clear, and Michael de Raadt. In , 2007. (External link).
  25. Seamless Formal Verification of Complex Event Processing Applications. AnneMarie Ericsson, Paul Pettersson, Mikael Berndtsson, and Marco Seiriö. In Proceedings of the 6th Inaugural International Conference on Distributed Event-Based Systems, 2007.
  26. Leveraging a power save protocol to improve performance in ad hoc networks. Laura Marie Feeney, Christian Rohner, and Bengt Ahlgren. In ACM SIGMOBILE Mobile Computing and Communications Review, volume 11, number 2, pp 51-52, 2007. (DOI).
  27. Multi-rate relaying for performance improvement in IEEE 802.11 WLANs. Laura Marie Feeney, Bilge Cetin, Daniel Hollos, Martin Kubisch, Seble Mengesha, and Holger Karl. In , 2007.
  28. The impact of wakeup schedule distribution in asynchronous power save protocols on the performance of multihop wireless networks. Laura Marie Feeney, Christian Rohner, and Bengt Ahlgren. In IEEE Wireless Communications and Networking Conference: WCNC 2007, 2007.
  29. Task automata: Schedulability, decidability and undecidability. Elena Fersman, Pavel Krcal, Paul Pettersson, and Wang Yi. In Information and Computation, volume 205, number 8, pp 1149-1172, 2007. (DOI).
  30. Air-Traffic Complexity Resolution in Multi-Sector Planning. Pierre Flener, Justin Pearson, Magnus Ågren, Carlos Garcia Avello, and Mete Celiktin. Technical reports from the Department of Information Technology nr 2007-003, 2007. (External link).
  31. Air-traffic complexity resolution in multi-sector planning. Pierre Flener, Justin Pearson, Magnus Ågren, Carlos Garcia Avello, Mete Çeliktin, and Søren Dissing. In Journal of Air Transport Management, volume 13, number 6, pp 323-328, 2007. (DOI).
  32. Air-traffic complexity resolution in multi-sector planning using constraint programming. Pierre Flener, Justin Pearson, Magnus Ågren, Carlos Garcia Avello, Mete Celiktin, and Søren Dissing. In Proceedings of ATM'07, the 7th USA/Europe R&D Seminar on Air Traffic Management, 2007. (External link).
  33. Design of financial CDO squared transactions using constraint programming. Pierre Flener, Justin Pearson, Luis G. Reyna, and Olof Sivertsson. In Constraints, volume 12, number 2, pp 179-205, 2007. (DOI).
  34. Efficient structural symmetry breaking for constraint satisfaction problems. Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, and Magnus Ågren. In International Symmetry Conference, 2007. (External link).
  35. Structural symmetry breaking for constraint satisfaction problems. Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, and Magnus Ågren. Technical reports from the Department of Information Technology nr 2007-032, 2007. (External link).
  36. Groupoids and conditional symmetry. Ian P. Gent, Tom Kelsey, Steve Linton, Justin Pearson, and Colva Roney-Dougal. In Principles and Practice of Constraint Programming – CP 2007, pp 823-830, 2007. (DOI).
  37. WISENET Wireless Sensor Networks VINN Excellence Center. Per Gunningberg, Roland Grönroos, Ilia Katardjiev, Thiemo Voigt, Anders Ahlén, Klas Hjort, and Anders Rydberg. 2007. (External link).
  38. A Global Algorithm for Model-Based Test Suite Generation. Anders Hessel and Paul Pettersson. In Proc. 3rd Workshop on Model Based Testing: MBT 2007, volume 190:2 of Electronic Notes in Theoretical Computer Science, pp 47-59, Elsevier, 2007. (DOI).
  39. Cover - A Real-Time Test Case Generation Tool. Anders Hessel and Paul Pettersson. In 19th IFIP International Conference on Testing of Communicating Systems and 7th International Workshop on Formal Approaches to Testing of Software, 2007.
  40. Model-Based Test Case Generation for Real-Time Systems. Anders Hessel. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 301, Acta Universitatis Upsaliensis, Uppsala, 2007. (fulltext, cover).
  41. Model-based Testing of a WAP Gateway: An Industrial Case-Study. Anders Hessel and Paul Pettersson. In Formal Methods: Applications and Technology, volume 4346 of LECTURE NOTES IN COMPUTER SCIENCE, pp 116-131, 2007.
  42. Testing Real-time systems using UPPAAL. Anders Hessel, Kim G. Larsen, Marius Mikucionis, Brian Nielsen, Paul Pettersson, and Arne Skou. In Formal Methods and Testing, Springer-Verlag, 2007.
  43. Partial Order Reduction for Verification of Real-Time Components. John Håkansson and Paul Pettersson. In Formal Modeling and Analysis of Timed Systems, volume 4763 of Lecture Notes in Computer Science, pp 211-226, 2007.
  44. Systematic Acceleration in Regular Model Checking. Bengt Jonsson and Mayank Saksena. In Computer Aided Verification: CAV 2007, volume 4590 of Lecture Notes in Computer Science, pp 131-144, Springer-Verlag, Berlin, 2007. (DOI).
  45. Conserving Memory Bandwidth in Chip Multiprocessors with Runahead Execution.. Martin Karlsson and Erik Hagersten. In 21st International Parallel and Distributed Processing Symposium, 2007.
  46. Towards content distribution in opportunistic networks. Thabotharan Kathiravelu. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2007-003, Uppsala University, 2007. (fulltext).
  47. Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times. Pavel Krcal, Martin Stigge, and Wang Yi. In Formal Modeling and Analysis of Timed Systems: FORMATS 2007, volume 4763 of Lecture Notes in Computer Science, pp 274-289, 2007. (DOI).
  48. Reducing the TCP Acknowledgment Frequency. Sara Landström and Lars-Åke Larzon. In Computer communication review, volume 37, number 3, pp 5-16, 2007. (DOI).
  49. Generating Trace-Sets for Model-based Testing. Birgitta Lindström, Paul Pettersson, and Jeff Offutt. In The 18th IEEE International Symposium on Software Reliability (ISSRE '07), pp 171-180, 2007. (DOI, External link).
  50. Differing Ways that Computing Academics Understand Teaching.. Raymond Lister, Anders Berglund, Ilona Box, Chris Cope, Arnold Pears, Chris Avram, Matt Bower, Angela Carbone, Bill Davey, Michael de Raadt, Bernhard Doyle, Sue Fitzgerald, Linda Grandell, Cat Kutay, Mia Peltomäki, Judy Sheard, Simon, Ken Sutton, Des Traynor, Judy Tutty, and Anne Venables. In Australian Computer Science Communications, volume 29, number 5, pp 97-106, 2007. (External link).
  51. Students' understandings of concurrent programming. Jan Lönnberg and Anders Berglund. In Proc. 7th Baltic Sea Conference on Computing Education Research: Koli Calling, pp 77-86, 2007. (External link).
  52. A Cross-Environment Study of Routing Protocols for Wireless Multi-hop Networks. Erik Nordström, Per Gunningberg, Christian Rohner, and Oskar Wibling. IT Technical Reports nr 2007-016, 2007. (External link).
  53. Evaluating Wireless Multi-hop Networks Using a Combination of Simulation, Emulation, and Real World Experiments. Erik Nordström, Per Gunningberg, Christian Rohner, and Oskar Wibling. In Proceedings of the 1st international workshop on System evaluation for mobile platforms (MobiEval'07), pp 29-34, ACM Association for Computing Machinery, New York, 2007. (DOI).
  54. Experiences from measuring human mobility using Bluetooth inquiring devices. Erik Nordström, Christophe Diot, Richard Gass, and Per Gunningberg. In In Proceedings of the 1st international In Proceedings of the 1stinternational workshop on System evaluation for mobile platforms (MobiEval'07), pp 15-20, ACM Press, New York, 2007. (DOI, External link).
  55. A Survey of Literature on the Teaching of Introductory Programming. Arnold Pears, Stephen Seidman, Lauri Malmi, Linda Mannila, Elizabeth Adams, Jens Bennedsen, Marie Devlin, and James Paterson. In SIGCSE Bulletin inroads, volume 39, number 4, pp 204-223, 2007. (DOI).
  56. CeTUSS (Centrum för Teknikutbildning i Studenternas Sammanhang): A national center for pedagogical development in technology education. Arnold Pears and Mats Daniels. In Meeting the Growing Demand for Engineers and Their Educators 2010-2020, 2007. (External link).
  57. What's in a Publication? The Bleeding Edge of Computing Education: Keynote: 2nd Workshop on Computer Science Education. Arnold Pears. In 2nd Workshop on Computer Science Education, 2007. (External link).
  58. What’s the problem?: Teachers’ experience of student learning successes and failures. Arnold Pears, Anders Berglund, Anna Eckerdal, Philip East, Päivi Kinnunen, Lauri Malmi, Robert McCartney, Jan Erik Moström, Laurie Murphy, Mark Bartley Ratcliffe, Carsten Schulte, Beth Simon, Ioanna Stamouli, and Lynda Thomas. In Proc. 7th Baltic Sea Conference on Computing Education Research: Koli Calling, volume 88 of CRPIT, pp 207-211, Australian Computer Society, 2007. (External link).
  59. Tools and methods for evaluation of overlay networks. Olof Rensfelt. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2007-004, Uppsala University, 2007. (fulltext).
  60. Vendetta – A Tool for Flexible Monitoring and Management of Distributed Testbeds. Olof Rensfelt, Lars-Åke Larzon, and Sven Westergren. In Proc. 3rd International Conference on Testbeds and Research Infrastructure for the Development of Networks and Communities, p 8, IEEE, Piscataway, NJ, 2007. (DOI).
  61. n-LQA: n-Layers Query Authentication in Sensor Networks. Ioana Rodhe, Christian Rohner, and Andreas Achtzehn. In 3rd IEEE International Workshop on Wireless and Sensor Networks Security (IEEE WSNS 2007), 2007. (External link).
  62. Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols: (Extended Version). Mayank Saksena, Oskar Wibling, and Bengt Jonsson. IT Technical Reports nr 2007-035, 2007. (External link).
  63. Computer system employing bundled prefetching. Dan Wallin and Erik Hagersten. US, 2007.
  64. Multiprocessing computer system employing capacity prefetching. Dan Wallin and Erik Hagersten. US, 2007.
  65. Computer Science students' experiences of decision making in project groups. Mattias Wiggberg. In Proc. 7th Baltic Sea Conference on Computing Education Research: Koli Calling, pp 137-148, 2007. (External link).
  66. How does internationalisation affect learning and teaching of Computer Science: A study at Tongji University in China. Doris Dongsheng Yang and Anders Berglund. In Proc. 7th Baltic Sea Conference on Computing Education Research: Koli Calling, pp 221-224, 2007. (External link).
  67. A case for low-complexity MP architectures. Håkan Zeffer and Erik Hagersten. In Proc. Conference on Supercomputing: SC 2007, pp 559-570, ACM Press, New York, 2007. (DOI).
  68. Generic incremental algorithms for local search. Magnus Ågren, Pierre Flener, and Justin Pearson. In Constraints, volume 12, number 3, pp 293-324, 2007. (DOI).
  69. On Constraint-Oriented Neighbours for Local Search. Magnus Ågren, Pierre Flener, and Justin Pearson. Technical reports from the Department of Information Technology nr 2007-009, 2007. (External link).
  70. Revisiting constraint-directed search. Magnus Ågren, Pierre Flener, and Justin Pearson. In Proceedings of LSCS'07, the 4th International Workshop on Local Search Techniques in Constraint Satisfaction, 2007. (External link).
  71. The SAVE Approach to Component-Based Development of Vehicular Systems. Mikael Åkerholm, Jan Carlson, Johan Fredriksson, Hans Hansson, John Håkansson, Anders Möller, Paul Pettersson, and Massimo Tivoli. In Journal of Systems and Software, volume 80, number 5, pp 655-667, 2007. (DOI).

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