UPMARC_700x150.gif

Publications by UPMARC researchers

This list include both UPMARC and other publications

2011

  1. Dense-Timed Pushdown Automata. Parosh Abdulla, Mohamed Faouzi Atig, and Jari Stenman. 2012.
  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.
  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.
  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.
  5. 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.
  6. Psi-calculi: a framework for mobile processes with nominal data and logic. Jesper Bengtson, Magnus Johansson, Joachim Parrow, and Björn Victor. In Logical Methods in Computer Science, volume 7, number 1, p 11, 2011.
  7. Refinement types for secure implementations. Jesper Bengtson, Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon, and Sergio Maffeis. In ACM Transactions on Programming Languages and Systems, volume 33, number 2, pp 8:1-45, 2011.
  8. 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.
  9. 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.
  10. Broadcast Psi-calculi with an Application to Wireless Protocols. Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, and Joachim Parrow. In Software Engineering and Formal Methods: SEFM 2011, volume 7041 of Lecture Notes in Computer Science, pp 74-89, Springer Berlin/Heidelberg, Berlin, 2011.
  11. Professionella kompetenser i projektkurser. Åsa Cajander, Mats Daniels, Helena Bernáld, and Björn Victor. 3:e Utvecklingskonferensen för Sveriges ingenjörsutbildningar, Norrköping, 2011.
  12. The Impact of Trace and Adversary Models on Location Privacy Provided by K-anonymity. Volkan Cambazoglu, Christian Rohner, and Björn Victor. In EuroSys 2012 Workshop on Measurement, Privacy, and Mobility (MPM), 2012. (To appear.)
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. Stable computations with Gaussian radial basis functions. Bengt Fornberg, Elisabeth Larsson, and Natasha Flyer. In SIAM Journal on Scientific Computing, volume 33, pp 869-892, 2011.
  19. A type and effect system for deadlock avoidance in low-level languages. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Proc. 6th International Workshop on Types in Language Design and Implementation, pp 15-28, ACM Press, New York, 2011.
  20. 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: RTSS 2011, pp 13-23, IEEE, Piscataway, NJ, 2011.
  21. 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.
  22. 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.
  23. Communication-efficient algorithms for numerical quantum dynamics. Magnus Gustafsson, Katharina Kormann, and Sverker Holmgren. In Applied Parallel and Scientific Computing: Part II, volume 7134 of Lecture Notes in Computer Science, pp 368-378, Springer-Verlag, Berlin, 2012.
  24. Numerical evaluation of the Communication-Avoiding Lanczos algorithm. Magnus Gustafsson, James Demmel, and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2012-001, 2012.
  25. Stable difference methods for block-structured adaptive grids. Magnus Gustafsson, Anna Nissen, and Katharina Kormann. Technical report / Department of Information Technology, Uppsala University nr 2011-022, 2011.
  26. Towards an adaptive solver for high-dimensional PDE problems on clusters of multicore processors. Magnus Gustafsson. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2012-003, 2012.
  27. 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.
  28. 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.
  29. 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.
  30. Efficiently implementing Monte Carlo electrostatics simulations on multicore accelerators. Marcus Holm and Sverker Holmgren. In Applied Parallel and Scientific Computing: Part II, volume 7134 of Lecture Notes in Computer Science, pp 379-388, Springer-Verlag, Berlin, 2012.
  31. 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.
  32. 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.
  33. 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.
  34. Computing Strong and Weak Bisimulations for Psi-Calculi. Magnus Johansson, Björn Victor, and Joachim Parrow. In Journal of Logic and Algebraic Programming, volume 81, number 3, pp 162-180, Elsevier, 2012.
  35. 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.
  36. 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.
  37. 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.
  38. Global error control of the time-propagation for the Schrödinger equation with a time-dependent Hamiltonian. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. In Journal of Computational Science, volume 2, pp 178-187, 2011.
  39. Radial basis functions for the time-dependent Schrödinger equation. Katharina Kormann and Elisabeth Larsson. In Numerical Analysis and Applied Mathematics: ICNAAM 2011, volume 1389 of AIP Conference Proceedings, pp 1323-1326, American Institute of Physics (AIP), Melville, NY, 2011.
  40. 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.
  41. 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: ATVA 2011, volume 6996 of Lecture Notes in Computer Science, pp 414-417, Springer-Verlag, Berlin, 2011.
  42. 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.
  43. 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.
  44. Making the Most of Your Contacts: Transfer Ordering in Data-Centric Opportunistic Networks. Christian Rohner, Fredrik Bjurefors, Per Gunningberg, Liam McNamara, and Erik Nordström. In Proceedings of the 2012 ACM MobiOpp Workshop on Mobile Opportunistic Networks, ACM Press, Zürich, 2012.
  45. 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.
  46. Efficient software-based online phase classification. Andreas Sembrant, David Eklöv, and Erik Hagersten. In Proc. International Symposium on Workload Characterization: IISWC 2011, pp 104-115, IEEE Computer Society, 2011.
  47. 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.
  48. 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.
  49. Implementation of a collocated boundary element method for acoustic wave propagation in multilayered fluid media. Elena Sundkvist and Elisabeth Larsson. Technical report / Department of Information Technology, Uppsala University nr 2011-016, 2011.
  50. 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.
  51. A scalable architecture for e-Science data management. Salman Toor, Manivasakan Sabesan, Sverker Holmgren, and Tore Risch. In Proc. 7th International Conference on e-Science, pp 210-217, IEEE, Piscataway, NJ, 2011.
  52. Investigating an open source cloud storage infrastructure for CERN-specific data analysis. Salman Toor, Rainer Töebbicke, Maitane Zotes Resines, and Sverker Holmgren. In Proc. 7th International Conference on Networking, Architecture, and Storage, IEEE, Piscataway, NJ, 2012.
  53. Scientific analysis by queries in extended SPARQL over a distributed e-Science data store. Salman Toor, Andrej Andrejev, Andreas Hellander, Sverker Holmgren, and Tore Risch. International Conference for High Performance Computing, Networking, Storage and Analysis (SC 2012) (Submitted), 2012.
  54. Is the World Ready for Ownership Types? Is Ownership Types Ready for the World?. Tobias Wrigstad and Dave Clarke. International Workshop on Aliasing, Confinement and Ownership in object-oriented programming: IWACO at ECOOP (Vetenskapsrådet), 2011.
  55. Owners as Ombudsmen: Multiple Aggregate Entry Points for Ownership Types. Tobias Wrigstad and Johan Östlund. International Workshop on Aliasing, Confinement and Ownership in object-oriented programming: IWACO at ECOOP (Vetenskapsrådet), 2011.
  56. 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.
  57. 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.
  58. Regions as Owners: A Discussion on Ownership-based Effects in Practice. Johan Östlund and Tobias Wrigstad. International Workshop on Aliasing, Confinement and Ownership in object-oriented programming: IWACO at ECOOP, 2011.

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.
  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.
  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.
  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.
  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.
  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.
  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.
  9. Formalising process calculi. Jesper Bengtson. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 93, Acta Universitatis Upsaliensis, Uppsala, 2010.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. A note on radial basis function interpolant limits. Martin D. Buhmann, Slawomir Dinew, and Elisabeth Larsson. In IMA Journal of Numerical Analysis, volume 30, pp 543-554, 2010.
  15. Tribal ownership. Nicholas Cameron, James Noble, and Tobias Wrigstad. In Proc. 1st International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, volume 45:10 of ACM SIGPLAN Notices, pp 618-633, ACM Press, New York, 2010.
  16. Static detection of race conditions in Erlang. Maria Christakis and Konstantinos Sagonas. In Practical Aspects of Declarative Languages: PADL 2010, volume 5937 of Lecture Notes in Computer Science, pp 119-133, Springer-Verlag, Berlin, 2010.
  17. 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.
  18. 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.
  19. A concurrent language with a uniform treatment of regions and locks. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Proc. 2nd Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software: PLACES 2009, volume 17 of Electronic Proceedings in Theoretical Computer Science, pp 79-93, 2010.
  20. Race-free and memory-safe multithreading: Design and implementation in Cyclone. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Proc. 5th International Workshop on Types in Language Design and Implementation, pp 15-26, ACM Press, New York, 2010.
  21. Learning of event-recording automata. Olga Grinchtein, Bengt Jonsson, and Martin Leucker. In Theoretical Computer Science, volume 411, number 47, pp 4029-4054, 2010.
  22. 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.
  23. 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.
  24. An implementation framework for solving high-dimensional PDEs on massively parallel computers. Magnus Gustafsson and Sverker Holmgren. In Numerical Mathematics and Advanced Applications: 2009, pp 417-424, Springer-Verlag, Berlin, 2010.
  25. 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.
  26. 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.
  27. A Grid-Enabled Problem Solving Environment for QTL Analysis in R. Mahen Jayawardena, Carl Nettelblad, Salman Toor, Per-Olov Östberg, Erik Elmroth, and Sverker Holmgren. In Proc. 2nd International Conference on Bioinformatics and Computational Biology, pp 202-209, ISCA, Cary, NC, 2010.
  28. Computational and visualization tools for genetic analysis of complex traits. Mahen Jayawardena, Salman Toor, and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2010-001, 2010.
  29. A Fully Abstract Symbolic Semantics for Psi-Calculi. Magnus Johansson, Björn Victor, and Joachim Parrow. In Proc. 6th Workshop on Structural Operational Semantics: SOS 2009, volume 18 of Electronic Proceedings in Theoretical Computer Science, pp 17-31, 2010.
  30. Weak Equivalences in Psi-calculi. Magnus Johansson, Jesper Bengtson, Joachim Parrow, and Björn Victor. In Proc. 25th Symposium on Logic in Computer Science: LICS 2010, pp 322-331, IEEE, Piscataway, NJ, 2010.
  31. 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.
  32. A Fourier-coefficient based solution of an optimal control problem in quantum chemistry. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. In Journal of Optimization Theory and Applications, volume 147, pp 491-506, 2010.
  33. Efficient algorithms for multidimensional global optimization in genetic mapping of complex traits. Kajsa Ljungberg, Kateryna Mishchenko, and Sverker Holmgren. In Advances and Applications in Bioinformatics and Chemistry, volume 3, pp 75-88, 2010.
  34. Early results using hardware transactional memory for high-performance computing applications. Karl Ljungkvist, Martin Tillenius, Sverker Holmgren, Martin Karlsson, and Elisabeth Larsson. In Proc. 3rd Swedish Workshop on Multi-Core Computing, pp 93-97, Chalmers University of Technology, Göteborg, Sweden, 2010.
  35. 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.
  36. 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.
  37. Assessing a multiple QTL search using the variance component model. Kateryna Mishchenko, Lars Rönnegård, Sverker Holmgren, and Volodymyr Mishchenko. In Computational biology and chemistry (Print), volume 34, pp 34-41, 2010.
  38. Stochastically guaranteed global optima in multi-dimensional QTL searches. Carl Nettelblad and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2010-006, 2010.
  39. 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.
  40. 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.
  41. Using static analysis to detect type errors and concurrency defects in Erlang programs. Konstantinos Sagonas. In Functional and Logic Programming: FLOPS 2010, volume 6009 of Lecture Notes in Computer Science, pp 13-18, Springer-Verlag, Berlin, 2010.
  42. 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.
  43. 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.
  44. An efficient task-based approach for solving the <em>n</em>-body problem on multicore architectures. Martin Tillenius and Elisabeth Larsson. PARA 2010: State of the Art in Scientific and Parallel Computing, University of Iceland, Reykjavík, 2010.
  45. Case-study for different models of resource brokering in grid systems. Salman Toor, Bjarte Mohn, David Cameron, and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2010-009, 2010.
  46. Analysis and visualization of information quality of technical documentation. Anna Wingkvist, Welf Löwe, Morgan Ericsson, and Rüdiger Lincke. In Proc. 4th European Conference on Information Management and Evaluation, pp 388-396, Academic Conferences, Reading, UK, 2010.
  47. Information quality testing. Anna Wingkvist, Morgan Ericsson, Welf Löwe, and Rüdiger Lincke. In Perspectives in Business Informatics Research, volume 64 of Lecture Notes in Business Information Processing, pp 14-26, Springer-Verlag, Berlin, 2010.
  48. 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.
  49. Welterweight Java. Johan Östlund and Tobias Wrigstad. In Objects, Models, Components, Patterns, volume 6141 of Lecture Notes in Computer Science, pp 97-116, Springer-Verlag, Berlin, 2010.

