UPMARC_700x150.gif

Publications

UPMARC is financed by the Swedish Research Council and publish with Open access, making research findings free to read and download via the Internet.

UPMARC Publications 2013

  1. An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. Parosh Aziz Abdulla, Frédéric Haziza, Lukas Holik, Bengt Jonsson, and Ahmed Rezine. In Tools and Algorithms for the Construction and Analysis of Systems, 2013.
  2. Monotonic abstraction for programs with multiply-linked structures. Parosh Aziz Abdulla, Jonathan Cederberg, and Tomás Vojnar. In International Journal of Foundations of Computer Science, volume 24, number 2, pp 187-210, 2013.
  3. Ownership Types: A Survey. Dave Clarke, Johan Östlund, Ilya Sergey, and Tobias Wrigstad. In Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volume 7850 of Lecture Notes in Computer Science, pp 15-58, Springer Berlin/Heidelberg, 2013.
  4. Bandwidth Bandit: Quantitative Characterization of Memory Contention. David Eklöv, Nikos Nikoleris, David Black-Schaffer, and Erik Hagersten. In Proc. International Symposium on Code Generation and Optimization: CGO 2013, pp 1-10, IEEE Computer Society, 2013.
  5. Adaptive fast multipole methods on the GPU. Anders Goude and Stefan Engblom. In Journal of Supercomputing, volume 63, pp 897-918, 2013.
  6. Parallel implementation of the Sherman–Morrison matrix inverse algorithm. Xin He, Marcus Holm, and Maya Neytcheva. In Applied Parallel and Scientific Computing, volume 7782 of Lecture Notes in Computer Science, pp 206-219, Springer-Verlag, Berlin, 2013.
  7. Dynamic autotuning of adaptive fast multipole methods on hybrid multicore CPU & GPU systems. Marcus Holm, Stefan Engblom, Anders Goude, and Sverker Holmgren. 2013.
  8. Scientific computing on hybrid architectures. Marcus Holm. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2013-002, 2013.
  9. Higher-order psi-calculi. Joachim Parrow, Johannes Borgström, Palle Raabjerg, and Johannes Åman Pohjola. In Mathematical Structures in Computer Science, Cambridge University Press, 2013. Publication status: In press
  10. Resource-aware task scheduling. Martin Tillenius, Elisabeth Larsson, Rosa M. Badia, and Xavier Martorell. In Proc. 4th Workshop on Parallel Programming and Run-Time Management Techniques for Many-core Architectures (PARMA), p 6, ACM Press, New York, 2013.
  11. Structured Aliasing. Tobias Wrigstad. In Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volume 7850 of Lecture Notes in Computer Science, pp 512-513, Springer Berlin/Heidelberg, 2013.

