Skip to main content
Department of Information Technology

Division of Computer Systems: Publications from 2011

  1. Advanced Ramsey-based Büchi automata inclusion testing. Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, and Tomás Vojnar. In CONCUR 2011 — Concurrency Theory, volume 6901 of Lecture Notes in Computer Science, pp 187-202, Springer Berlin/Heidelberg, 2011. (DOI).
  2. Automatic verification of directory-based consistency protocols with graph constraints. Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In International Journal of Foundations of Computer Science, volume 22, number 4, pp 761-782, 2011. (DOI).
  3. Computing Optimal Coverability Costs in Priced Timed Petri Nets. Parosh Aziz Abdulla and Mayr Richard. In LICS'2011, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, IEEE Symposium on Logic in Computer Science, pp 399-408, 2011. (DOI).
  4. On the verification of timed ad hoc networks. Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, and Riccardo Traverso. In Formal Modeling and Analysis of Timed Systems: FORMATS 2011, volume 6919 of Lecture Notes in Computer Science, pp 256-270, Springer Berlin/Heidelberg, 2011. (DOI).
  5. Approximating Petri net reachability along context-free traces. Mohamed Faouzi Atig and Pierre Ganty. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2011, volume 13 of Leibniz International Proceedings in Informatics, pp 152-163, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2011. (DOI, fulltext:postprint).
  6. Context-bounded analysis for concurrent programs with dynamic creation of threads. Mohamed Faouzi Atig, Ahmed Bouajjani, and Shaz Qadeer. In Logical Methods in Computer Science, volume 7, number 4, pp 4:1-48, 2011. (DOI).
  7. Getting rid of store-buffers in TSO analysis. Mohamed Faouzi Atig, Ahmed Bouajjani, and Gennaro Parlato. In Computer Aided Verification: CAV 2011, volume 6806 of Lecture Notes in Computer Science, pp 99-115, Springer-Verlag, Berlin, 2011. (DOI).
  8. On Yen's path logic for Petri nets. Mohamed Faouzi Atig and Peter Habermehl. In International Journal of Foundations of Computer Science, volume 22, number 4, pp 783-799, 2011. (DOI).
  9. Developing UPPAAL over 15 years. Gerd Behrmann, Alexandre David, Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. In Software, practice & experience, volume 41, number 2, pp 133-142, 2011. (DOI).
  10. How do master level students in Computer Science perceive plagiarism?. Anders Berglund and Neena Thota. In Proc. 2nd International Conference on Computer Science Education: Innovation and Technology, pp 90-95, Global Science and Technology Forum, Singapore, 2011. (fulltext:print).
  11. Reasoning about the value of cultural awareness in international collaboration. Helena Bernáld, Åsa Cajander, Mats Daniels, and Cary Laxer. In Journal of Applied Computing and Information Technology, volume 15, number 1:I2, 2011. (External link).
  12. Congestion Avoidance in a Data-Centric Opportunistic Network. Fredrik Bjurefors, Per Gunningberg, Christian Rohner, and Sam Tavakoli. In Proceedings of the 2011 ACM SIGCOMM Workshop on Information-Centric Networking (ICN-2011), 2011.
  13. Haggle Testbed: a Testbed for Opportunistic Networks. Fredrik Bjurefors, Per Gunningberg, and Christian Rohner. In In Proceedings of the 7th Swedish National Computer Networking Workshop, 2011.
  14. JamLab: Augmenting sensornet testbeds with realistic and controlled interference generation. Carlo Alberto Boano, Thiemo Voigt, Claro Noda, Kay Römer, and Marco Zuniga. In IPSN, pp 175-186, 2011.
  15. An interpolating sequent calculus for quantifier-free Presburger arithmetic. Angelo Brillout, Daniel Kroening, Philipp Rümmer, and Thomas Wahl. In Journal of automated reasoning, volume 47, number 4, pp 341-367, 2011. (DOI).
  16. Beyond quantifier-free interpolation in extensions of Presburger arithmetic. Angelo Brillout, Daniel Kroening, Philipp Rümmer, and Thomas Wahl. In Verification, Model Checking, and Abstract Interpretation: VMCAI 2011, volume 6538 of Lecture Notes in Computer Science, pp 88-102, Springer Berlin/Heidelberg, 2011. (DOI).
  17. GINSENG: Performance Control in Wireless Sensor Networks. J. Brown, U. Roedig, T. O'Donovan, C. J. Sreenan, Z. He, Thiemo Voigt, B. Pottner, L. Wolf, A. Klein, J. Sa Silva, V. Vassiliou, and J. doO. In 8th European Conference on Wireless Sensor Networks (EWSN’11), 2011.
  18. BurstProbe: Debugging Time-Critical Data Delivery in Wireless Sensor Networks. James Brown, Ben McCarthy, Utz Roedig, Thiemo Voigt, and Cormac J. Sreenan. In 8th European Conference on Wireless Sensor Networks (EWSN’11), 2011.
  19. Assessing professional skills in engineering education. Åsa Cajander, Mats Daniels, Roger McDermott, and Brian von Konsky. In Australian Computer Science Communications, volume 33, number 2, pp 145-154, 2011. (External link).
  20. Development of Professional Competencies in Engineering Education. Åsa Cajander, Mats Daniels, and Brian R. von Konsky. In Proc. 41st ASEE/IEEE Frontiers in Education Conference, pp S1C-1-5, IEEE, Piscataway, NJ, 2011. (DOI).
  21. A succinct canonical register automaton model. Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, and Bernhard Steffen. In Automated Technology for Verification and Analysis: ATVA 2011, volume 6996 of Lecture Notes in Computer Science, pp 366-380, Springer-Verlag, Berlin, 2011. (DOI, External link).
  22. Leakage-efficient design of value predictors through state and non-state preserving techniques. Juan M. Cebrián, Juan L. Aragón, José M. García, and Stefanos Kaxiras. In Journal of Supercomputing, volume 55, number 1, pp 28-50, 2011. (DOI).
  23. Power Token Balancing: Adapting CMPs to power constraints for parallel multithreaded workloads. Juan M. Cebrián, Juan L. Aragón, and Stefanos Kaxiras. In Proc. 25th International Parallel and Distributed Processing Symposium, pp 431-442, IEEE, Piscataway, NJ, 2011. (DOI).
  24. Developing and Assessing Professional Competencies: a Pipe Dream?: Experiences from an Open-Ended Group Project Learning Environment. Mats Daniels. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 808, Acta Universitatis Upsaliensis, Uppsala, 2011. (fulltext).
  25. Automatic analysis of DMA races using model checking and k-induction. Alastair F. Donaldson, Daniel Kroening, and Philipp Rümmer. In Formal methods in system design, volume 39, number 1, pp 83-113, 2011. (DOI).
  26. SCRATCH: a tool for automatic analysis of DMA races. Alastair F. Donaldson, Daniel Kroening, and Philipp Rümmer. In Proc. 16th ACM Symposium on Principles and Practice of Parallel Programming, pp 311-312, ACM Press, New York, 2011. (DOI).
  27. Software verification using <em>k</em>-induction. Alastair F. Donaldson, Leopold Haller, Daniel Kroening, and Philipp Rümmer. In Static Analysis: SAS 2011, volume 6887 of Lecture Notes in Computer Science, pp 351-368, Springer Berlin/Heidelberg, 2011. (DOI).
  28. Tightening test coverage metrics: A case study in equivalence checking using <em>k</em>-induction. Alastair F. Donaldson, Nannan He, Daniel Kroening, and Philipp Rümmer. In Formal Methods for Components and Objects: FMCO 2010, volume 6957 of Lecture Notes in Computer Science, pp 297-315, Springer Berlin/Heidelberg, 2011. (DOI).
  29. Computing Systems: Research Challenges Ahead: The HiPEAC Vision 2011/2012. Marc Duranton, David Black-Schaffer, Sami Yehia, and Koen de Bosschere. 2011. (PDF, fulltext).
  30. A distributed swarm-intelligent localization for sensor networks with mobile nodes. Pontus Ekberg and Edith C.-H. Ngai. In Proc. 7th International Wireless Communications and Mobile Computing Conference, pp 83-88, IEEE, Piscataway, NJ, 2011. (DOI).
  31. Cache Pirating: Measuring the curse of the shared cache. David Eklöv, Nikos Nikoleris, David Black-Schaffer, and Erik Hagersten. Technical report / Department of Information Technology, Uppsala University nr 2011-001, 2011. (fulltext).
  32. Cache Pirating: Measuring the Curse of the Shared Cache. David Eklöv, Nikos Nikoleris, David Black-Schaffer, and Erik Hagersten. In Proc. 40th International Conference on Parallel Processing, pp 165-175, IEEE Computer Society, 2011. (DOI).
  33. Efficient methods for application performance analysis. David Eklöv. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2011-001, Uppsala University, 2011. (fulltext).
  34. Fast modeling of shared caches in multicore systems. David Eklöv, David Black-Schaffer, and Erik Hagersten. In Proc. 6th International Conference on High Performance and Embedded Architectures and Compilers, pp 147-157, ACM Press, New York, 2011. (DOI).
  35. On the consistency of simulation results. Laura Marie Feeney. In , 2011.
  36. Self-organizing TDMA for multihop networks. Laura Marie Feeney. 2011.
  37. Two simple tools for testing wireless communication modules in OMNeT++. Laura Marie Feeney. In 4th Int’l Workshop on OMNeT++ in conjunction with 3th Int’l Conf on Simulation Tools and Techniques (Simutools 2011), 2011. (External link).
  38. A Framework for How to Make Use of an Automatic Passenger Counting System. John Fihn and Johan Finndahl. Student thesis, supervisor: Margaret Hamilton, Georges Couenon, examiner: Arnold Pears, Elisabet Andresdottir, UPTEC STS nr 11033, 2011. (fulltext).
  39. Towards adaptive sensor networks. Niclas Finne. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2011-004, Uppsala University, 2011. (fulltext).
  40. Mobile system for establishing the lactate threshold by analysing the respiratory air. Mia Folke, Frederik Hermans, Ioana Rodhe, Mats Björkman, Maria Lindén, and Per Gunningberg. In Proc. 2nd International Conference on Ambulatory Monitoring of Physical Activity and Movement, pp 102-102, Glasgow Caledonian University, Scotland, 2011.
  41. Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. Nan Guan, Pontus Ekberg, Martin Stigge, and Wang Yi. In Proc. Real-Time Systems Symposium, pp 13-23, IEEE, Piscataway, NJ, 2011. (DOI).
  42. Resource sharing protocols for real-time task graph systems. Nan Guan, Pontus Ekberg, Martin Stigge, and Wang Yi. In Proc. 23rd Euromicro Conference on Real-Time Systems, pp 272-281, IEEE, Piscataway, NJ, 2011. (DOI).
  43. Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling. Nan Guan, Wang Yi, Qingxu Deng, Zonghua Gu, and Ge Yu. In Journal of systems architecture, volume 57, number 5, pp 536-546, 2011. (DOI).
  44. Privacy-aware probabilistic sampling for data collection in wireless sensor networks. João Guerreiro, Edith C.-H. Ngai, and Christian Rohner. In Proc. 7th International Wireless Communications and Mobile Computing Conference, pp 314-319, IEEE conference proceedings, Piscataway, NJ, 2011. (DOI).
  45. Energy-efficient task mapping for data-driven sensor network macroprogramming using constraint programming. Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai, and Justin Pearson. In Operations Research, Computing, and Homeland Defense, pp 199-209, Institute for Operations Research and the Management Sciences, Hanover, MD, 2011. (DOI).
  46. Test-case generation for embedded Simulink via formal concept analysis. Nannan He, Philipp Rümmer, and Daniel Kroening. In Proc. 48th Design Automation Conference, pp 224-229, ACM Press, New York, 2011. (DOI).
  47. Mobile Sources in an Information-Centric Network with Hierarchical Names: An Indirection Approach. Frederik Hermans, Edith C.-H. Ngai, and Per Gunningberg. In Proc. 7th Swedish National Computer Networking Workshop, 2011.
  48. Sensei-UU — a relocatable WSN testbed supporting repeatable node mobility. Frederik Hermans, Olof Rensfelt, Per Gunningberg, Lars-Åke Larzon, and Edith Ngai. In Testbeds and Research Infrastructures: Development of Networks and Communities, volume 46 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, pp 612-614, Springer-Verlag, Berlin, 2011. (DOI).
  49. A simple model for tuning tasks. Marcus Holm, Martin Tillenius, and David Black-Schaffer. In Proc. 4th Swedish Workshop on Multi-Core Computing, pp 45-49, Linköping University, Linköping, Sweden, 2011.
  50. Twitter in Disaster Mode: Opportunistic Communication and Distribution of Sensor Data in Emergencies. Theus Hossmann, Franck Legendre, Paolo Carta, Per Gunningberg, and Christian Rohner. In ExtremeCom2011, ACM Press, 2011.
  51. Twitter in Disaster Mode: Security Architecture. Theus Hossmann, Paolo Carta, Dominik Schatzmann, Franck Legendre, Per Gunningberg, and Christian Rohner. In Conference on emerging Networking EXperiments and Technologies (CoNEXT): Special Workshop on the Internet and Disasters (SWID), ACM Press, Tokyo, 2011.
  52. Memory access aware mapping for networks-on-chip. Xi Jin, Nan Guan, Qingxu Deng, and Wang Yi. In Proc. 17th International Conference on Embedded and Real-Time Computing Systems and Applications, pp 339-348, IEEE, Piscataway, NJ, 2011. (DOI).
  53. Learning of automata models extended with data. Bengt Jonsson. In Formal Methods for Eternal Networked Software Systems: SFM 2011, Advanced Lectures, volume 6659 of Lecture Notes in Computer Science, pp 327-349, Springer Berlin/Heidelberg, 2011. (DOI).
  54. State of the art in modeling opportunistic networks. Thabotharan Kathiravelu and Arnold Pears. In Mobile Opportunistic Networks: Architectures, Protocols and Applications, pp 25-50, Auerbach Publications, Boca Raton, FL, 2011. (DOI).
  55. Cooperative state estimation for preserving privacy of user behaviors in smart grid. Younghun Kim, Edith C.-H. Ngai, and Mani B. Srivastava. In Proc. 2nd International Conference on Smart Grid Communications, pp 178-183, IEEE, Piscataway, NJ, 2011. (DOI).
  56. Energy-efficient scheduling for parallel real-time tasks based on level-packing. Fanxin Kong, Nan Guan, Qingxu Deng, and Wang Yi. In Proc. 26th ACM Symposium on Applied Computing, pp 635-640, ACM Press, New York, 2011. (DOI).
  57. Energy-efficient scheduling of real-time tasks on cluster-based multicores. Fanxin Kong, Wang Yi, and Qingxu Deng. In Proc. 14th Conference on Design, Automation and Test in Europe, IEEE, Piscataway, NJ, 2011.
  58. Using hardware transactional memory for high-performance computing. Karl Ljungkvist, Martin Tillenius, David Black-Schaffer, Sverker Holmgren, Martin Karlsson, and Elisabeth Larsson. In Proc. 25th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, pp 1660-1667, IEEE, Piscataway, NJ, 2011. (DOI).
  59. McAiT — a timing analyzer for multicore real-time software. Mingsong Lv, Nan Guan, Qingxu Deng, Ge Yu, and Wang Yi. In Automated Technology for Verification and Analysis, volume 6996 of Lecture Notes in Computer Science, pp 414-417, Springer-Verlag, Berlin, 2011. (DOI).
  60. OppSense: Information sharing for mobile phones in sensing field with data repositories. Edith C.-H. Ngai, He Huang, Jiangchuan Liu, and Mani B. Srivastava. In Proc. 8th IEEE Conference on Sensor, Mesh and Ad Hoc Communications and Networks, pp 107-115, IEEE, Piscataway, NJ, 2011. (DOI).
  61. Robust and flexible Internet connectivity for mobile ad hoc networks. Erik Nordström, Per Gunningberg, and Christian Tschudin. In Ad hoc networks, volume 9, number 1, pp 1-15, Elsevier, 2011. (DOI).
  62. mJeliot: A tool for enhanced interactivity in programming instruction. Arnold Pears and Moritz Rogalli. In Proc. 11th International Conference on Computing Education Research: Koli Calling, pp 16-22, ACM Press, New York, 2011. (DOI).
  63. mJeliot: ICT Support for Interactive Teaching of Programming. Arnold Pears and Moritz Rogalli. In Proc. 41st ASEE/IEEE Frontiers in Education Conference, Frontiers in Education Conference, pp T1J-1-4, IEEE conference proceedings, Piscataway, NJ, 2011. (DOI).
  64. Repeatable experiments with mobile nodes in a relocatable WSN testbed. Olof Rensfelt, Frederik Hermans, Per Gunningberg, Lars-Åke Larzon, and Erik Björnemo. In Computer journal, volume 54, number 12, pp 1973-1986, 2011. (DOI).
  65. Wireless sensor deployment for collaborative sensing with mobile phones. Zheng Ruan, Edith C.-H. Ngai, and Jiangchuan Liu. In Computer Networks, volume 55, number 15, pp 3224-3245, 2011. (DOI).
  66. A simple statistical cache sharing model for multicores. Andreas Sandberg, David Black-Schaffer, and Hagersten Erik. In Proc. 4th Swedish Workshop on Multi-Core Computing, pp 31-36, Linköping University, Linköping, Sweden, 2011. (fulltext:postprint).
  67. Efficient software-based online phase classification. Andreas Sembrant, David Eklöv, and Erik Hagersten. In International Symposium on Workload Characterization (IISWC'11), pp 104-115, IEEE Computer Society, 2011. (DOI).
  68. Green governors: A framework for continuously adaptive DVFS. Vasileios Spiliopoulos, Stefanos Kaxiras, and Georgios Keramidas. In Proc. International Green Computing Conference and Workshops: IGCC 2011, pp 1-8, IEEE, Piscataway, NJ, 2011. (DOI).
  69. Power-performance adaptation in Intel core i7. Vasileios Spiliopoulos, Georgios Keramidas, Stefanos Kaxiras, and Konstantinos Efstathiou. In Proc. 2nd Workshop on Computer Architecture and Operating System co-design, p 10, Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, MA, 2011. (Proceedings).
  70. On the tractability of digraph-based task models. Martin Stigge, Pontus Ekberg, Nan Guan, and Wang Yi. In Proc. 23rd Euromicro Conference on Real-Time Systems, pp 162-171, IEEE, Piscataway, NJ, 2011. (DOI).
  71. The digraph real-time task model. Martin Stigge, Pontus Ekberg, Nan Guan, and Wang Yi. In 17th Real-Time and Embedded Technology and Applications Symposium, IEEE Real-Time and Embedded Technology and Application Symposium, pp 71-80, IEEE Computer Society, Piscataway, NJ, 2011. (DOI).
  72. Lower trees with fixed degrees: a recipe for efficient secure hierarchical aggregation in WSNs. Davor Sutic, Ioana Rodhe, Christian Rohner, and Björn Victor. In 2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), pp 659-664, IEEE Computer Society, 2011. (DOI).
  73. Repertory grid: Investigating personal constructs of novice programmers. Neena Thota. In Proc. 11th International Conference on Computing Education Research: Koli Calling, pp 23-32, ACM Press, New York, 2011. (DOI).
  74. A method for analyzing learning outcomes in project courses. Mattias Wiggberg and Mats Daniels. In Australian Computer Science Communications, volume 33, number 2, pp 73-78, 2011. (External link).
  75. RealProct: Reliable protocol conformance testing with real nodes for wireless sensor networks. Junjie Xiong, Edith C.-H. Ngai, Yangfan Zhou, and Michael R. Lyu. In Proc. 10th International Conference on Trust, Security and Privacy in Computing and Communications, IEEE Computer Society, 2011.
  76. Implementation and empirical comparison of partitioning-based multi-core scheduling. Yi Zhang, Nan Guan, Yanbin Xiao, and Wang Yi. In Proc. 6th International Symposium on Industrial Embedded Systems, pp 248-255, IEEE, Piscataway, NJ, 2011. (DOI).
  77. Towards the implementation and evaluation of semi-partitioned multi-core scheduling. Yi Zhang, Nan Guan, and Wang Yi. In Bringing Theory to Practice: Predictability and Performance in Embedded Systems, volume 18 of OpenAccess Series in Informatics, pp 42-46, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2011. (DOI).
  78. Improving Low-Power Wireless Protocols with Timing-Accurate Simulation. Fredrik Österlind. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 866, Acta Universitatis Upsaliensis, Uppsala, 2011. (fulltext).

Updated  2016-12-09 16:27:02 by Peter Waites.