Skip to main content
Department of Information Technology

Division of Computer Systems: Publications from 2008

  1. Monotonic Abstraction in Parameterized Verification. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Electronic Notes in Theoretical Computer Science, volume 223, pp 3-14, 2008. (DOI).
  2. Composed Bisimulation for Tree Automata. Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In Implementation and Application of Automata, volume 5148 of Lecture Notes in Computer Science, pp 212-222, Springer Berlin/Heidelberg, 2008. (DOI).
  3. Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata. Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In Tools and Algorithms for the Construction and Analysis of Systems, volume 4963 of Lecture Notes in Computer Science, pp 93-108, Springer Berlin/Heidelberg, 2008. (DOI).
  4. Handling parameterized systems with non-atomic global conditions. Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, and Ahmed Rezine. In Verification, Model Checking, and Abstract Interpretation, volume 4905 of Lecture Notes in Computer Science, pp 22-36, Springer-Verlag, Berlin, 2008. (DOI).
  5. Model Checking Race-Freeness. Parosh Aziz Abdulla, Frédéric Haziza, and Mats Kindahl. In Proc. 1st Swedish Workshop on Multi-Core Computing, volume 2008:07 of Research report / Blekinge Institute of Technology, pp 89-96, 2008.
  6. Model checking race-freeness. Parosh Aziz Abdulla, Frédéric Haziza, and Mats Kindahl. In SIGARCH Computer Architecture News, volume 36, number 5, pp 72-79, 2008. (DOI).
  7. Monotonic abstraction for programs with dynamic memory heaps. Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric Haziza, and Ahmed Rezine. In Computer Aided Verification, volume 5123 of Lecture Notes in Computer Science, pp 341-354, Springer-Verlag, Berlin, 2008. (DOI).
  8. Monotonic abstraction in action: Automatic verification of distributed mutex algorithms. Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Theoretical Aspects of Computing - ICTAC 2008, volume 5160 of Lecture Notes in Computer Science, pp 50-65, Springer-Verlag, Berlin, 2008. (DOI).
  9. Monotonic and downward closed games. Parosh Aziz Abdulla, Ahmed Bouajjani, and Julien d'Orso. In Journal of logic and computation (Print), volume 18, number 1, pp 153-169, 2008. (DOI).
  10. Parameterized tree systems. Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Frédéric Haziza, and Ahmed Rezine. In Formal Techniques for Networked and Distributed Systems: FORTE 2008?, volume 5048 of Lecture Notes in Computer Science, pp 69-83, Springer-Verlag, Berlin, 2008. (DOI).
  11. R-automata. Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi. In CONCUR 2008 - Concurrency Theory, volume 5201 of Lecture Notes in Computer Science, pp 67-81, Springer-Verlag, Berlin, 2008. (DOI).
  12. Stochastic games with lossy channels. Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, and Sven Sandberg. In Foundations of Software Science and Computational Structures: Proceedings, volume 4962 of Lecture Notes in Computer Science, pp 35-49, Springer-Verlag, Berlin, 2008. (DOI).
  13. Universality Analysis for One-Clock Timed Automata. Parosh Aziz Abdulla, Johann Deneux, Joel Ouaknine, Karin Quaas, and James Worrell. In Fundamenta Informaticae, volume 89, number 4, pp 419-450, 2008.
  14. Presentation of the VINN Excellence Center for Wireless Sensor Networks (WISENET). Anders Ahlén, Bengt Ahlgren, Roland Grönroos, Per Gunningberg, Klas Hjort, Ilia Katardjiev, Christian Rohner, and Anders Rydberg. In Conference on Radio Science (RVK08), Växjö, 2008.
  15. Infinite-state Stochastic and Parameterized Systems. Noomene Ben Henda. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 76, Acta Universitatis Upsaliensis, Uppsala, 2008. (fulltext).
  16. Re?nement Types for Secure Implementations. Jesper Bengtson, Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon, and Sergio Maffeis. In Proc. 21st IEEE Computer Security Foundations Symposium, pp 17-32, IEEE, Piscataway, NJ, 2008. (DOI, fulltext).
  17. Regular Inference for State Machines Using Domains with Equality Tests. Therese Berg, Bengt Jonsson, and Harald Raffelt. In Fundamental Approaches to Software Engineering, volume 4961 of Lecture Notes in Computer Science, pp 317-331, Springer-Verlag, Berlin, 2008. (DOI).
  18. Disseminating phenomenography: Workshops for the computing education research community. Anders Berglund, Ilona Box, Anna Eckerdal, Raymond Lister, and Arnold Pears. In Proc. EARLI SIG 9 Workshop on Phenomenography and Variation Theory: Implications of Phenomenography and Variation Theory in Practice, pp 17-18, Kristianstad Academic Press, Sweden, 2008. (Proceedings).
  19. Learning educational research methods through collaborative research: the PhICER initiative. Anders Berglund, Ilona Box, Anna Eckerdal, Raymond Lister, and Arnold Pears. In Australian Computer Science Communications, volume 30, number 5, pp 35-42, 2008. (External link).
  20. Students learn CS in different ways: Insights from an empirical study: (Invited talk). Anders Berglund and Mattias Wiggberg. Australian Computer Society, 2008. (External link).
  21. Three Ways of Globalizing IT Engineering Education: Experiences from Two European Universities. Anders Berglund, Marie Gottlieb, Mats Daniels, Arne John Glenstrup, Arnold Pears, and John Paulin Hansen. In International Conference on Science, Technology and Education Policy: Engineering Education, Innovation and Globalization, pp 63-67, Hangzhou, China, 2008. (fulltext:print).
  22. A Testbed for Evaluating Delay Tolerant Network Protocol Implementations. Fredrik Bjurefors and Oskar Wibling. In Proceedings 5th Swedish National Computer Networking Workshop, 2008.
  23. Regular Inference for Communication Protocol Entities. Therese Bohlin and Bengt Jonsson. Technical report / Department of Information Technology, Uppsala University nr 2008-024, 2008. (fulltext).
  24. On-line placement of real-time tasks on 2D partially run-time reconfigurable FPGAs. Qingxu Deng, Fanxin Kong, Nan Guan, Mingsong Lv, and Wang Yi. In Proc. 5th IEEE International Symposium on Embedded Computing, pp 20-25, IEEE, Piscataway, NJ, 2008. (DOI).
  25. Timed Automata Patterns. Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, and Wang Yi. In IEEE Transactions on Software Engineering, volume 34, number 6, pp 844-859, 2008. (DOI).
  26. Exploring semantic interference in heterogeneous sensor networks. Laura Marie Feeney. In , pp 45-51, ACM Press, New York, 2008. (DOI).
  27. Solving necklace constraint problems. Pierre Flener and Justin Pearson. In Proc. 18th European Conference on Artificial Intelligence, pp 520-524, IOS Press, Amsterdam, The Netherlands, 2008.
  28. Adaptive QoS Routing for Significant Events in Wireless Sensor Networks. Erol Gelenbe and Edith C.-H. Ngai. In Proc. 5th International Conference on Mobile Ad Hoc and Sensor Systems, pp 410-415, IEEE, Piscataway, NJ, 2008. (DOI).
  29. Inference of Event-Recording Automata using Timed Decision Trees. Olga Grinchtein and Bengt Jonsson. Technical report / Department of Information Technology, Uppsala University nr 2008-014, 2008. (fulltext).
  30. Learning of Event-Recording Automata. Olga Grinchtein, Bengt Jonsson, and Martin Leucker. Technical report / Department of Information Technology, Uppsala University nr 2008-013, 2008. (fulltext).
  31. Learning of Timed Systems. Olga Grinchtein. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 434, Acta Universitatis Upsaliensis, Uppsala, 2008. (fulltext, cover).
  32. Network invariants for real-time systems. Olga Grinchtein and Martin Leucker. In Formal Aspects of Computing, volume 20, number 6, pp 619-635, 2008. (DOI).
  33. New schedulability test conditions for non-preemptive scheduling on multiprocessor platforms. Nan Guan, Wang Yi, Zonghua Gu, Qingxu Deng, and Ge Yu. In Proc. Real-Time Systems Symposium: RTSS 2008, pp 137-146, IEEE, Piscataway, NJ, 2008. (DOI).
  34. Improving cache utilization using Acumem VPE. Erik Hagersten, Mats Nilsson, and Magnus Vesterlund. In Tools for High Performance Computing, pp 115-135, Springer-Verlag, Berlin, 2008. (DOI).
  35. A Learning Theory Perspective on Running Open Ended Group Projects (OEGPs). Amie Hauer and Mats Daniels. In Australian Computer Science Communications, volume 30, number 5, pp 85-92, 2008. ().
  36. Extended pi-Calculi. Magnus Johansson, Joachim Parrow, Björn Victor, and Jesper Bengtson. In Automata, Languages and Programming, PT 2: Proceedings of ICALP 2008, volume 5126 of Lecture Notes in Computer Science, pp 87-98, 2008. (DOI).
  37. Cyclic dependencies in modular performance analysis. Bengt Jonsson, Simon Perathoner, Lothar Thiele, and Wang Yi. In Proc. 8th ACM International Conference on Embedded Software, pp 179-188, ACM Press, New York, 2008. (DOI).
  38. State-Space Exploration for Concurrent Algorithms under Weak Memory Orderings. Bengt Jonsson. In Proc. 1st Swedish Workshop on Multi-Core Computing, volume 2008:07 of Research report / Blekinge Institute of Technology, pp 82-88, 2008.
  39. State-space exploration for concurrent algorithms under weak memory orderings. Bengt Jonsson. In SIGARCH Computer Architecture News, volume 36, number 5, pp 65-71, 2008. (DOI).
  40. Reduction Techniques for Finite (Tree) Automata. Lisa Kaati. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 562, Acta Universitatis Upsaliensis, Uppsala, 2008. (fulltext).
  41. Challenged Networking: An Experimental Study of new Protocols and Architectures. Erik Nordström. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 450, Acta Universitatis Upsaliensis, Uppsala, 2008. (fulltext).
  42. Stepping Stones: Capacity building in engineering education. Arnold N. Pears, Sally Fincher, Robin Adams, and Mats Daniels. In Proc. 38th ASEE/IEEE Frontiers in Education Conference, pp 307-312, IEEE, Piscataway, NJ, 2008. (DOI).
  43. An Interactive Test-bed for Heterogeneous Wireless Sensor Networks.. Olof Rensfelt, Frederik Hermans, Christofer Ferm, Per Gunningberg, and Lars-Åke Larzon. In DCOSS demo proceedings, volume 5067 of Lecture Notes in Computer Science, Springer Verlag, 2008.
  44. Parameterized Systems: Generalizing and Simplifying Automatic Verification. Ahmed Rezine. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 72, Acta Universitatis Upsaliensis, Uppsala, 2008. (fulltext).
  45. Query authentication and data confidentiality in wireless sensor networks. Ioana Rodhe. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2008-002, Uppsala University, 2008. (fulltext).
  46. n-LDA: n-Layers Data Aggregation in Sensor Networks. Ioana Rodhe and Christian Rohner. In Proc. 28th International Conference on Distributed Computing Systems Workshops, pp 400-405, IEEE, Piscataway, NJ, 2008. (DOI).
  47. Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. Mayank Saksena, Oskar Wibling, and Bengt Jonsson. In Tools and Algorithms for the Construction and Analysis of Systems, volume 4963 of Lecture Notes in Computer Science, pp 18-32, Springer-Verlag, Berlin, 2008. (DOI).
  48. Verifying Absence of ? Loops in Parameterized Protocols. Mayank Saksena. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 419, Acta Universitatis Upsaliensis, Uppsala, 2008. (fulltext).
  49. A bound on the overlap of same-sized subsets. Olof Sivertsson, Pierre Flener, and Justin Pearson. In Annals of Combinatorics, volume 12, number 3, pp 347-352, 2008. (DOI).
  50. Model-based validation of QoS properties of biomedical sensor networks. Simon Tschirner, Liang Xuedong, and Wang Yi. In Proc. 8th ACM International Conference on Embedded Software, pp 69-78, ACM Press, New York, 2008. (DOI).
  51. Creating Correct Network Protocols. Oskar Wibling. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 571, Acta Universitatis Upsaliensis, Uppsala, 2008. (fulltext, errata).
  52. Reflecting on running large scale student collaboration projects. Mattias Wiggberg and Mats Daniels. In Proc. 38th ASEE/IEEE Frontiers in Education Conference, pp 1464-1468, IEEE, Piscataway, NJ, 2008. (DOI).
  53. Unwinding processes in Computer Science student projects. Mattias Wiggberg. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2008-001, Uppsala University, 2008. (fulltext).
  54. Information Quality Aware Sensor Network Services. Sadaf Zahedi, Edith Ngai, Erol Gelenbe, Dinkar Mylaraswamy, and Mani B. Srivastava. In Proc. 42nd Asilomar Conference on Signals, Systems and Computers, pp 1155-1159, IEEE, Piscataway, NJ, 2008. (DOI).

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