UPMARC Publications 2012

  1. Regular model checking for LTL(MSO). Parosh Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, and Mayank Saksena. In International Journal on Software Tools for Technology Transfer (STTT), volume 14, number 2, pp 223-241, Springer, 2012.
  2. Adding time to pushdown automata. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman. In Quantities in Formal Methods: QFM 2012, volume 103 of Electronic Proceedings in Theoretical Computer Science, pp 1-16, 2012.
  3. Automatic fence insertion in integer programs via predicate abstraction. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, and Ahmed Rezine. 19th International Static Analysis Symposium, Springer-Verlag, Berlin, 2012.
  4. Counter-Example Guided Fence Insertion under TSO. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, and Ahmed Rezine. In Tools and Algorithms for the Construction and Analysis of Systems, volume 7214 of Lecture Notes in Computer Science, pp 204-219, Springer-Verlag, Berlin, 2012.
  5. Multi-Pushdown Systems with Budgets. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman, and Othmane Rezine. In Formal Methods in Computer-Aided Design, pp 24-33, 2012.
  6. Petri Nets with Time and Cost. Parosh Aziz Abdulla and Mayr Richard. INFINITY 2012, 14th International Workshop on Verification of Infinite-State Systems, 2012.
  7. The minimal cost reachability problem in priced timed pushdown systems. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman. In Language and Automata Theory and Applications: 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012, volume 7183 of Lecture Notes in Computer Science, pp 58-69, Springer-Verlag, Berlin, 2012.
  8. Timed lossy channel systems. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jonathan Cederberg. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2012, volume 18 of Leibniz International Proceedings in Informatics, pp 374-386, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2012.
  9. Detecting fair non-termination in multithreaded programs. Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi, and Akash Lal. In Computer Aided Verification, volume 7358 of Lecture Notes in Computer Science, pp 210-227, Springer-Verlag, Berlin, 2012.
  10. Linear-Time Model-Checking for Multithreaded Programs under Scope-Bounding. Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan. In Automated Technology for Verification and Analysis: ATVA 2012, volume 7561 of Lecture Notes in Computer Science, pp 152-166, Springer Berlin/Heidelberg, 2012.
  11. URDME: a modular framework for stochastic simulation of reaction-transport processes in complex geometries. Brian Drawert, Stefan Engblom, and Andreas Hellander. In BMC Systems Biology, volume 6, pp 76:1-17, 2012.
  12. Profiling Methods for Memory Centric Software Performance Analysis. David Eklöv. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1000, Acta Universitatis Upsaliensis, Uppsala, 2012.
  13. On the stability of stochastic jump kinetics. Stefan Engblom. Technical report / Department of Information Technology, Uppsala University nr 2012-005, 2012.
  14. Adaptive fast multipole methods on the GPU. Anders Goude and Stefan Engblom. Technical report / Department of Information Technology, Uppsala University nr 2012-012, 2012.
  15. 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.
  16. Efficiently parallel implementation of the inverse Sherman–Morrison algorithm. Xin He, Marcus Holm, and Maya Neytcheva. Technical report / Department of Information Technology, Uppsala University nr 2012-017, 2012.
  17. 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.
  18. 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.
  19. Using refinement calculus techniques to prove linearizability. Bengt Jonsson. In Formal Aspects of Computing, volume 24, number 4-6, pp 537-554, 2012.
  20. Low Overhead Instruction-Cache Modeling Using Instruction Reuse Profiles. Muneeb Khan, Andreas Sembrant, and Erik Hagersten. In International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'12), Computer Architecture and High Performance Computing, pp 260-269, IEEE Computer Society, 2012.
  21. Phase Behavior in Serial and Parallel Applications. Andreas Sembrant, David Black-Schaffer, and Erik Hagersten. In International Symposium on Workload Characterization (IISWC'12), IEEE Computer Society, 2012.
  22. Phase Guided Profiling for Fast Cache Modeling. Andreas Sembrant, David Black-Schaffer, and Erik Hagersten. In International Symposium on Code Generation and Optimization (CGO'12), pp 175-185, ACM Press, 2012.
  23. Power-Sleuth: A Tool for Investigating your Program's Power Behavior. Vasileios Spiliopoulos, Andreas Sembrant, and Stefanos Kaxiras. In International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'12), pp 241-250, 2012.
  24. Leveraging multicore processors for scientific computing. Martin Tillenius. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2012-006, 2012.
  25. Structured Aliasing. Tobias Wrigstad. In ECOOP 2012 – Object-Oriented Programming, volume 7313 of Lecture Notes in Computer Science, pp 232-232, Springer Berlin/Heidelberg, 2012.
  26. Programming models based on data versioning for dependency-aware task-based parallelisation. Afshin Zafari, Martin Tillenius, and Elisabeth Larsson. In Proc. 15th International Conference on Computational Science and Engineering, pp 275-280, IEEE Computer Society, Los Alamitos, CA, 2012.
  27. Multiple aggregate entry points for ownership types. Johan Östlund and Tobias Wrigstad. In ECOOP 2012 – Object-Oriented Programming, volume 7313 of Lecture Notes in Computer Science, pp 156-180, Springer Berlin/Heidelberg, 2012.
  28. The Joelle Programming Language: Evolving Java Programs Along Two Axes of Parallel Eval. Johan Östlund, Stephan Brandauer, and Tobias Wrigstad. 2012 International Workshop on Languages for the Multi-core Era, 2012.

UPMARC Publications 2011

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. Verified Stateful Programs with Substructural State and Hoare Types. Johannes Borgström, Juan Chen, and Nikhil Swamy. In Proc. 5th ACM Workshop on Programming Languages Meets Program Verification, pp 15-26, ACM Press, New York, 2011.
  11. 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.
  12. 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.
  13. Computing Systems: Research Challenges Ahead: The HiPEAC Vision 2011/2012. Marc Duranton, David Black-Schaffer, Sami Yehia, and Koen de Bosschere. 2011.
  14. 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.
  15. 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.
  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. On well-separated sets and fast multipole methods. Stefan Engblom. In Applied Numerical Mathematics, volume 61, pp 1096-1102, 2011.
  18. 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.
  19. 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.
  20. 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.
  21. 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.
  22. 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.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. 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.
  28. 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.
  29. 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.
  30. 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.
  31. 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.
  32. 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.
  33. 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.
  34. 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.
  35. 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.

UPMARC Publications 2010

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. Thread-Modular Model Checking of Concurrent Programs under TSO using Code Rewriting. Carl Leonardsson. Student thesis, supervisor: Bengt Jonsson, examiner: Parosh Abdulla, Anders Jansson, IT nr 10 068, 2010.
  20. 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.
  21. 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.
  22. 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.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. 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.
  28. 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.
  29. Verifying parallel programs with dynamic communication structures. Tayssir Touili and Mohamed Faouzi Atig. In Theoretical Computer Science, volume 411, pp 3460-3468, 2010.
  30. 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.
  31. 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.
  32. 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.
  33. 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.

UPMARC Publications 2009

  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. Parallel Structured Adaptive Mesh Refinement. Jarmo Rantakokko and Michael Thuné. In Parallel Computing: Numerics, Applications, and Trends, pp 147-173, Springer-Verlag, London, 2009.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. 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.

UPMARC Publications 2008

  1. Efficient optimization algorithms and implementations for genetic analysis of complex traits on a grid system with multicore nodes. Mahen Jayawardena, Henrik Löf, and Sverker Holmgren. PARA 2008: State of the Art in Scientific and Parallel Computing, Norwegian University of Science and Technology, Trondheim, Norway, 2008.
  2. 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.
  3. 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.
  4. 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.

Other publications by UPMARC researchers

Search for publications in DIVA