2009

  1. Approximated Context-Sensitive Analysis for Parameterized Verification. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Formal Techniques for Distributed Systems: Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings, volume 5522 of Lecture notes in computer science, pp 41-56, 2009.
  2. Approximated parameterized verification of infinite-state processes with global conditions. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Formal methods in system design, volume 34, number 2, pp 126-156, 2009.
  3. Automatic Verification of Directory-Based Consistency Protocols. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Reachability Problems: 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, volume 5797 of Lecture notes in computer science, pp 36-50, 2009.
  4. Monotonic Abstraction: on Efficient Verification of Parameterized Systems. Aziz Abdulla, Giorgio Delzanno, Ben Henda, and Ahmed Rezine. In International Journal of Foundations of Computer Science, volume 20, number 5, pp 779-801, 2009.
  5. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In Electronical Notes in Theoretical Computer Science, volume 251, pp 27-48, 2009.
  6. Composed bisimulation for tree automata. Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In International Journal of Foundations of Computer Science, volume 20, number 4, pp 685-700, 2009.
  7. Universality of R-automata with value copying. Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi. In Electronical Notes in Theoretical Computer Science, volume 239, pp 131-141, 2009.
  8. Formalising the π-calculus using nominal logic. Jesper Bengtson and Joachim Parrow. In Logical Methods in Computer Science, volume 5, number 2, pp 16:1-36, 2009.
  9. Psi-calculi: Mobile processes, nominal data, and logic. Jesper Bengtson, Magnus Johansson, Joachim Parrow, and Björn Victor. In Proc. 24th Annual IEEE Symposium on Logic in Computer Science, pp 39-48, IEEE, Piscataway, NJ, 2009.
  10. Psi-calculi in Isabelle. Jesper Bengtson and Joachim Parrow. In Theorem Proving in Higher Order Logics: Proceedings of TPHOLs 2009, volume 5674 of Lecture Notes in Computer Science, pp 99-114, Springer-Verlag, Berlin, 2009.
  11. Stable computations with Gaussian radial basis functions in 2-D. Bengt Fornberg, Elisabeth Larsson, and Natasha Flyer. Technical report / Department of Information Technology, Uppsala University nr 2009-020, 2009.
  12. Cache-aware scheduling and analysis for multicores. Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. In Proc. 9th ACM International Conference on Embedded Software, pp 245-254, ACM Press, New York, 2009.
  13. Improving scalability of model-checking for minimizing buffer requirements of synchronous dataflow graphs. Nan Guan, Zonghua Gu, Wang Yi, and Ge Yu. In Proc. 14th Asia and South Pacific Design Automation Conference, pp 715-720, IEEE, Piscataway, NJ, 2009.
  14. New Response Time Bounds for Fixed Priority Multiprocessor Scheduling. Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. In Proc. Real-Time Systems Symposium: RTSS 2009, pp 387-397, IEEE, Piscataway, NJ, 2009.
  15. Efficient implementation of a high-dimensional PDE-solver on multicore processors. Magnus Gustafsson and Sverker Holmgren. In Proc. 2nd Swedish Workshop on Multi-Core Computing, pp 64-66, Department of Information Technology, Uppsala University, Uppsala, Sweden, 2009.
  16. CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. Valérie Issarny, Bernhard Steffen, Bengt Jonsson, Gordon Blair, Paul Grace, Marta Kwiatkowska, Radu Calinescu, Paola Inverardi, Massimo Tivoli, Antonia Bertolino, and Antonino Sabetta. In Proc. 14th International Conference on Engineering of Complex Computer Systems, pp 154-161, IEEE, Piscataway, NJ, 2009.
  17. A grid portal for genetic analysis of complex traits. Mahen Jayawardena, Salman Toor, and Sverker Holmgren. In Proc. 32nd International Convention on Information and Communication Technology, Electronics and Microelectronics: Volume I, pp 281-284, MIPRO, Rijeka, Croatia, 2009.
  18. Using SPIN to model check concurrent algorithms, using a translation from C to Promela. Ke Jiang and Bengt Jonsson. In Proc. 2nd Swedish Workshop on Multi-Core Computing, pp 67-69, Department of Information Technology, Uppsala University, Uppsala, Sweden, 2009.
  19. A Fourier-coefficient based solution of an optimal control problem in quantum chemistry. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. Technical report / Department of Information Technology, Uppsala University nr 2009-022, 2009.
  20. Global error control of the time-propagation for the Schrödinger equation with a time-dependent Hamiltonian. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. Technical report / Department of Information Technology, Uppsala University nr 2009-021, 2009.
  21. Implicit-explicit Runge-Kutta methods for stiff combustion problems. Erik Lindblad, Damir M. Valiev, Bernhard Müller, Jarmo Rantakokko, Per Lötstedt, and Michael A. Liberman. In Shock Waves: Volume 1, pp 299-304, Springer-Verlag, Berlin, 2009.
  22. WCET Analysis of the μC/OS-II Real-Time Kernel. Mingsong Lv, Nan Guan, Yi Zhang, Rui Chen, Qingxu Deng, Ge Yu, and Wang Yi. In Proc. 12th International Conference on Computational Science and Engineering: Vol. 2, pp 270-276, IEEE, Piscataway, NJ, 2009.
  23. cnF2freq: Efficient determination of genotype and haplotype probabilities in outbred populations using Markov models. Carl Nettelblad, Sverker Holmgren, Lucy Crooks, and Örjan Carlborg. In Bioinformatics and Computational Biology, volume 5462 of Lecture Notes in Computer Science, pp 307-319, Springer-Verlag, Berlin, 2009.
  24. A Search-based Network Architecture for Mobile Devices. Erik Nordström, Per Gunningberg, and Christian Rohner. Technical report / Department of Information Technology, Uppsala University nr 2009-003, 2009.
  25. Haggle: A Data-centric Network Architecture for Mobile Devices. Erik Nordström, Per Gunningberg, and Christian Rohner. 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing: Mobihoc Wireless S3 Workshop (Invited talk), 2009.
  26. Parallel Structured Adaptive Mesh Refinement. Jarmo Rantakokko and Michael Thuné. In Parallel Computing: Numerics, Applications, and Trends, pp 147-173, Springer-Verlag, London, 2009.
  27. Sensei-UU: a flexible testbed for heterogeneous wireless sensor networks. Olof Rensfelt, Frederik Hermans, Christofer Ferm, Lars-Åke Larzon, and Per Gunningberg. In Testbeds and Research Infrastructures for the Development of Networks Communities and Workshops, 2009. TridentCom 2009. 5th International Conference on, pp 1-2, 2009.
  28. Automatic refactoring of Erlang programs. Konstantinos Sagonas and Thanassis Avgerinos. In Proc. 11th ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp 13-23, ACM Press, New York, 2009.
  29. Efficient detection of communication in multi-cores. Andreas Sandberg and Stefanos Kaxiras. In Proc. 2nd Swedish Workshop on Multi-Core Computing, pp 119-121, Department of Information Technology, Uppsala University, Uppsala, Sweden, 2009.
  30. Reconsidering algorithms for iterative solvers in the multicore era. Dan Wallin, Henrik Löf, Erik Hagersten, and Sverker Holmgren. In International Journal of Computational Science and Engineering, volume 4, pp 270-282, 2009.
  31. A meta-model describing the development process of mobile learning. Anna Wingkvist and Morgan Ericsson. In Advances in Web Based Learning – ICWL 2009, volume 5686 of Lecture Notes in Computer Science, pp 454-463, Springer-Verlag, Berlin, 2009.
  32. Current practice in mobile learning: A survey of research method and purpose. Anna Wingkvist and Morgan Ericsson. In Proc. 8th World Conference on Mobile and Contextual Learning, pp 103-111, University of Central Florida, Orlando, FL, 2009.
  33. Dealing with stakeholders in mobile learning: A study of three initiatives. Anna Wingkvist and Morgan Ericsson. In Proc. 32nd Information Systems Research Seminar in Scandinavia, pp A72:1-14, Molde University College, Norway, 2009.
  34. Sharing experience from three initiatives in mobile learning: Lessons learned. Anna Wingkvist and Morgan Ericsson. In Proc. 17th International Conference on Computers in Education, pp 613-617, Asia-Pacific Society for Computers in Education, Jhongli City, Taiwan, 2009.
  35. Thinking ahead in mobile learning projects: A survey on risk assessment. Anna Wingkvist and Morgan Ericsson. In Proc. 8th International Conference on Perspectives in Business Informatics Research, pp 57-66, Kristianstad Academic Press, Sweden, 2009.
  36. Modeling and analysis of thread-pools in an industrial communication platform. Frank S. de Boer, Immo Grabe, Mohammad Mahdi Jaghoori, Andries Stam, and Wang Yi. In Formal Methods and Software Engineering, volume 5885 of Lecture Notes in Computer Science, pp 367-386, Springer-Verlag, Berlin, 2009.

