Skip to main content
Department of Information Technology

Division of Computer Systems: Publications from 2004

  1. A Survey of Regular Model Checking.. Parosh Abdulla, Bengt Jonsson, Marcus Nilsson, and Mayank Saksena. In CONCUR 2004 - Concurrency Theory: 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings., pp 35-48, 2004.
  2. Decidability of Zenoness, Token Liveness, and Boundedness for Dense-Timed Petri Nets.. Parosh Abdulla, Pritha Mahata, and Richard Mayr. In FSTTCS' 04: 24th Conference on Foundations of Software Technology and Theoretical Computer Science, 2004. (DOI, External link).
  3. Designing Safe, Reliable Systems using Scade. Parosh Abdulla, Johann Deneux, and Ove Åkerlund. In Proc. ISoLA '04: International Symposium on Leveraging Applications of Formal Methods, 2004.
  4. Forward Reachability Analysis of Timed Petri Nets. Parosh Abdulla, Johann Deneux, Pritha Mahata, and Aletta Nylén. In FORMATS-FTRTFT'04, 2004, 2004.
  5. Multi-Clock Timed Networks. Parosh Abdulla, Johann Deneux, and Pritha Mahata. In LICS'2004, 18th IEEE Int. Symp. on Logic in Computer Science, 2004.
  6. Open, Closed and Robust Timed Networks.. Parosh Abdulla, Johann Deneux, and Pritha Mahata. In CONCUR 2004 -- Concurrency Theory: 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings, p 529, 2004. (External link).
  7. Regular Model Checking for LTL(MSO). Parosh Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, and Mayank Saksena. In Computer Aided Verification, pp 348-360, 2004.
  8. Report on Dataflow Dependencies in Billing Processing Systems. Parosh Abdulla, Noomene Ben Henda, Johann Deneux, Bengt Jonsson, and Tomas Reidmar. In Proc. ISoLA '04: 1st International Symposium on Leveraging Applications of Formal Methods, 2004.
  9. SAT-solving the Coverability Problem for Unbounded Petri Nets. Parosh Abdulla, Purushothaman Iyer, and Aletta Nylén. In Formal methods in system design, volume 24, number 1, pp 25-43, Kluwer Academic Publishers, The Netherlands, 2004. (External link).
  10. Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, and Bengt Jonsson. In Formal methods in system design, volume 25, number 1, pp 39-65, 2004. (DOI).
  11. Controller Synthesis for Probabilistic Systems. Christel Baier, Marcus Grösser, Martin Leucker, Benedikt Bollig, and Frank Ciesinski. In IFIP TCS 2004: Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France, pp 493-506, 2004.
  12. Web Services as a New Approach to Distributing and Coordinating Semantics-Based Verification Toolkits. Michael Baldamus, Jesper Bengtson, GianLuigi Ferrari, and Roberto Raggi. In Electronic Notes in Theoretical Computer Science, volume 105, pp 11-20, 2004.
  13. Evaluation of Authentication Algorithms for Small Devices. Tobias Bandh. 2004.
  14. Timed Automata: Semantics, Algorithms and Tools. Johan Bengtsson and Yi Wang. In In Lecture Notes on Concurrency and Petri Nets: LNCS 3098, 2004.
  15. StatCache: A Probabilistic Approach to Efficient and Accurate Data Locality Analysis. Erik Berg and Erik Hagersten. In 2004 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS-2004),, 2004.
  16. A framework to study learning in a complex learning environment. Anders Berglund. In ALT-J Research in Learning Technology Journal, volume 12, number 1, pp 65-79, 2004. (External link).
  17. Teaching and learning CS: An overview of research approaches: Keynote speech at the 4th Annual Finnish/Baltic Sea Conference on Computer Science Education. Anders Berglund. Koli, Joensuu, Finland, 2004.
  18. Performance of Pastry in a Heterogeneous System. Fredrik Bjurefors, Richard Gold, and Lars-Åke Larzon. In Proceedings of the Fourth IEEE International Conference on Peer-to-Peer computing, 2004. (External link).
  19. Specifying and Generating Test Cases Using Observer Automata. Johan Blom, Anders Hessel, Bengt Jonsson, and Paul Pettersson. In Proceedings of the 4th International Workshop on Formal Approaches to Testing of Software, pp 125-139, 2004. (DOI).
  20. Message-Passing Automata Are Expressively Equivalent to EMSO Logic. Benedikt Bollig and Martin Leucker. In CONCUR 2004: Concurrency Theory, 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings, pp 146-160, 2004.
  21. Verifying Qualitative Properties of Probabilistic Programs. Benedikt Bollig and Martin Leucker. In Validation of Stochastic Systems: A Guide to Current Research, pp 124-146, Springer, 2004.
  22. Network Mobility and Protocol Interoperability in Ad Hoc Networks. Luiz DaSilva, Scott Midkiff, Jahng Park, Kaustubh Phanse, Tao Lin, George Hadjichristofi, and Nathaniel Davis. In IEEE Communications Magazine, volume 42, number 11, 2004. (External link).
  23. Five myths of assessment. Mats Daniels, Anders Berglund, Arnold Pears, and Sally Fincher. In Australian Computer Science Communication, volume 26, number 5, pp 57-61, 2004. (External link).
  24. An integrated approach to developing sensor network solutions. Adam Dunkels, Laura Marie Feeney, Björn Grönvall, and Thiemo Voigt. In 2nd International Workshop on Sensor and Actor Network Protocols and Applications (SANPA'04), 2004.
  25. Improving DSZOOM's Run Time System. Niklas Ekström. Master's thesis, UPTEC F03 104, School of Engineering, Uppsala University, Sweden, January 2004., 2004.
  26. On-chip monitoring for non-intrusive hardware/software observability. Mohammed El Shobaki. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2004-004, Uppsala University, 2004. (fulltext).
  27. Understanding Your C Compiler: How to Minimize Code Size. Jakob Engblom. In The Firmware Handbook, Elsevier/Newnes, 2004.
  28. A geometric derivation of the probability of finding a relay in multi-rate networks. Laura Marie Feeney, Daniel Hollos, Holger Karl, Martin Kubisch, and Seble Mengesha. In 3rd IFIP Conference on Networking (Networking 2004), 2004.
  29. Analysis and protocol design for rate adaptation for simple relay networks. Laura Marie Feeney, Daniel Hollos, Holger Karl, Martin Kubisch, and Seble Mengesha. In 4th Scandinavian Workshop on Wireless Ad-hoc Networks (AdHoc'04), 2004.
  30. Energy Efficient Communication in Ad Hoc Networks. Laura Marie Feeney. In Mobile Ad Hoc Networking, Wiley, 2004.
  31. A Generic Approach to Schedulability Analysis of Real-Time Tasks. Elena Fersman and Wang Yi. In Nordic Journal of Computing, volume 12, number 2, pp 129-147, 2004.
  32. A generic approach to schedulability analysis of real-time tasks. Elena Fersman and Yi Wang. In Nordic Journal of Computing, volume 11, 2004.
  33. Air-traffic complexity resolution using constraint programming. Pierre Flener, Justin Pearson, and Magnus Ågren. 2004.
  34. Financial portfolio optimisation. Pierre Flener, Justin Pearson, and Luis G. Reyna. In 10th International Conference on Principles and Practice of Constraint Programming: CP 2004, pp 227-241, 2004. (External link).
  35. Introducing ESRA, a relational language for modelling combinatorial problems. Pierre Flener, Justin Pearson, and Magnus Ågren. In LOPSTR'03: Revised Selected Papers, pp 214-232, Springer-Verlag, 2004. (External link).
  36. Worst-case air-traffic generation using constraint programming. Pierre Flener and Justin Pearson. 2004.
  37. On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi. Pablo Giambiagi, Gerardo Schneider, and Frank Valencia. In Proceedings of the 7nd International Conference on Foundations of Software Science and Computation Structures (FOSSACS'04), pp 226-240, 2004.
  38. On the expressiveness of CCS-like calculi. Pablo Giambiagi, Gerardo Schneider, and Frank D. Valencia. Technical report / Department of Information Technology, Uppsala University nr 2004-002, 2004. (fulltext).
  39. On the expressiveness of infinite behavior and name scoping in process calculi. Giambiagi Pablo, Schneider Gerardo and Valencia Frank D.. In FOSSACS'04, pp 226-240, 2004.
  40. A Virtualized Link Layer with Support for Indirection. Richard Gold, Per Gunningberg, and Christian Tschudin. In ACM SIGCOMM Workshop on Future Directions in Network Architecture (FDNA'04), 2004. (External link).
  41. A virtualized link layer with support for indirection. Richard Gold, Per Gunningberg, and Christian Tschudin. In ACM SIGCOMM Workshop on Future Directions in Network Architecture (FDNA'04), pp 28-34, ACM New York, NY, USA, Portland, 2004.
  42. Learning of event-recording automata. Olga Grinchtein, Bengt Jonsson, and Martin Leucker. In FORMATS/FTRTFT 2004: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Joint International Conferences on Formal Modelling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2004, Grenoble, France, September 22-24, 2004, Proceedings, pp 379-396, 2004. (DOI).
  43. Network invariants for real-time systems. Olga Grinchtein and Martin Leucker. In 5th International Workshop on Verification of Infinite-State Systems, pp 57-74, 2004.
  44. Computer system employing bundled prefetching. Erik Hagersten. 2004.
  45. Computer system including a promise array. Erik Hagersten. 2004.
  46. Multi-node computer system employing a reporting mechanism for multi-node transactions. Erik Hagersten. 2004.
  47. Multi-node computer system implementing global access state dependent transactions. Erik Hagersten. 2004.
  48. Multi-node computer system with proxy transaction to read data from a non-owning memory device. Erik Hagersten. 2004.
  49. Multi-node system in which global address generated by processing subsystem includes global to local translation information. Erik Hagersten. 2004.
  50. Multi-node system with global access states. Erik Hagersten. 2004.
  51. Multi-node system with interface intervention to satisfy coherency transactions transparently to active devices. Erik Hagersten. 2004.
  52. Multi-node system with split ownership and access right coherence mechanism. Erik Hagersten. 2004.
  53. Multiprocessing computer system employing capacity prefetching. Erik Hagersten. 2004.
  54. Multiprocessing systems employing hierarchical back-off locks. Erik Hagersten. 2004.
  55. Performing virtual to global address translation in processing subsystem. Erik Hagersten. 2004.
  56. System and method for reducing shared memory write overhead in multiprocessor systems. Erik Hagersten. 2004.
  57. A Test Case Generation Algorithm for Real-Time Systems. Anders Hessel and Paul Pettersson. In proceedings of the 4th International Conference on Quality Software, pp 268-273, 2004.
  58. Time-Optimal Real-Time Test Case Generation using UPPAAL. Anders Hessel, Kim Larsen, Brian Nielsen, Paul Pettersson, and Arne Skou. In Formal Approaches to Software Testing, Third International Workshop on Formal Approaches to Testing of Software, pp 114-130, 2004.
  59. An Analysis Tool for UML Models with SPT Annotations. John Håkansson, Leonid Mokrushin, Paul Pettersson, and Yi Wang. In Proceedings of the International Workshop on Specification and Validation of UML models for Real Time and Embedded Systems, 2004.
  60. Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata. Pavel Krcal and Yi Wang. In TACAS 2004, LNCS 2988: 10th International Conf. on Tools & Algorithms, 2004.
  61. Timed vs Time Triggered Automata. Pavel Krcal, P.S. Thiagarajan, Yi Wang, and Leonid Mokrushin. In CONCUR 2004, London, UK, pp 340-354, 2004.
  62. Congestion Control in a High Speed Radio Environment. Sara Landström, Lars-Åke Larzon, and Ulf Bodin. In roceedings of the International Conference on Wireless Networks, 2004. (External link).
  63. Properties of TCP-like congestion control. Sara Landström, Lars-Åke Larzon, and Ulf Bodin. In Proceedings of the Swedish National Computer Networking Workshop, 2004.
  64. The Lightweight User Datagram Protocol (UDP-Lite). Lars-Åke Larzon, Mikael Degermark, and Stephen Pink. IETF, 2004. (External link).
  65. Feasibility study of WLAN technology for the Uppsala - Stockholm commuter train.. David Lundberg. Uppsala Universitet, 2004.
  66. A unifying model of variables and names. Marino Miculan and Kidane Yemane. Research Report UDMI nr 15/2004/RR, Department of Mathematics and Computer Science, University of Udine, 2004.
  67. Comparison of Forwarding Strategies in Internet Connected MANETs. Erik Nordström, Per Gunningberg, and Christian Tschudin. In ACM SIGMOBILE Mobile Computing Reviews, volume 1, number 2, 2004. (DOI, External link).
  68. Comparison of Forwarding Strategies in Internet Connected MANETs. Erik Nordström, Per Gunningberg, and Christian Tschudin. In ACM SIGMOBILE Mobile Computing and Communications Review, volume 8, number 4, pp 72-76, ACM, 2004. (DOI).
  69. Comparison of forwarding Strategies in Internet Connected MANETs. Erik Nordström, Per Gunningberg, and Christian Tschudin. In ACM MobiHoc 2004: Poster Session., 2004.
  70. Gateway Forwarding Strategies for Ad Hoc Networks. Erik Nordström, Per Gunningberg, and Christian Tschudin. In AdHoc 04 Johannesberg, 2004.
  71. Symmetry breaking in constraint satisfaction with graph-isomorphism: Comma-free codes. Justin Pearson. In Proceedings of AI&M'04, 2004. (External link).
  72. Proceedings of the 16th Nordic Workshop on Programming Theory. Paul Pettersson and Wang Yi. 2004. (External link).
  73. Protocol Support for Policy-Based Management in Mobile Ad Hoc Networks. Kaustubh Phanse and Luiz DaSilva. In IEEE/IFIP Network Operations and Management Symposium, 2004. (External link).
  74. Timed Patterns: TCOZ to Timed Automata. Hao Ping, Song Dong Jin, Chao Qin Sheng, Sun Jun, and Yi Wang. In 6th International Conf. on Formal Engineering Methods: LNCS 3308, 2004.
  75. An Approach to Hardware/Software Partitioning for Multiple Hardware Devices Model. Geguang Pu, Xiangpeng Zhao, Shuling Wang, Zhongyan Qiu, and Wang Yi. In 2nd International Conference on Software Engineering and Formal Methods (SEFM 2004), 28-30 September 2004, Beijing, China, 2004.
  76. An Approach to Hardware/Software Partitioning for Pultiple Hardware Devices Model. Geguang Pu, Xiaopeng Zhao, Zongyan Qiu, Jifeng He, and Yi Wang. In 3rd IEEE International Conf. on Software Engineering and Formal Methods, 2004.
  77. An Optimal Approach to Hardware/Software Partitioning for Synchronous Model. Geguang Pu, Hung Dang, Jifeng He, and Wang Yi. In Integrated Formal Methods, 4th International Conference, IFM 2004, Canterbury, UK, April 4-7, 2004., 2004.
  78. Addressing heterogeneity in Peer-to-Peer networks. Olof Rensfelt and Lars-Åke Larzon. In Proceedings of the Swedish National Computer Networking Workshop, 2004.
  79. LUNAR over Bluetooth. Olof Rensfelt, Richard Gold, and Lars-Åke Larzon. In Proceedings of the 4:th Scandinavian Workshop on Wireless Ad-Hoc Networks, 2004. (External link).
  80. Building Secure Communities in Spontaneously Networked Environments. Christian Rohner. In 4th Scandinavian Workshop on Wireless Ad-hoc Networks (AdHoc'04), 2004.
  81. Security Bootstrapping for Networked Devices. Christian Rohner. 2004.
  82. Using Ad Hoc Networking in Orienteering A Demonstration. Christian Rohner. In 4th Scandinavian Workshop on Wireless Ad-hoc Networks (AdHoc'04), 2004.
  83. Using Ad-hoc Networking in Orienteering - A Demonstration. Christian Rohner, Henrik Lundgren, and Erik Nordström. In International Conference on Mobile Computing and Networking (Mobicom04), 2004.
  84. Non-viability Deductions in Arc-Consistency Computation. Camilo Rueda and Frank Valencia. In Logic Programming: 20th International Conference, ICLP 2004, pp 343-355, 2004.
  85. On validity in modelization of musical problems by CCP. Camilo Rueda and Frank Valencia. In Soft Computing: A Fusion of Foundations, Methodologies and Applications, volume 8, number 9, pp 641-648, 2004.
  86. Model checking polygonal differential inclusions using invariance kernels. Gerardo Schneider and Gordon Pace. 2004.
  87. Reorganisation in the Skewed-Associative TLB. Thorild Selén. Technical report / Department of Information Technology, Uppsala University nr 2004-027, 2004. (fulltext).
  88. Low Power and Conflict Tolerant Cache Design. Mathias Spjuth, Martin Karlsson, and Erik Hagersten. Technical report / Department of Information Technology, Uppsala University nr 2004-024, 2004. (fulltext).
  89. LUNAR - A Lightweight Underlay Network Ad-hoc Routing Protocol and Implementation. Christian Tschudin, Richard Gold, Olof Rensfelt, and Oskar Wibling. In Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN'04), p 300, 2004.
  90. A Content Adaptation Network using SelNet. Mats Uddenfeldt and Richard Gold. In Second Swedish National Computer Networking Workshop (SNCNW 2004), 2004.
  91. Bundling: Reducing the Overhead of Multiprocessor Prefetchers. Dan Wallin and Erik Hagersten. In 18th International Parallel and Distributed Processing Symposium: (IPDPS 2004), 2004.
  92. Cache memory behavior of advanced PDE solvers. Dan Wallin, Henrik Johansson, and Sverker Holmgren. In Parallel Computing: Software Technology, Algorithms, Architectures and Applications, volume 13 of Advances in Parallel Computing, pp 475-482, Elsevier, Amsterdam, The Netherlands, 2004.
  93. Automatized Verification of Ad Hoc Routing Protocols. Oskar Wibling, Joachim Parrow, and Arnold Pears. In Formal Techniques for Networked and Distributed Systems – FORTE 2004, volume 3235 of Lecture Notes in Computer Science, pp 343-358, Springer-Verlag, Berlin, 2004. (DOI).
  94. Evaluation, Implementation and Performance of Write Permission Caching in the DSZOOM System. Håkan Zeffer, Zoran Radovic, Oskar Grenholm, and Erik Hagersten. Technical reports from the Department of Information Technology nr 2004-005, 2004. (External link).
  95. Exploiting Spatial Store Locality through Permission Caching in Software DSMs. Håkan Zeffer, Zoran Radovic, Oskar Grenholm, and Erik Hagersten. In Proceedings of the 10th International Euro-Par Conference: Parallel Processing, p 551, 2004. (External link).

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