Skip to main content
Department of Information Technology

Division of Computer Systems: Publications from 2010

  1. Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. Fides Aarts, Bengt Jonsson, and Johan Uijen. In Testing Software and Systems: ICTSS 2010, volume 6435 of Lecture Notes in Computer Science, pp 188-204, Springer-Verlag, Berlin, 2010. (DOI).
  2. Analyzing the security in the GSM radio network using attack jungles. Parosh Aziz Abdulla, Jonathan Cederberg, and Lisa Kaati. In Leveraging Applications of Formal Methods, Verification, and Validation: Part I, volume 6415 of Lecture Notes in Computer Science, pp 60-74, Springer-Verlag, Berlin, 2010. (DOI).
  3. Constrained monotonic abstraction: A CEGAR for parameterized verification. Parosh Aziz Abdulla, Yu-Fang Chen, Giorgio Delzanno, Frédéric Haziza, Chih-Duo Hong, and Ahmed Rezine. In CONCUR 2010 – Concurrency Theory, volume 6269 of Lecture Notes in Computer Science, pp 86-101, Springer-Verlag, Berlin, 2010. (DOI).
  4. Forcing monotonicity in parameterized verification: From multisets to words. Parosh Aziz Abdulla. In SOFSEM 2010: Theory and Practice of Computer Science, volume 5901 of Lecture Notes in Computer Science, pp 1-15, Springer-Verlag, Berlin, 2010. (DOI).
  5. Sampled semantics of timed automata. Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi. In Logical Methods in Computer Science, volume 6, number 3, pp 14:1-37, 2010. (DOI).
  6. Simulation subsumption in Ramsey-based Büchi automata universality and inclusion testing. Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, and Tomás Vojnar. In Computer Aided Verification, volume 6174 of Lecture Notes in Computer Science, pp 132-147, Springer-Verlag, Berlin, 2010. (DOI).
  7. Well (and better) quasi-ordered transition systems. Parosh Aziz Abdulla. In Bulletin of Symbolic Logic, volume 16, number 4, pp 457-515, 2010.
  8. When simulation meets antichains: On checking language inclusion of nondeterministic finite (tree) automata. Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, and Tomás Vojnar. In Tools and Algorithms for the Construction and Analysis of Systems, volume 6015 of Lecture Notes in Computer Science, pp 158-174, Springer-Verlag, Berlin, 2010. (DOI).
  9. From multi to single stack automata. Mohamed Faouzi Atig. In CONCUR 2010 – Concurrency Theory, volume 6269 of Lecture Notes in Computer Science, pp 117-131, Springer-Verlag, Berlin, 2010. (DOI).
  10. Global model checking of ordered multi-pushdown systems. Mohamed Faouzi Atig. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2010, volume 8 of Leibniz International Proceedings in Informatics, pp 216-227, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2010. (DOI).
  11. On the verification problem for weak memory models. Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, and Madanlal Musuvathi. In Proc. 37th ACM Symposium on Principles of Programming Languages, pp 7-18, ACM Press, New York, 2010. (DOI).
  12. On matrices, automata, and double counting. Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, and Justin Pearson. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 6140 of Lecture Notes in Computer Science, pp 10-24, Springer-Verlag, Berlin, 2010. (DOI).
  13. Formalising process calculi. Jesper Bengtson. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 93, Acta Universitatis Upsaliensis, Uppsala, 2010.
  14. Introductory programming and the didactic triangle. Anders Berglund and Raymond Lister. In Australian Computer Science Communications, volume 32, number 2, pp 35-44, 2010. (External link).
  15. Interest dissemination in a searchable data-centric opportunistic network. Fredrik Bjurefors, Per Gunningberg, Erik Nordström, and Christian Rohner. In Proc. European Wireless Conference: EW 2010, pp 889-895, IEEE, Piscataway, NJ, 2010. (DOI).
  16. Block-Parallel Programming for Real-time Embedded Applications. David Black-Schaffer and William J. Dally. In Proc. 39th International Conference on Parallel Processing, pp 297-306, IEEE, Piscataway, NJ, 2010. (DOI, fulltext:postprint).
  17. Inferring Compact Models of Communication Protocol Entities. Therese Bohlin, Bengt Jonsson, and Siavash Soleimanifard. In Leveraging Applications of Formal Methods, Verification, and Validation: Part I, volume 6415 of Lecture Notes in Computer Science, pp 658-672, Springer-Verlag, Berlin, 2010. (DOI).
  18. Invariant synthesis for programs manipulating lists with unbounded data. Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Ahmed Rezine, and Mihaela Sighireanu. In Computer Aided Verification, volume 6174 of Lecture Notes in Computer Science, pp 72-88, Springer-Verlag, Berlin, 2010. (DOI).
  19. Internationella studentprojekt – en ämnesdidaktisk utmaning. Åsa Cajander and Mats Daniels. In Kunskapens nya världar: Mötet mellan pedagogik och teknik vid Uppsala Learning Lab, pp 255-269, Uppsala Learning Lab, Uppsala University, 2010.
  20. Mode Switch: Adaptive use of delay-sensitive or energy-aware communication in IEEE 802.15.4-based networks. Feng Chen, Xiaoyu Tong, Edith Ngai, and Falko Dressler. In Proc. 7th International Conference on Mobile Ad Hoc and Sensor Systems, pp 302-311, IEEE, Piscataway, NJ, 2010. (DOI).
  21. NETWORKING 2010. Mark Crovella, Laura Marie Feeney, Dan Rubenstein, and S. V. Raghavan (eds). Volume 6091 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2010.
  22. Constructive controversy as a way to create "true collaboration" in an open ended group project setting. Mats Daniels and Åsa Cajander. In Australian Computer Science Communications, volume 32, number 2, pp 73-78, 2010. (External link).
  23. Engineering Education Research in Practice: Evolving use of open ended group projects as a pedagogical strategy for developing skills in global collaboration. Mats Daniels, Åsa Cajander, Arnold Pears, and Tony Clear. In International journal of engineering education, volume 26, number 4, pp 795-806, 2010.
  24. Experiences from using Constructive Controversy in an Open Ended Group Project. Mats Daniels and Åsa Cajander. In Proc. 40th ASEE/IEEE Frontiers in Education Conference, pp S3D-1-5, IEEE, Piscataway, NJ, 2010. (DOI).
  25. The contribution of open ended group projects to international student collaborations. Mats Daniels. In ACM Inroads, volume 1, number 3, pp 79-84, 2010. (DOI).
  26. StatCC: a statistical cache contention model. David Eklöv, David Black-Schaffer, and Erik Hagersten. In Proc. 19th International Conference on Parallel Architectures and Compilation Techniques, pp 551-552, ACM Press, New York, 2010. (DOI).
  27. StatStack: Efficient modeling of LRU caches. David Eklöv and Erik Hagersten. In Proc. International Symposium on Performance Analysis of Systems and Software: ISPASS 2010, pp 55-65, IEEE, Piscataway, NJ, 2010. (DOI).
  28. Energy Framework: An extensible framework for simulating battery consumption in wireless networks. Laura Marie Feeney and Daniel Willkomm. In Proc. 3rd International ICST Conference on Simulation Tools and Techniques, pp 20:1-4, ICST, Brussels, Belgium, 2010. (DOI, fulltext).
  29. Proc. 10th International Workshop on Symmetry in Constraint Satisfaction Problems. Pierre Flener and Justin Pearson (eds). Department of Information Technology, Uppsala University, Uppsala, Sweden, 2010. (Proceedings).
  30. Adaptive random re-routing for differentiated QoS in sensor networks. Erol Gelenbe and Edith Ngai. In Computer journal, volume 53, number 7, pp 1052-1061, 2010. (DOI).
  31. Learning of event-recording automata. Olga Grinchtein, Bengt Jonsson, and Martin Leucker. In Theoretical Computer Science, volume 411, number 47, pp 4029-4054, 2010. (DOI).
  32. Fixed-Priority Multiprocessor Scheduling with Liu & Layland's Utilization Bound. Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. In Proc. 16th Real-Time and Embedded Technology and Applications Symposium, pp 165-174, IEEE, Piscataway, NJ, 2010. (DOI).
  33. Handover for a portable communication device between local and wide area wireless networks. Per Gunningberg, Mattias Hansson, Pekka Hedqvist, Jonne Kodu, and Esbjörn Köhler. EU, WO, 2010. (External link).
  34. Efficient cache modeling with sparse data. Erik Hagersten, David Eklöv, and David Black-Schaffer. In Processor and System-on-Chip Simulation, pp 193-209, Springer, New York, 2010. (DOI).
  35. Energy-efficient task-mapping for data-driven sensor network macroprogramming using constraint programming. Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai, and Justin Pearson. In Proc. 9th International Workshop on Constraint Modelling and Reformulation, p 13, Department of Information Technology, Uppsala University, Uppsala, Sweden, 2010. (fulltext).
  36. Use and analysis of student response systems in two summer courses. Amie Hauer and Mats Daniels. In Att undervisa med vetenskaplig förankring – i praktiken!, volume 8 of Rapportserie från Avdelningen för universitetspedagogisk utveckling, pp 115-128, Uppsala universitet, 2010.
  37. On Handling Data in Automata Learning: Considerations from the CONNECT Perspective. Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen, and Sofia Cassel. In Leveraging Applications of Formal Methods, Verification, and Validation: Part II, volume 6416 of Lecture Notes in Computer Science, pp 221-235, Springer-Verlag, Berlin, 2010. (DOI).
  38. Quality-of-Information Aware Data Delivery for Wireless Sensor Networks: Description and Experiments. Gregory Humber and Edith C.-H. Ngai. In Proc. Wireless Communications and Networking Conference 2010, p 6, IEEE, Piscataway, NJ, 2010. (DOI).
  39. Psi-calculi: a framework for mobile process calculi: Cook your own correct process calculus - just add data and logic. Magnus Johansson. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 94, Acta Universitatis Upsaliensis, Uppsala, 2010. (fulltext).
  40. SARC coherence: Scaling directory cache coherence in performance and power. Stefanos Kaxiras and Georgios Keramidas. In IEEE Micro, volume 30, number 5, pp 54-65, 2010. (DOI).
  41. Interval-based models for run-time DVFS orchestration in superscalar processors. Georgios Keramidas, Vasileios Spiliopoulos, and Stefanos Kaxiras. In Proc. 7th International Conference on Computing Frontiers, pp 287-296, ACM Press, New York, 2010. (DOI).
  42. Where replacement algorithms fail: a thorough analysis. Georgios Keramidas, Pavlos Petoumenos, and Stefanos Kaxiras. In Proc. 7th International Conference on Computing Frontiers, pp 141-150, ACM Press, New York, 2010. (DOI).
  43. Minimizing Multi-Resource Energy for Real-Time Systems with Discrete Operation Modes. Fanxin Kong, Yiqun Wang, Qingxu Deng, and Wang Yi. In Proc. 22nd Euromicro Conference on Real-Time Systems, pp 113-122, IEEE, Piscataway, NJ, 2010. (DOI).
  44. Design, Implementation, and Evaluation of Wireless Sensor Network Systems. Jiangchuan Liu, Jiannong Cao, Xiang-Yang Li, Limin Sun, Dan Wang, and Edith C.-H. Ngai. In EURASIP Journal on Wireless Communications and Networking, pp 439890:1-2, 2010. (DOI).
  45. Combining abstract interpretation with model checking for timing analysis of multicore software. Mingsong Lv, Wang Yi, Nan Guan, and Ge Yu. In Proc. Real-Time Systems Symposium: RTSS 2010, pp 339-349, IEEE, Piscataway, NJ, 2010. (DOI).
  46. Static worst-case execution time analysis of the ?C/OS-II real-time kernel. Mingsong Lv, Nan Guan, Qingxu Deng, Ge Yu, and Wang Yi. In Frontiers of Computer Science in China, volume 4, number 1, pp 17-27, 2010. (DOI).
  47. Local search over relational databases. Toni Mancini, Pierre Flener, and Justin Pearson. In Proc. 7th International Workshop on Local Search Techniques in Constraint Satisfaction, p 15, Department of Computing Science and Engineering, Université catholique de Louvain, Belgium, 2010. (Fulltext).
  48. Proc. 9th International Workshop on Constraint Modelling and Reformulation. Toni Mancini and Justin Pearson (eds). Department of Information Technology, Uppsala University, Uppsala, Sweden, 2010. (Programme).
  49. A delay-aware reliable event reporting framework for wireless sensor–actuator networks. Edith Ngai, Yangfan Zhou, Michael R. Lyu, and Jiangchuan Liu. In Ad hoc networks, volume 8, number 7, pp 694-707, 2010. (DOI).
  50. Conveying Conceptions of Quality through Instruction. Arnold Pears. In Proc. 7th International Conference on the Quality of Information and Communications Technology, 2010.
  51. Developing Global Teamwork Skills: The Runestone Project. Arnold Pears and Mats Daniels. In Annual Global Engineering Education Conference (EDUCON): The Future of Global Learning in Engineering Education, IEEE, 2010. (fulltext).
  52. Does Quality Assurance Enhance the Quality of Computing Education?. Arnold Pears. In Australian Computer Science Communications, volume 32, number 2, pp 9-14, 2010. (External link, fulltext).
  53. Explanograms. Arnold Pears. In Kunskapens nya världar: Mötet mellan pedagogik och teknik vid Uppsala Learning Lab, pp 171-179, Uppsala Learning Lab, Uppsala University, 2010.
  54. Should we care about global intercultural collaboration?. Arnold Pears. In ACM Inroads, volume 1, number 3, pp 4-7, 2010. (DOI).
  55. Enhancing Student Engagement in an Introductory Programming Course. Arnold N. Pears. In Proc. 40th ASEE/IEEE Frontiers in Education Conference, pp F1E-1-2, IEEE, Piscataway, NJ, 2010. (DOI).
  56. MLP-aware instruction queue resizing: The key to power-efficient performance. Pavlos Petoumenos, Georgia Psychou, Stefanos Kaxiras, Juan Manuel Cebrián Gonzalez, and Juan Luis Aragón. In Architecture of Computing Systems – ARCS 2010, volume 5974 of Lecture Notes in Computer Science, pp 113-125, Springer-Verlag, Berlin, 2010. (DOI).
  57. An adaptive cross-layer design for prioritized traffic in wireless communications. Guduru K. Pradeep and Edith C.-H. Ngai. In Proc. 6th International Conference on Mobile Ad Hoc and Sensor Networks, pp 203-206, IEEE, Piscataway, NJ, 2010. (DOI).
  58. Repeatable experiments with mobile nodes in a relocatable WSN testbed. Olof Rensfelt, Frederik Hermans, Per Gunningberg, and Lars-Åke Larzon. In Proc. 6th IEEE International Conference on Distributed Computing in Sensor Systems Workshops: DCOSSW 2010, pp 1-6, IEEE Computer Society, 2010. (DOI).
  59. Sensei-UU: a relocatable sensor network testbed. Olof Rensfelt, Frederik Hermans, Lars-Åke Larzon, and Per Gunningberg. In Proc. 5th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization, pp 63-70, ACM Press, 2010. (DOI).
  60. Secure Overlays: Making Static Key Distribution Schemes Work with Mobile Base Stations in WSNs. Ioana Rodhe and Christian Rohner. In Wired/Wireless Internet Communications, volume 6074 of Lecture Notes in Computer Science, pp 386-397, Springer-Verlag, Berlin, 2010. (DOI).
  61. Wireless sensor network deployment in mobile phones assisted environment. Zheng Ruan, Edith C.-H. Ngai, and Jiangchuan Liu. In Proc. 18th International Workshop on Quality of Service, p 9, IEEE, Piscataway, NJ, 2010. (DOI).
  62. A Software Technique for Reducing Cache Pollution. Andreas Sandberg, David Eklöv, and Erik Hagersten. In Proc. 3rd Swedish Workshop on Multi-Core Computing, pp 59-62, Chalmers University of Technology, Göteborg, Sweden, 2010. (fulltext:postprint).
  63. Reducing Cache Pollution Through Detection and Elimination of Non-Temporal Memory Accesses. Andreas Sandberg, David Eklöv, and Erik Hagersten. In Proc. International Conference for High Performance Computing, Networking, Storage and Analysis: SC 2010, p 11, IEEE, Piscataway, NJ, 2010. (DOI, fulltext:print).
  64. On realising a strategy for resilience in opportunistic networks. Marcus Schöller, Paul Smith, Christian Rohner, Merkouris Karaliopoulos, Abdul Jabbar, James P.G. Sterbenz, and David Hutchinson. In Future Network and Mobile Summit, Florence, 2010.
  65. Parallelizing multicore cache simulations on GPUs. Nikolaos Strikos, Georgios Keramidas, and Stefanos Kaxiras. In Proc. 3rd Swedish Workshop on Multi-Core Computing, pp 3-8, Chalmers University of Technology, Göteborg, Sweden, 2010.
  66. Contingency plans for air traffic flow and capacity management. Karl Sundequist Blomdahl, Pierre Flener, and Justin Pearson. In Proc. 9th Innovative Research Workshop and Exhibition, pp 119-126, EUROCONTROL Experimental Centre, Brétigny sur Orge, France, 2010. (fulltext).
  67. Contingency plans for air traffic management. Karl Sundequist Blomdahl, Pierre Flener, and Justin Pearson. In Principles and Practice of Constraint Programming – CP 2010, volume 6308 of Lecture Notes in Computer Science, pp 643-657, Springer-Verlag, Berlin, 2010. (DOI).
  68. Holistic approach to learning and teaching introductory object-oriented programming. Neena Thota. In Computer Science Education, volume 20, number 2, pp 103-127, 2010. (DOI).
  69. Verifying parallel programs with dynamic communication structures. Tayssir Touili and Mohamed Faouzi Atig. In Theoretical Computer Science, volume 411, pp 3460-3468, 2010. (DOI).
  70. A method for analyzing learning outcomes in project courses. Mattias Wiggberg. In Proc. 40th ASEE/IEEE Frontiers in Education Conference, pp T4H-1-2, IEEE, Piscataway, NJ, 2010. (DOI).
  71. Computer Science Project Courses: Contrasting Students’ Experiences with Teachers’ Expectations. Mattias Wiggberg. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 722, Acta Universitatis Upsaliensis, Uppsala, 2010. (fulltext).
  72. Multicore embedded systems: The timing problem and possible solutions. Wang Yi. In Formal Methods and Software Engineering, volume 6447 of Lecture Notes in Computer Science, pp 22-23, Springer-Verlag, Berlin, 2010. (DOI).

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