2008

  1. Monotonic Abstraction in Parameterized Verification. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Electronical Notes in Theoretical Computer Science, volume 223, pp 3-14, 2008.
  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-Verlag, Berlin, 2008.
  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-Verlag, Berlin, 2008.
  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.
  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.
  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.
  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.
  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.
  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.
  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.
  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.
  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. Refinement 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.
  16. 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.
  17. Regular Inference for Communication Protocol Entities. Therese Bohlin and Bengt Jonsson. Technical report / Department of Information Technology, Uppsala University nr 2008-024, 2008.
  18. 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.
  19. 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.
  20. Empowering a flexible application portal with a SOA-based grid job management framework. Erik Elmroth, Sverker Holmgren, Jonas Lindemann, Salman Toor, and Per-Olov Östberg. In Proc. 9th International Workshop on State-of-the-Art in Scientific and Parallel Computing, 2008.
  21. 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.
  22. Learning of Event-Recording Automata. Olga Grinchtein, Bengt Jonsson, and Martin Leucker. Technical report / Department of Information Technology, Uppsala University nr 2008-013, 2008.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. 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.
  28. 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.
  29. 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.
  30. Accurate time propagation for the Schrödinger equation with an explicitly time-dependent Hamiltonian. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. In Journal of Chemical Physics, volume 128, pp 184101:1-11, 2008.
  31. Multi-dimensional option pricing using radial basis functions and the generalized Fourier transform. Elisabeth Larsson, Krister Åhlander, and Andreas Hall. In Journal of Computational and Applied Mathematics, volume 222, pp 175-192, 2008.
  32. Newton-type methods for REML estimation in genetic analysis of quantitative traits. Kateryna Mishchenko, Sverker Holmgren, and Lars Rönnegård. In Journal of Computational Methods in Sciences and Engineering, volume 8, pp 53-67, 2008.
  33. Geographical locality and dynamic data migration for OpenMP implementations of adaptive PDE solvers. Markus Nordén, Henrik Löf, Jarmo Rantakokko, and Sverker Holmgren. In OpenMP Shared Memory Parallel Programming, volume 4315 of Lecture Notes in Computer Science, pp 382-393, Springer-Verlag, Berlin, 2008.
  34. Expressiveness of Process Algebras. Joachim Parrow. In Electronical Notes in Theoretical Computer Science, volume 209, pp 173-186, 2008.
  35. Improved radial basis function methods for multi-dimensional option pricing. Ulrika Pettersson, Elisabeth Larsson, Gunnar Marcusson, and Jonas Persson. In Journal of Computational and Applied Mathematics, volume 222, pp 82-93, 2008.
  36. 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.
  37. 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.
  38. Gradual Typing of Erlang Programs: A Wrangler Experience. Konstantinos Sagonas and Daniel Luna. In Proc. 7th ACM SIGPLAN Workshop on ERLANG, pp 73-81, ACM Press, New York, 2008.
  39. 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.
  40. 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.