Publications

1. Multigrid for matrix-free high-order finite element computations on graphics processors. Martin Kronbichler and Karl Ljungkvist. In ACM Transactions on Parallel Computing, volume 6, number 1, pp 2:1-32, 2019.
2. Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores. Jonatan Lindén, Pavol Bauer, Stefan Engblom, and Bengt Jonsson. In ACM Transactions on Modeling and Computer Simulation, volume 29, number 2, pp 11:1-25, 2019.
3. Supervised classification methods for flash X-ray single particle diffraction imaging. Jing Liu, Gijs van der Schot, and Stefan Engblom. In Optics Express, volume 27, pp 3884-3899, 2019.
4. Model Checking of Software Systems under Weak Memory Models. Tuan-Phong Ngo. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1745, Acta Universitatis Upsaliensis, Uppsala, 2019.
5. Efficient Memory Modeling During Simulation and Native Execution. Nikos Nikoleris. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1756, Acta Universitatis Upsaliensis, Uppsala, 2019.
6. SimInf: An R package for data-driven stochastic disease spread simulations. Stefan Widgren, Pavol Bauer, Robin Eriksson, and Stefan Engblom. In Journal of Statistical Software, volume 91, number 12, pp 1-42, 2019.
7. DuctTeip: An efficient programming model for distributed task-based parallel computing. Afshin Zafari, Elisabeth Larsson, and Martin Tillenius. In Parallel Computing, volume 90, 2019.

1. Optimal Stateless Model Checking under the Release-Acquire Semantics. Parosh Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, and Tuan-Phong Ngo. In SPLASH OOPSLA 2018, Boston, Nov 4-9, 2018, ACM Digital Library, 2018.
2. Perfect timed communication is hard. Parosh Abdulla, Mohamed Faouzi Atig, and Shankara Narayanan Krishna. In Formal Modeling and Analysis of Timed Systems, volume 11022 of Lecture Notes in Computer Science, pp 91-107, Springer, 2018.
3. A load-buffer semantics for total store ordering. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo. In Logical Methods in Computer Science, volume 14, number 1, 2018.
4. Fragment abstraction for concurrent shape analysis. Parosh Aziz Abdulla, Bengt Jonsson, and Cong Quy Trinh. In Programming Languages and Systems, volume 10801 of Lecture Notes in Computer Science, pp 442-471, Springer, 2018.
5. Replacing store buffers by load buffers in TSO. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo. In Verification and Evaluation of Computer and Communication Systems, volume 11181 of Lecture Notes in Computer Science, pp 22-28, Springer, 2018.
6. Verification of timed asynchronous programs. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna, and Shaan Vaidya. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2018, volume 122 of Leibniz International Proceedings in Informatics, pp 8:1-16, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2018.
7. Effective Techniques for Stateless Model Checking. Stavros Aronis. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1602, Acta Universitatis Upsaliensis, Uppsala, 2018.
8. Optimal dynamic partial order reduction with observers. Stavros Aronis, Bengt Jonsson, Magnus Lång, and Konstantinos Sagonas. In Tools and Algorithms for the Construction and Analysis of Systems: Part II, volume 10806 of Lecture Notes in Computer Science, pp 229-248, Springer, 2018.
9. Multiscale modelling via split-step methods in neural firing. Pavol Bauer, Stefan Engblom, Sanja Mikulovic, and Aleksandar Senek. In Mathematical and Computer Modelling of Dynamical Systems, volume 24, pp 426-445, 2018.
10. C?: A New Modular Approach to Implementing Efficient and Tunable Collections. Stephan Brandauer, Elias Castegren, and Tobias Wrigstad. In Proceedings of the 2018 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward! 2018), pp 57-71, ACM, 2018.
11. Structured Data. Stephan Brandauer. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1749, Acta Universitatis Upsaliensis, Uppsala, 2018.
12. Bestow and Atomic: Concurrent programming using isolation, delegation and grouping. Elias Castegren, Joel Wallin, and Tobias Wrigstad. In The Journal of logical and algebraic methods in programming, volume 100, pp 130-151, 2018.
13. Capability-Based Type Systems for Concurrency Control. Elias Castegren. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1611, Acta Universitatis Upsaliensis, Uppsala, 2018.
14. Analyzing performance variation of task schedulers with TaskInsight. Germán Ceballos, Thomas Grass, Andra Hugo, and David Black-Schaffer. In Parallel Computing, volume 75, pp 11-27, 2018.
15. Behind the Scenes: Memory Analysis of Graphical Workloads on Tile-based GPUs. Germán Ceballos, Andreas Sembrant, Trevor E. Carlson, and David Black-Schaffer. In Proc. International Symposium on Performance Analysis of Systems and Software: ISPASS 2018, pp 1-11, IEEE Computer Society, 2018.
16. Understanding Task Parallelism: Providing insight into scheduling, memory, and performance for CPUs and Graphics. Germán Ceballos. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1737, Acta Universitatis Upsaliensis, Uppsala, 2018.
17. Pathwise error bounds in multiscale variable splitting methods for spatial stochastic kinetics. Augustin Chevallier and Stefan Engblom. In SIAM Journal on Numerical Analysis, volume 56, pp 469-498, 2018.
18. Mesoscopic modeling of random walk and reactions in crowded media. Stefan Engblom, Per Lötstedt, and Lina Meinecke. In Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, volume 98, pp 033304:1-16, 2018.
19. Towards Bayesian parametrization of national scale epidemics. Robin Eriksson, Stefan Engblom, and Stefan Widgren. In MATHMOD 2018 Extended Abstracts, pp 65-66, ARGESIM Publisher, Vienna, Austria, 2018.
20. Correctness of a concurrent object collector for actor languages. Juliana Franco, Sylvan Clebsch, Sophia Drossopoulou, Jan Vitek, and Tobias Wrigstad. In Programming Languages and Systems, volume 10801 of Lecture Notes in Computer Science, pp 885-911, Springer, 2018.
21. Safely Abstracting Memory Layouts. Juliana Franco, Alexandros Tasos, Sophia Drossopoulou, Tobias Wrigstad, and Susan Eisenbach. In 20th Workshop on Formal Techniques for Java-like Programs, 2018.
22. A general high order two-dimensional panel method. Anders Goude and Stefan Engblom. In Applied Mathematical Modelling, volume 60, pp 1-17, 2018.
23. A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. Jonatan Lindén and Bengt Jonsson. Technical report / Department of Information Technology, Uppsala University nr 2018-003, 2018.
24. Fine-grained local dynamic load balancing in PDES. Jonatan Lindén, Pavol Bauer, Stefan Engblom, and Bengt Jonsson. In Proc. 6th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, pp 201-212, ACM Press, New York, 2018.
25. Synchronization Techniques in Parallel Discrete Event Simulation. Jonatan Lindén. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1634, Acta Universitatis Upsaliensis, Uppsala, 2018.
26. Assessing uncertainties in x-ray single-particle three-dimensional reconstruction. Jing Liu, Stefan Engblom, and Carl Nettelblad. In Physical Review E. Statistical, Nonlinear, and Soft Matter Physics, volume 98, pp 013303:1-12, 2018.
27. Extending SHAPES for SIMD Architectures –: An approach to native support for Struct of Arrays in languages. Alexandros Tasos, Juliana Franco, Tobias Wrigstad, Sophia Drossopoulou, and Susan Eisenbach. In 13th Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems Workshop, 2018.
28. SWOOP: software-hardware co-design for non-speculative, execute-ahead, in-order cores. Kim-Anh Tran, Alexandra Jimborean, Trevor E. Carlson, Konstantinos Koukos, Magnus Själander, and Stefanos Kaxiras. In Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp 328-343, Association for Computing Machinery (ACM), 2018.
29. Static instruction scheduling for high performance on energy-efficient processors. Kim-Anh Tran. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2018-001, Uppsala University, 2018.
30. Static instruction scheduling for high performance on limited hardware. Kim-Anh Tran, Trevor E. Carlson, Konstantinos Koukos, Magnus Själander, Vasileios Spiliopoulos, Stefanos Kaxiras, and Alexandra Jimborean. In IEEE Transactions on Computers, volume 67, number 4, pp 513-527, 2018.
31. Spatio-temporal modelling of verotoxigenic <em>Escherichia coli</em> O157 in cattle in Sweden: exploring options for control. Stefan Widgren, Stefan Engblom, Ulf Emanuelson, and Ann Lindberg. In Veterinary research (Print), volume 49, pp 78:1-13, 2018.
32. Dynamic Adaptations of Synchronization Granularity in Concurrent Data Structures. Kjell Winblad. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1684, Acta Universitatis Upsaliensis, Uppsala, 2018.
33. Advances in Task-Based Parallel Programming for Distributed Memory Architectures. Afshin Zafari. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1621, Acta Universitatis Upsaliensis, Uppsala, 2018.
34. Distributed dynamic load balancing for task parallel programming. Afshin Zafari and Elisabeth Larsson. 2018.
35. Caches, Transactions and Memories: Models, Coherence and Consistency. Yunyun Zhu. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1665, Acta Universitatis Upsaliensis, Uppsala, 2018.
36. Parallel Programming With Arrays in Kappa. Beatrice Åkerblom, Elias Castegren, and Tobias Wrigstad. In 5th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, 2018.

1. Comparing source sets and persistent sets for partial order reduction. Parosh Abdulla, Stavros Aronis, Bengt Jonsson, and Konstantinos Sagonas. In Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, volume 10460 of Lecture Notes in Computer Science, pp 516-536, Springer, 2017.
2. Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. Parosh Abdulla, Stavros Aronis, Bengt Jonsson, and Konstantinos Sagonas. In Journal of the ACM, volume 64, number 4, Association for Computing Machinery (ACM), 2017.
3. Context-bounded analysis for POWER. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo. In Tools and Algorithms for the Construction and Analysis of Systems: Part II, volume 10206 of Lecture Notes in Computer Science, pp 56-74, Springer, 2017.
4. Stateless model checking for TSO and PSO. Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, and Konstantinos Sagonas. In Acta Informatica, volume 54, number 8, pp 789-818, 2017.
5. Synthesis of Ada code from graph-based task models. Jakaria Abdullah, Morteza Mohaqeqi, and Wang Yi. In Proc. 32nd ACM Symposium on Applied Computing, pp 1467-1472, ACM Press, New York, 2017.
6. Exploring the performance limits of out-of-order commit. Mehdi Alipour, Trevor E. Carlson, and Stefanos Kaxiras. In Proc. 14th Computing Frontiers Conference, pp 211-220, ACM Press, New York, 2017.
7. Testing And Verifying Chain Repair Methods For CORFU Using Stateless Model Checking. Stavros Aronis, Konstantinos Sagonas, and Scott Lystig Fritchie. In , volume 10510 of Lecture Notes in Computer Science, pp 227-242, Springer, Cham, 2017.
8. The shared-memory interferences of Erlang/OTP built-ins. Stavros Aronis and Konstantinos Sagonas. In Proceedings Of The 16Th Acm Sigplan International Workshop On Erlang (Erlang '17), pp 43-54, Association for Computing Machinery (ACM), New York, 2017.
9. On the Upward/Downward Closures of Petri Nets?. Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, and Prakash Saivasan. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), volume 83 of Leibniz International Proceedings in Informatics (LIPIcs), pp 49:1-49:14, Dagstuhl, Germany, 2017.
10. Parity Games on Bounded Phase Multi-pushdown Systems. Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan. In Networked Systems: 5th International Conference, NETYS 2017, Marrakech, Morocco, May 17-19, 2017, Proceedings, volume 10299 of Lecture Notes in Computer Science, pp 272-287, Cham, 2017.
11. Verification of Asynchronous Programs with Nested Locks. Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, volume 93 of Leibniz International Proceedings in Informatics (LIPIcs), pp 11:1-11:14, Dagstuhl, Germany, 2017.
12. Data Multi-Pushdown Automata. Parosh Aziz Abdulla, C. Aiswarya, and Mohamed Faouzi Atig. In The 28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany, volume 85 of Leibniz International Proceedings in Informatics (LIPIcs), pp 38:1-38:17, Dagstuhl, Germany, 2017.
13. Parallelism in Event-Based Computations with Applications in Biology. Pavol Bauer. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1586, Acta Universitatis Upsaliensis, Uppsala, 2017.
14. Adaptive cache warming for faster simulations. Gustaf Borgström, Andreas Sembrant, and David Black-Schaffer. In Proc. 9th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools, ACM Press, New York, 2017.
15. Transcending hardware limits with software out-of-order processing. Trevor E. Carlson, Kim-Anh Tran, Alexandra Jimborean, Konstantinos Koukos, Magnus Själander, and Stefanos Kaxiras. In IEEE Computer Architecture Letters, volume 16, number 2, pp 162-165, 2017.
16. Relaxed Linear References for Lock-free Data Structures. Elias Castegren and Tobias Wrigstad. In , pp 47:1-47:31, 2017.
17. Analyzing Graphics Workloads on Tile-based GPUs. Germán Ceballos, Andreas Sembrant, Trevor E. Carlson, and David Black-Schaffer. In Proc. 20th International Symposium on Workload Characterization, pp 108-109, IEEE, 2017.
18. Exploring scheduling effects on task performance with TaskInsight. Germán Ceballos, Andra Hugo, Erik Hagersten, and David Black-Schaffer. In Supercomputing frontiers and innovations, volume 4, number 3, pp 91-98, 2017.
19. How to make tasks faster: Revealing the complex interactions of tasks in the memory system. Germán Ceballos. In Proc. Companion 8th ACM International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, pp 1-3, ACM Press, New York, 2017.
20. Modeling the interactions between tasks and the memory system. Germán Ceballos. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2017-002, Uppsala University, 2017.
21. TaskInsight: Understanding task schedules effects on memory and performance. Germán Ceballos, Thomas Grass, Andra Hugo, and David Black-Schaffer. In Proc. 8th International Workshop on Programming Models and Applications for Multicores and Manycores, pp 11-20, ACM Press, New York, 2017.
22. Understanding the interplay between task scheduling, memory and performance. Germán Ceballos, Erik Hagersten, and David Black-Schaffer. In Proc. Companion 8th ACM International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, pp 21-23, ACM Press, New York, 2017.
23. A dedicated private-shared cache design for scalable multiprocessors. Juan M. Cebrián, Ricardo Fernández-Pascual, Alexandra Jimborean, Manuel E. Acacio, and Alberto Ros. In Concurrency and Computation, volume 29, number 2, 2017.
24. Orca: GC and Type System Co-design for Actor Languages. Sylvan Clebsch, Juliana Franco, Sophia Drossopoulou, Albert Mingkun Yang, Tobias Wrigstad, and Jan Vitek. In Proceedings of the ACM on Programming Languages, volume 1, number OOPSLA, pp 1-28, ACM, 2017.
25. Advances Towards Data-Race-Free Cache Coherence Through Data Classification. Mahdad Davari. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1521, Acta Universitatis Upsaliensis, Uppsala, 2017.
26. You can have it all: abstraction and good cache performance. Juliana Franco, Martin Hagelin, Tobias Wrigstad, Sophia Drossopoulou, and Susan Eisenbach. In Onward! 2017: Proceedings of the 2017 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, pp 148-167, Association for Computing Machinery (ACM), 2017.
27. Automatic detection of extended data-race-free regions. Alexandra Jimborean, Jonatan Waern, Per Ekemark, Stefanos Kaxiras, and Alberto Ros. In Proc. 15th International Symposium on Code Generation and Optimization, pp 14-26, IEEE Press, Piscataway, NJ, 2017.
28. Stateless model checking of the Linux kernel's hierarchical read-copy-update (tree RCU). Michalis Kokologiannakis and Konstantinos Sagonas. In Proc. 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, pp 172-181, ACM Press, New York, 2017.
29. Exposing inter-process information for efficient parallel discrete event simulation of spatial stochastic systems. Jonatan Lindén, Pavol Bauer, Stefan Engblom, and Bengt Jonsson. In Proc. 5th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, pp 53-64, ACM Press, New York, 2017.
30. Finite Element Computations on Multicore and Graphics Processors. Karl Ljungkvist. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1512, Acta Universitatis Upsaliensis, Uppsala, 2017.
31. Matrix-free finite-element computations on graphics processors with adaptively refined unstructured meshes. Karl Ljungkvist. In Proc. 25th High Performance Computing Symposium, pp 1-12, The Society for Modeling and Simulation International, San Diego, CA, 2017.
32. Multigrid for matrix-free finite element computations on graphics processors. Karl Ljungkvist and Martin Kronbichler. Technical report / Department of Information Technology, Uppsala University nr 2017-006, 2017.
33. An executable semantics for synchronous task graphs: From SDRT to Ada. Morteza Mohaqeqi, Jakaria Abdullah, and Wang Yi. In Reliable Software Technologies — Ada-Europe 2017, volume 10300 of Lecture Notes in Computer Science, pp 137-152, Springer, 2017.
34. Refinement of workload models for engine controllers by state space partitioning. Morteza Mohaqeqi, Jakaria Abdullah, Pontus Ekberg, and Wang Yi. In 29th Euromicro Conference on Real-Time Systems: ECRTS 2017, volume 76 of Leibniz International Proceedings in Informatics (LIPIcs), pp 11:1-22, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2017.
35. Verification of networks of communicating processes: Reachability problems and decidability issues. Othmane Rezine. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1605, Acta Universitatis Upsaliensis, Uppsala, 2017.
36. Non-speculative load-load reordering in TSO. Alberto Ros, Trevor E. Carlson, Mehdi Alipour, and Stefanos Kaxiras. In Proc. 44th International Symposium on Computer Architecture, pp 187-200, ACM Press, New York, 2017.
37. A split cache hierarchy for enabling data-oriented optimizations. Andreas Sembrant, Erik Hagersten, and David Black-Schaffer. In Proc. 23rd International Symposium on High Performance Computer Architecture, pp 133-144, IEEE Computer Society, 2017.
38. Clairvoyance: Look-ahead compile-time scheduling. Kim-Anh Tran, Trevor E. Carlson, Konstantinos Koukos, Magnus Själander, Vasileios Spiliopoulos, Stefanos Kaxiras, and Alexandra Jimborean. In Proc. 15th International Symposium on Code Generation and Optimization, pp 171-184, IEEE Press, Piscataway, NJ, 2017.
39. Scaling Reliably: Improving the scalability of the Erlang distributed actor platform. Phil Trinder, Natalia Chechina, Nikolaos Papaspyrou, Konstantinos Sagonas, Simon Thompson, Stephen Adams, Stavros Aronis, Robert Baker, Eva Bihari, Olivier Boudeville, Francesco Cesarini, Maurizio Di Stefano, Sverker Eriksson, Viktória Förd?s, Amir Ghaffari, Aggelos Giantsios, Rickard Green, Csaba Hoch, David Klaftenegger, Huiqing Li, Kenneth Lundin, Kenneth Mackenzie, Katerina Roukounaki, Yiannis Tsiouris, and Kjell Winblad. In ACM Transactions on Programming Languages and Systems, volume 39, number 4, 2017.
40. Decoupled Access-Execute on ARM big.LITTLE. Anton Weber, Kim-Anh Tran, Stefanos Kaxiras, and Alexandra Jimborean. In Proc. 5th Workshop on High Performance Energy Efficient Embedded Systems, 2017.
41. Type-assisted automatic garbage collection for lock-free data structures. Albert Mingkun Yang and Tobias Wrigstad. In SIGPLAN notices, volume 52, number 9, pp 14-24, ACM Press, New York, 2017.
42. An approximation framework for solvers and decision procedures. Aleksandar Zeljic, Christoph M. Wintersteiger, and Philipp Rümmer. In Journal of automated reasoning, volume 58, number 1, pp 127-147, 2017.

1. Fencing programs with self-invalidation and self-downgrade. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Stefanos Kaxiras, Carl Leonardsson, Alberto Ros, and Yunyun Zhu. In Formal Techniques for Distributed Objects, Components, and Systems, volume 9688 of Lecture Notes in Computer Science, pp 19-35, Springer, 2016.
2. Parameterized verification through view abstraction. Parosh Aziz Abdulla, Frédéric Haziza, and Lukás Holík. In International Journal on Software Tools for Technology Transfer, volume 18, number 5, pp 495-516, 2016.
3. Stateless model checking for POWER. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, and Carl Leonardsson. In Computer Aided Verification: Part II, volume 9780 of Lecture Notes in Computer Science, pp 134-156, Springer, 2016.
4. The benefits of duality in verifying concurrent programs under TSO. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, and Tuan Phong Ngo. In 27th International Conference on Concurrency Theory: CONCUR 2016, volume 59 of Leibniz International Proceedings in Informatics (LIPIcs), pp 5:1-15, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2016.
5. Verification of heap manipulating programs with ordered data by extended forest automata. Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, and Tomás Vojnar. In Acta Informatica, volume 53, number 4, pp 357-385, 2016.
6. Improving performance by monitoring while maintaining worst-case guarantees. Syed Md Jakaria Abdullah, Kai Lampka, and Wang Yi. In Proc. 19th Conference on Design, Automation and Test in Europe, pp 257-260, IEEE, Piscataway, NJ, 2016.
7. Acceleration in Multi-PushDown Systems. Mohamed Faouzi Atig, K. Narayan Kumar, and Prakash Saivasan. In Tools and Algorithms for the Construction and Analysis of Systems, volume 9636 of Lecture Notes in Computer Science, pp 698-714, Springer, 2016.
8. New techniques for handling quantifiers in Boolean and first-order logic. Peter Backeman. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2016-012, Uppsala University, 2016.
9. Fast event-based epidemiological simulations on national scales. Pavol Bauer, Stefan Engblom, and Stefan Widgren. In The international journal of high performance computing applications, volume 30, pp 438-453, 2016.
10. Mesoscopic modeling of stochastic reaction–diffusion kinetics in the subdiffusive regime. Emilie Blanc, Stefan Engblom, Andreas Hellander, and Per Lötstedt. In Multiscale Modeling & simulation, volume 14, pp 668-707, 2016.
11. A Sorted Semantic Framework for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, and Johannes Åman Pohjola. In Logical Methods in Computer Science, volume 12, number 1, pp 1-49, 2016.
12. Protocol, mobility and adversary models for the verification of security. Volkan Cambazoglu. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2016-007, Uppsala University, 2016.
13. Active learning for extended finite state machines. Sofia Cassel, Falk Howar, Bengt Jonsson, and Bernhard Steffen. In Formal Aspects of Computing, volume 28, number 2, pp 233-263, 2016.
14. Kappa: Insights, Current Status and Future Work. Elias Castegren and Tobias Wrigstad. In , 2016.
15. LOLCAT: Relaxed Linear References for Lock-free Programming. Elias Castegren and Tobias Wrigstad. Technical report / Department of Information Technology, Uppsala University nr 2016-013, 2016.
16. Reference Capabilities for Concurrency Control. Elias Castegren and Tobias Wrigstad. In ECOOP 2016 — Object-Oriented Programming, 2016.
17. Reference Capabilities for Trait Based Reuse and Concurrency Control. Elias Castegren and Tobias Wrigstad. Technical report / Department of Information Technology, Uppsala University nr 2016-007, 2016.
18. Types for CAS: Relaxed Linearity with Ownership Transfer. Elias Castegren and Tobias Wrigstad. In , 2016.
19. Characterizing Task Scheduling Performance Based on Data Reuse. Germán Ceballos, Thomas Grass, David Black-Schaffer, and Andra Hugo. In Proc. 9th Nordic Workshop on Multi-Core Computing, 2016.
20. Formalizing data locality in task parallel applications. Germán Ceballos, Erik Hagersten, and David Black-Schaffer. In Algorithms and Architectures for Parallel Processing, volume 10049 of Lecture Notes in Computer Science, pp 43-61, Springer, 2016.
21. Spatial and Temporal Cache Sharing Analysis in Tasks. Germán Ceballos and David Black-Schaffer. In , Timisoara, Romania, 2016.
22. Vats: A safe, reactive storage abstraction. Dave Clarke and Tobias Wrigstad. In Theory and Practice of Formal Methods: Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday, volume 9660 of Lecture Notes in Computer Science, pp 140-154, Springer, 2016.
23. Fast Matlab compatible sparse assembly on multicore computers. Stefan Engblom and Dimitar Lukarski. In Parallel Computing, volume 56, pp 1-17, 2016.
24. Preconditioned Metropolis sampling as a strategy to improve efficiency in posterior exploration. Stefan Engblom and Vikram Sunkara. In , volume 49:26 of IFAC-PapersOnLine, pp 89-94, 2016.
25. ParT: An asynchronous parallel abstraction for speculative pipeline computations. Kiko Fernandez-Reyes, Dave Clarke, and Daniel S. McCain. In Coordination Models and Languages, volume 9686 of Lecture Notes in Computer Science, pp 101-120, Springer, 2016.
26. Towards Enabling Low-Level Memory Optimisations at the High-Level with Ownership Annotations. Juliana Franco, Tobias Wrigstad, and Sophia Drossopoulou. In , 2016.
27. Transforming real-time task graphs to improve schedulability. Chuancai Gu, Nan Guan, Zhiwei Feng, Qingxu Deng, Xiaobo Sharon Hu, and Wang Yi. In Proc. 22nd International Conference on Embedded and Real-Time Computing Systems and Applications, pp 29-38, IEEE Computer Society, 2016.
28. Evaluation of the deflated preconditioned CG method to solve bubbly and porous media flow problems on GPU and CPU. Rohit Gupta, Dimitar Lukarski, Martin B. van Gijzen, and Cornelis Vuik. In International Journal for Numerical Methods in Fluids, volume 80, pp 666-683, 2016.
29. Languages, Logics, Types and Tools for Concurrent System Modelling. Ram?nas Gutkovas. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1392, Acta Universitatis Upsaliensis, Uppsala, 2016.
30. Partitioning GPUs for Improved Scalability. Johan Janzén, David Black-Schaffer, and Andra Hugo. In Proc. 28th International Symposium on Computer Architecture and High Performance Computing, International Symposium on Computer Architecture and High Performance Computing, pp 42-49, IEEE Computer Society, 2016.
31. Optimizing Performance in Highly Utilized Multicores with Intelligent Prefetching. Muneeb Khan. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1335, Acta Universitatis Upsaliensis, Uppsala, 2016.
32. Building Heterogeneous Unified Virtual Memories (UVMs) without the Overhead. Konstantinos Koukos, Alberto Ros, Erik Hagersten, and Stefanos Kaxiras. In ACM Transactions on Architecture and Code Optimization (TACO), volume 13, number 1, 2016.
33. Efficient Execution Paradigms for Parallel Heterogeneous Architectures. Konstantinos Koukos. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1405, Acta Universitatis Upsaliensis, Uppsala, 2016.
34. Multiversioned decoupled access-execute: The key to energy-efficient compilation of general-purpose programs. Konstantinos Koukos, Per Ekemark, Georgios Zacharopoulos, Vasileios Spiliopoulos, Stefanos Kaxiras, and Alexandra Jimborean. In Proc. 25th International Conference on Compiler Construction, pp 121-131, ACM Press, New York, 2016.
35. Verification of Software under Relaxed Memory. Carl Leonardsson. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1387, Acta Universitatis Upsaliensis, Uppsala, 2016.
36. Guiding Craig interpolation with domain-specific abstractions. Jérôme Leroux, Philipp Rümmer, and Pavle Subotic. In Acta Informatica, volume 53, number 4, pp 387-424, 2016.
37. Liveness of randomised parameterised systems under arbitrary schedulers. Anthony W. Lin and Philipp Rümmer. In Computer Aided Verification: Part II, volume 9780 of Lecture Notes in Computer Science, pp 112-133, Springer, 2016.
38. Regular Symmetry Patterns. Anthony W. Lin, Truong Khanh Nguyen, Philipp Rümmer, and Jun Sun. In Verification, Model Checking, and Abstract Interpretation, volume 9583 of Lecture Notes in Computer Science, pp 455-475, Springer Berlin/Heidelberg, 2016.
39. A survey on static cache analysis for real-time systems. Mingsong Lv, Nan Guan, Jan Reineke, Reinhard Wilhelm, and Wang Yi. In Leibniz Transactions on Embedded Systems, volume 3, number 1, pp 05:1-48, 2016.
40. Analysis and design of jump coefficients in discrete stochastic diffusion models. Lina Meinecke, Stefan Engblom, Andreas Hellander, and Per Lötstedt. In SIAM Journal on Scientific Computing, volume 38, pp A55-A83, 2016.
41. Modeling and analysis of data flow graphs using the digraph real-time task model. Morteza Mohaqeqi, Jakaria Abdullah, and Wang Yi. In Reliable Software Technologies — Ada-Europe 2016, volume 9695 of Lecture Notes in Computer Science, pp 15-29, Springer, 2016.
42. Schedulability analysis of synchronous digraph real-time tasks. Morteza Mohaqeqi, Jakaria Abdullah, Nan Guan, and Wang Yi. In Proc. 28th Euromicro Conference on Real-Time Systems, pp 176-186, IEEE Computer Society, 2016.
43. Feature Nets: Behavioural modelling of software product lines. Radu Muschevici, José Proença, and Dave Clarke. In Software and Systems Modeling, volume 15, number 4, pp 1181-1206, 2016.
44. Performance Modeling of Multi-core Systems: Caches and Locks. Xiaoyue Pan. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1336, Acta Universitatis Upsaliensis, Uppsala, 2016.
45. A hybrid static–dynamic classification for dual-consistency cache coherence. Alberto Ros and Alexandra Jimborean. In IEEE Transactions on Parallel and Distributed Systems, volume 27, number 11, pp 3101-3115, 2016.
46. Characterization of simulation by probabilistic testing. Philipp Rümmer and Wang Yi. In Theory and Practice of Formal Methods, volume 9660 of Lecture Notes in Computer Science, pp 360-372, Springer, 2016.
47. Splash-3: A properly synchronized benchmark suite for contemporary research. Christos Sakalis, Carl Leonardsson, Stefanos Kaxiras, and Alberto Ros. In Proc. International Symposium on Performance Analysis of Systems and Software: ISPASS 2016, pp 101-111, IEEE Computer Society, 2016.
48. Redesigning a tagless access buffer to require minimal ISA changes. Carlos Sanchez, Peter Gavin, Daniel Moreau, Magnus Själander, David Whalley, Per Larsson-Edefors, and Sally A. McKee. In Proc. 19th International Conference on Compilers, Architectures and Synthesis for Embedded Systems, 2016.
49. Data placement across the cache hierarchy: Minimizing data movement with reuse-aware placement. Andreas Sembrant, Erik Hagersten, and David Black-Schaffer. In Proc. 34th International Conference on Computer Design, Proceedings IEEE International Conference on Computer Design, pp 117-124, IEEE, Piscataway, NJ, 2016.
50. Hiding and Reducing Memory Latency: Energy-Efficient Pipeline and Memory System Techniques. Andreas Sembrant. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1450, Acta Universitatis Upsaliensis, Uppsala, 2016.
51. Improving Energy-Efficiency of Multicores using First-Order Modeling. Vasileios Spiliopoulos. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1404, Acta Universitatis Upsaliensis, Uppsala, 2016.
52. Software Out-of-Order Execution for In-Order Architectures. Kim-Anh Tran. In Proc. 25th International Conference on Parallel Architectures and Compilation Techniques, pp 458-458, ACM Press, New York, 2016.
53. Profiling-Assisted Decoupled Access-Execute. Jonatan Waern, Per Ekemark, Konstantinos Koukos, Stefanos Kaxiras, and Alexandra Jimborean. In Proc. 4th International Workshop on High Performance Energy Efficient Embedded Systems, 2016.
54. Modal Logics for Nominal Transition Systems. Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes Borgström, and Ram?nas Gutkovas. In Archive of Formal Proofs, 2016.
55. Data-driven network modelling of disease transmission using complete population movement data: spread of VTEC O157 in Swedish cattle. Stefan Widgren, Stefan Engblom, Pavol Bauer, Jenny Frössling, Ulf Emanuelson, and Ann Lindberg. In Veterinary research (Print), volume 47, pp 81:1-17, 2016.
56. DuctTeip: A task-based parallel programming framework for distributed memory architectures. Afshin Zafari, Elisabeth Larsson, and Martin Tillenius. Technical report / Department of Information Technology, Uppsala University nr 2016-010, 2016.
57. Approximations and abstractions for reasoning about machine arithmetic. Aleksandar Zeljic. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2016-010, Uppsala University, 2016.
58. Deciding bit-vector formulas with mcSAT. Aleksandar Zeljic, Christoph M. Wintersteiger, and Philipp Rümmer. In Theory and Applications of Satisfiability Testing: SAT 2016, volume 9710 of Lecture Notes in Computer Science, pp 249-266, Springer, 2016.
59. Culling Concurrency Theory: Reusable and trustworthy meta-theory, proof techniques and separation results. Johannes Åman Pohjola. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1397, Acta Universitatis Upsaliensis, Uppsala, 2016.
60. Language Constructs for Safe Parallel Programming on Multi-Cores. Johan Östlund. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1319, Acta Universitatis Upsaliensis, Uppsala, 2016.

1. Generating models of infinite-state communication protocols using regular inference with abstraction. Fides Aarts, Bengt Jonsson, Johan Uijen, and Frits Vaandrager. In Formal methods in system design, volume 46, number 1, pp 1-41, 2015.
2. MPass: An efficient tool for the analysis of message-passing programs. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg, Subham Modi, Othmane Rezine, and Gaurav Saini. In Formal Aspects of Component Software, volume 8997 of Lecture Notes in Computer Science, pp 198-206, Springer, 2015.
3. Norn: An SMT solver for string constraints. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukás Holík, Ahmed Rezine, Philipp Rümmer, and Jari Stenman. In Computer Aided Verification: Part I, volume 9206 of Lecture Notes in Computer Science, pp 462-469, Springer, 2015.
4. Precise and sound automatic fence insertion procedure under PSO. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Magnus Lång, and Tuan Phong Ngo. In Networked Systems: NETYS 2015, volume 9466 of Lecture Notes in Computer Science, pp 32-47, Springer, 2015.
5. Stateless model checking for TSO and PSO. Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, and Konstantinos Sagonas. In Tools and Algorithms for the Construction and Analysis of Systems: TACAS 2015, volume 9035 of Lecture Notes in Computer Science, pp 353-367, Springer Berlin/Heidelberg, 2015.
6. The Best of Both Worlds: Trading efficiency and optimality in fence insertion for TSO. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Tuan-Phong Ngo. In Programming Languages and Systems: ESOP 2015, volume 9032 of Lecture Notes in Computer Science, pp 308-332, Springer Berlin/Heidelberg, 2015.
7. Verification of Cache Coherence Protocols wrt. Trace Filters. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Zeinab Ganjei, Ahmed Rezine, and Yunyun Zhu. In Proc. 15th Conference on Formal Methods in Computer-Aided Design, pp 9-16, IEEE, Piscataway, NJ, 2015.
8. Verification of buffered dynamic register automata. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, and Othmane Rezine. In Networked Systems: NETYS 2015, volume 9466 of Lecture Notes in Computer Science, pp 15-31, Springer, 2015.
9. Self-adaptive multiprecision preconditioners on multicore and manycore architectures. Hartwig Anzt, Dimitar Lukarski, Stanimire Tomov, and Jack Dongarra. In High Performance Computing for Computational Science – VECPAR 2014, volume 8969 of Lecture Notes in Computer Science, pp 115-123, Springer, 2015.
10. Efficient inter-process synchronization for parallel discrete event simulation on multicores. Pavol Bauer, Jonatan Lindén, Stefan Engblom, and Bengt Jonsson. In Proc. 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, pp 183-194, ACM Press, New York, 2015.
11. Parallelism and efficiency in discrete-event simulation. Pavol Bauer. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2015-004, Uppsala University, 2015.
12. Sensitivity estimation and inverse problems in spatial stochastic models of chemical kinetics. Pavol Bauer and Stefan Engblom. In Numerical Mathematics and Advanced Applications: ENUMATH 2013, volume 103 of Lecture Notes in Computational Science and Engineering, pp 519-527, Springer, 2015.
13. 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 and Systems Modeling, volume 14, number 1, pp 201-216, Springer, 2015.
14. The Psi-Calculi Workbench: A Generic Tool for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, and Björn Victor. In ACM Transactions on Embedded Computing Systems, volume 14, number 1, 2015.
15. Learning Component Behavior from Tests: Theory and Algorithms for Automata with Data. Sofia Cassel. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1311, Acta Universitatis Upsaliensis, Uppsala, 2015.
16. Refined Ownership: Fine-grained controlled internal sharing. Elias Castegren, Johan Östlund, and Tobias Wrigstad. In Formal Methods for Multicore Programming, volume 9104 of Lecture Notes in Computer Science, pp 179-210, 2015.
17. Abstract Delta Modelling. Dave Clarke, Michiel Helvensteijn, and Ina Schaefer. In Mathematical Structures in Computer Science, volume 25, number 3, pp 482-527, Cambridge University Press, 2015.
18. Refraction: Low-cost management of reflective meta-data in pervasive component-based applications. Wilfried Daniels, José Proença, Dave Clarke, Wouter Joosen, and Danny Hughes. In Proc. 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering, pp 27-36, ACM Press, New York, 2015.
19. An optimal resource sharing protocol for generalized multiframe tasks. Pontus Ekberg, Nan Guan, Martin Stigge, and Wang Yi. In The Journal of logical and algebraic methods in programming, volume 84, number 1, pp 92-105, 2015.
20. Models and Complexity Results in Real-Time Scheduling Theory. Pontus Ekberg. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1324, Acta Universitatis Upsaliensis, Uppsala, 2015.
21. Uniprocessor feasibility of sporadic tasks remains coNP-complete under bounded utilization. Pontus Ekberg and Wang Yi. In Proc. 36th Real-Time Systems Symposium, pp 87-95, IEEE Computer Society, 2015.
22. Uniprocessor feasibility of sporadic tasks with constrained deadlines is strongly coNP-complete. Pontus Ekberg and Wang Yi. In Proc. 27th Euromicro Conference on Real-Time Systems, pp 281-286, IEEE, Piscataway, NJ, 2015.
23. Machine learning for ultrafast X-ray diffraction patterns on large-scale GPU clusters. Tomas Ekeberg, Stefan Engblom, and Jing Liu. In The international journal of high performance computing applications, volume 29, pp 233-243, 2015.
24. Strong convergence for split-step methods in stochastic jump kinetics. Stefan Engblom. In SIAM Journal on Numerical Analysis, volume 53, pp 2655-2676, 2015.
25. Scalable timing analysis with refinement. Nan Guan, Yue Tang, Jakaria Abdullah, Martin Stigge, and Wang Yi. In Tools and Algorithms for the Construction and Analysis of Systems, volume 9035 of Lecture Notes in Computer Science, pp 3-18, Springer, 2015.
26. Few is Just Enough!: Small Model Theorem for Parameterized Verification and Shape Analysis. Frédéric Haziza. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1302, Acta Universitatis Upsaliensis, Uppsala, 2015.
27. A secure compiler for ML modules. Adriaan Larmuseau, Marco Patrignani, and Dave Clarke. In Programming Languages and Systems: APLAS 2015, volume 9458 of Lecture Notes in Computer Science, pp 29-48, Springer, 2015.
28. Techniques for finite element methods on modern processors. Karl Ljungkvist. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2015-001, Uppsala University, 2015.
29. Stochastic focusing coupled with negative feedback enables robust regulation in biochemical reaction networks. Andreas Milias-Argeitis, Stefan Engblom, Pavol Bauer, and Mustafa Khammash. In Journal of the Royal Society Interface, volume 12, number 113, pp 20150831:1-10, 2015.
30. A Modeling Framework for Reuse Distance-based Estimation of Cache Performance. Xiaoyue Pan and Bengt Jonsson. In Performance Analysis of Systems and Software (ISPASS), 2015 IEEE International Symposium on, pp 62-71, IEEE, 2015.
31. Modal Logics for Nominal Transition Systems. Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, and Tjark Weber. In 26th International Conference on Concurrency Theory: CONCUR 2015, volume 42 of Leibniz International Proceedings in Informatics (LIPIcs), pp 198-211, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015.
32. Secure compilation to protected module architectures. Marco Patrignani, Pieter Agten, Raoul Strackx, Bart Jacobs, Dave Clarke, and Frank Piessens. In ACM Transactions on Programming Languages and Systems, volume 37, number 2, 2015.
33. Cost-effective speculative scheduling in high performance processors. Arthur Perais, André Seznec, Pierre Michaud, Andreas Sembrant, and Erik Hagersten. In Proc. 42nd International Symposium on Computer Architecture, pp 247-259, ACM Press, New York, 2015.
34. A dual-consistency cache coherence protocol. Alberto Ros and Alexandra Jimborean. In Proc. 29th International Parallel and Distributed Processing Symposium, pp 1119-1128, IEEE Computer Society, Los Alamitos, CA, 2015.
35. On recursion-free Horn clauses and Craig interpolation. Philipp Rümmer, Hossein Hojjat, and Viktor Kuncak. In Formal methods in system design, volume 47, number 1, pp 1-25, 2015.
36. Contention adapting search trees. Konstantinos Sagonas and Kjell Winblad. In Proc. 14th International Symposium on Parallel and Distributed Computing, pp 215-224, IEEE conference proceedings, 2015.
37. Full speed ahead: Detailed architectural simulation at near-native speed. Andreas Sandberg, Nikos Nikoleris, Trevor E. Carlson, Erik Hagersten, Stefanos Kaxiras, and David Black-Schaffer. In Proc. 18th International Symposium on Workload Characterization, pp 183-192, IEEE Computer Society, 2015.
38. Long Term Parking (LTP): Criticality-aware Resource Allocation in OOO Processors. Andreas Sembrant, Trevor E. Carlson, Erik Hagersten, David Black-Schaffer, Arthur Perais, André Seznec, and Pierre Michaud. In Proc. 48th International Symposium on Microarchitecture, pp 334-346, 2015.
39. A scalable RBF–FD method for atmospheric flow. Martin Tillenius, Elisabeth Larsson, Erik Lehto, and Natasha Flyer. In Journal of Computational Physics, volume 298, pp 406-422, 2015.
40. Resource-aware task scheduling. Martin Tillenius, Elisabeth Larsson, Rosa M. Badia, and Xavier Martorell. In ACM Transactions on Embedded Computing Systems, volume 14, number 1, pp 5:1-25, 2015.
41. SuperGlue: A shared memory framework using data versioning for dependency-aware task-based parallelization. Martin Tillenius. In SIAM Journal on Scientific Computing, volume 37, pp C617-C642, 2015.
42. Accelerating COBAYA3 on multi-core CPU and GPU systems using PARALUTION. Nico Trost, Javier Jiménez, Dimitar Lukarski, and Victor Sanchez. In Annals of Nuclear Energy, volume 82, pp 252-259, 2015.
43. Editorial preface for the JLAMP Special Issue on Formal Methods for Software Product Line Engineering. Maurice ter Beek, Dave Clarke, and Ina Schafer. In The Journal of logical and algebraic methods in programming, volume 85, number 1, pp 123-124, 2015.
44. Measuring Polymorphism in Python Programs. Beatrice Åkerblom and Tobias Wrigstad. In DLS 2015: Proceedings of the 11th Symposium on Dynamic Languages, volume 51:2 2016 of ACM SIGPLAN Notices, pp 114-128, ACM Press, New York, 2015.

1. Optimal dynamic partial order reduction. Parosh Abdulla, Stavros Aronis, Bengt Jonsson, and Konstantinos Sagonas. In Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volume 49:1 of ACM SIGPLAN NOTICES, pp 373-384, ACM Press, New York, 2014.
2. Block me if you can!: Context-sensitive parameterized verification. Parosh Aziz Abdulla, Frédéric Haziza, and Lukás Holík. In Static Analysis: SAS 2014, volume 8723 of Lecture Notes in Computer Science, pp 1-17, Springer, 2014.
3. Budget-bounded model-checking pushdown systems. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Othmane Rezine, and Jari Stenman. In Formal methods in system design, volume 45, number 2, pp 273-301, 2014.
4. Computing optimal reachability costs in priced dense-timed pushdown automata. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman. In Language and Automata Theory and Applications: LATA 2014, volume 8370 of Lecture Notes in Computer Science, pp 62-75, Springer Berlin/Heidelberg, 2014.
5. Infinite-state energy games. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Piotr Hofman, Richard Mayr, K. Narayan Kumar, and Patrick Totzke. In Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, ACM Press, New York, 2014.
6. String Constraints for Verification. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukas Holik, Ahmed Rezine, and Philipp Rümmer. In Computer Aided Verification - 26th International Conference, {CAV} 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 18-22, 2014. Proceedings, pp 150-166, Springer, 2014.
7. Verification of Dynamic Register Automata. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, and Othmane Rezine. In Leibniz International Proceedings in Informatics: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014), 2014.
8. Zenoness for Timed Pushdown Automata. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman. In Proceedings 15th International Workshop on Verification of Infinite-State Systems, {INFINITY} 2013, Hanoi, Vietnam, 14th October 2013., pp -47, 2014.
9. The Gradual Verifier. Stephan Arlt, Cindy Rubio-Gonzalez, Philipp Rümmer, Martin Schäf, and Natarajan Shankar. In NASA Formal Methods: 6th International Symposium, NFM 2014, Houston, TX, USA, April 29 – May 1, 2014. Proceedings, volume 8430 of Lecture Notes in Computer Science, pp 313-327, Switzerland, 2014.
10. Context-Bounded Analysis of TSO Systems. Mohamed Faouzi Atig, Ahmed Bouajjani, and Gennaro Parlato. In From Programs to Systems: The Systems perspective in Computing, volume 8415 of Lecture Notes in Computer Science, pp 21-38, Springer, 2014.
11. On Bounded Reachability Analysis of Shared Memory Systems. Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan. In {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014, New Delhi, India, 2014.
12. Building timing predictable embedded systems. Philip Axer, Rolf Ernst, Heiko Falk, Alain Girault, Daniel Grund, Nan Guan, Bengt Jonsson, Peter Marwedel, Jan Reineke, Christine Rochange, Maurice Sebastian, Reinhard von Hanxleden, Reinhard Wilhelm, and Wang Yi. In ACM Transactions on Embedded Computing Systems, volume 13, number 4, pp 82:1-37, 2014.
13. A Sorted Semantic Framework for Applied Process Calculi (extended abstract). Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, and Johannes Åman Pohjola. In Trustworthy Global Computing: TGC 2013, volume 8358 of Lecture Notes in Computer Science, pp 103-118, Springer Berlin/Heidelberg, 2014.
14. Learning Extended Finite State Machines. Sofia Cassel, Falk Howar, Bengt Jonsson, and Bernhard Steffen. In Software Engineering and Formal Methods.  12th International Conference, SEFM 2014, volume 8702 of Lecture Notes in Computer Science, pp 250-264, Springer International Publishing, 2014.
15. Compositional assume–guarantee reasoning for input/output component theories. Chris Chilton, Bengt Jonsson, and Marta Kwiatkowska. In Science of Computer Programming, volume 91, pp 115-137, 2014.
16. Software-controlled processor stalls for time and energy efficient data locality optimization. Philippe Clauss, Imen Fassi, and Alexandra Jimborean. In Proc. International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XIV), pp 199-206, IEEE, Piscataway, NJ, 2014.
17. CPU and GPU performance of large scale numerical simulations in Geophysics. Ali Dorostkar, Dimitar Lukarski, Björn Lund, Maya Neytcheva, Yvan Notay, and Peter Schmidt. In Euro-Par 2014: Parallel Processing Workshops, Part I, volume 8805 of Lecture Notes in Computer Science, pp 12-23, Springer, 2014.
18. Parallel performance study of block-preconditioned iterative methods on multicore computer systems. Ali Dorostkar, Dimitar Lukarski, Björn Lund, Maya Neytcheva, Yvan Notay, and Peter Schmidt. Technical report / Department of Information Technology, Uppsala University nr 2014-007, 2014.
19. Bounding and shaping the demand of generalized mixed-criticality sporadic task systems. Pontus Ekberg and Wang Yi. In Real-time systems, volume 50, number 1, pp 48-86, 2014.
20. A software based profiling method for obtaining speedup stacks on commodity multi-cores. David Eklöv, Nikos Nikoleris, and Erik Hagersten. In 2014 IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE (ISPASS): ISPASS 2014, IEEE International Symposium on Performance Analysis of Systems and Software-ISPASS, pp 148-157, IEEE Computer Society, 2014.
21. Approximations for the moments of nonstationary and state dependent birth–death queues. Stefan Engblom and Jamol Pender. In Computing Research Repository, number 1406.6164, 2014.
22. On the stability of stochastic jump kinetics. Stefan Engblom. In Applied Mathematics, volume 5, pp 3217-3239, 2014.
23. X-ray laser imaging of biomolecules using multiple GPUs. Stefan Engblom and Jing Liu. In Parallel Processing and Applied Mathematics: Part I, volume 8384 of Lecture Notes in Computer Science, pp 480-489, Springer-Verlag, Berlin, 2014.
24. Automating regression verification. Dennis Felsing, Sarah Grebing, Vladimir Klebanov, Philipp Rümmer, and Mattias Ulbrich. In ASE '14 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering, pp 349-360, ACM Press, New York, 2014.
25. Adaptive Solvers for High-Dimensional PDE Problems on Clusters of Multicore Processors. Magnus Grandin. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1199, Acta Universitatis Upsaliensis, Uppsala, 2014.
26. Parallel data structures and algorithms for high-dimensional structured adaptive mesh refinement. Magnus Grandin and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2014-020, 2014.
27. Partitioned mixed-criticality scheduling on multiprocessor platforms. Chuancai Gu, Nan Guan, Qingxu Deng, and Wang Yi. In Proc. 17th Conference on Design, Automation and Test in Europe, IEEE, Piscataway, NJ, 2014.
28. General and Efficient Response Time Analysis for EDF Scheduling. Nan Guan and Wang Yi. In Proc. 17th Conference on Design, Automation and Test in Europe, IEEE, Piscataway, NJ, 2014.
29. Advancing concurrent system verification: Type based approach and tools. Ramunas Gutkovas. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2014-007, Uppsala University, 2014.
30. Horn Clauses for Communicating Timed Systems. Hossein Hojjat, Philipp Rümmer, Pavle Subotic, and Yi Wang. In Proceedings First Workshop on Horn Clauses for Verification and Synthesis, volume 169 of Electronic Proceedings in Theoretical Computer Science, pp 39-52, 2014.
31. Dynamic autotuning of adaptive fast multipole methods on hybrid multicore CPU and GPU systems. Marcus Holm, Stefan Engblom, Anders Goude, and Sverker Holmgren. In SIAM Journal on Scientific Computing, volume 36, pp C376-C399, 2014.
32. Dynamic and speculative polyhedral parallelization using compiler-generated skeletons. Alexandra Jimborean, Philippe Clauss, Jean-François Dollinger, Vincent Loechner, and Juan Manuel Martinez Caamaño. In International journal of parallel programming, volume 42, number 4, pp 529-545, 2014.
33. Fix the code. Don't tweak the hardware: A new compiler approach to Voltage–Frequency scaling. Alexandra Jimborean, Konstantinos Koukos, Vasileios Spiliopoulos, David Black-Schaffer, and Stefanos Kaxiras. In Proc. 12th International Symposium on Code Generation and Optimization, pp 262-272, ACM Press, New York, 2014.
34. A case for resource efficient prefetching in multicores. Muneeb Khan, Andreas Sandberg, and Erik Hagersten. In Proc. International Symposium on Performance Analysis of Systems and Software: ISPASS 2014, pp 137-138, IEEE Computer Society, 2014.
35. Resource conscious prefetching for irregular applications in multicores. Muneeb Khan and Erik Hagersten. In Proc. International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS XIV), pp 34-43, IEEE, Piscataway, NJ, 2014.
36. Brief announcement: queue delegation locking. David Klaftenegger, Konstantinos Sagonas, and Kjell Winblad. In Proc. 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp 70-72, ACM Press, New York, 2014.
37. Delegation locking libraries for improved performance of multithreaded programs. David Klaftenegger, Konstantinos Sagonas, and Kjell Winblad. In Euro-Par 2014: Parallel Processing, volume 8632 of Lecture Notes in Computer Science, pp 572-583, Springer Berlin/Heidelberg, 2014.
38. Matrix-free finite-element operator application on graphics processing units. Karl Ljungkvist. In Euro-Par 2014: Parallel Processing Workshops, Part II, volume 8806 of Lecture Notes in Computer Science, pp 450-461, Springer, 2014.
39. On the impact of the heterogeneous multicore and many-core platforms on iterative solution methods and preconditioning techniques. Dimitar Lukarski and Maya Neytcheva. In High-Performance Computing on Complex Environments, pp 13-32, Wiley-Blackwell, Hoboken, NJ, 2014.
40. Extending statistical cache models to support detailed pipeline simulators. Nikos Nikoleris, David Eklöv, and Erik Hagersten. In 2014 IEEE International Symposium On Performance Analysis Of Systems And Software (Ispass), IEEE International Symposium on Performance Analysis of Systems and Software-ISPASS, pp 86-95, IEEE Computer Society, 2014.
41. Modeling cache coherence misses on multicores. Xiaoyue Pan and Bengt Jonsson. In 2014 IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE (ISPASS), IEEE International Symposium on Performance Analysis of Systems and Software-ISPASS, pp 96-105, IEEE, 2014.
42. Higher-order psi-calculi. Joachim Parrow, Johannes Borgström, Palle Raabjerg, and Johannes Åman Pohjola. In Mathematical Structures in Computer Science, volume 24, number 2, Cambridge University Press, 2014.
43. Fully abstract trace semantics for low-level isolation mechanisms. Marco Patrignani and Dave Clarke. In Symposium on Applied Computing, SAC 2014., pp 1562-1569, ACM Press, 2014.
44. More scalable ordered set for ETS using adaptation. Konstantinos Sagonas and Kjell Winblad. In Proc. 13th ACM SIGPLAN Workshop on Erlang, pp 3-11, ACM Press, New York, 2014.
45. Full Speed Ahead: Detailed Architectural Simulation at Near-Native Speed. Andreas Sandberg, Erik Hagersten, and David Black-Schaffer. Technical report / Department of Information Technology, Uppsala University nr 2014-005, 2014.
46. Understanding Multicore Performance: Efficient Memory System Modeling and Simulation. Andreas Sandberg. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1136, Acta Universitatis Upsaliensis, Uppsala, 2014.
47. CPS2: a Contextual Privacy Framework for Social Software. Rula Sayaf, Dave Clarke, and Richard Harper. In 10th International Conference on Security and Privacy in Communication Networks (SECURECOMM2014), Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering, pp 25-32, 2014.
48. The Direct-to-Data (D2D) Cache: Navigating the cache hierarchy with a single lookup. Andreas Sembrant, Erik Hagersten, and David Black-Schaffer. In Proc. 41st International Symposium on Computer Architecture, pp 133-144, IEEE Press, Piscataway, NJ, 2014.
49. Real-Time Workload Models: Expressiveness vs. Analysis Efficiency. Martin Stigge. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 103, Acta Universitatis Upsaliensis, Uppsala, 2014.
50. Speculative program parallelization with scalable and decentralized runtime verification. Aravind Sukumaran-Rajam, Juan Manuel Martinez Caamaño, Willy Wolff, Alexandra Jimborean, and Philippe Clauss. In Runtime Verification, volume 8734 of Lecture Notes in Computer Science, pp 124-139, Springer Berlin/Heidelberg, 2014.
51. A task parallel implementation of an RBF-generated finite difference method for the shallow water equations on the sphere. Martin Tillenius, Elisabeth Larsson, Erik Lehto, and Natasha Flyer. Technical report / Department of Information Technology, Uppsala University nr 2014-011, 2014.
52. Scientific Computing on Multicore Architectures. Martin Tillenius. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1139, Acta Universitatis Upsaliensis, Uppsala, 2014.
53. SuperGlue: A shared memory framework using data versioning for dependency-aware task-based parallelization. Martin Tillenius. Technical report / Department of Information Technology, Uppsala University nr 2014-010, 2014.
54. Approximations for Model Construction. Aleksandar Zeljic, Christoph M. Wintersteiger, and Philipp Rümmer. In Automated Reasoning, volume 8562 of Lecture Notes in Computer Science, pp 344-359, Springer, 2014.
55. Scaling Future Software: The Manycore Challenge. Frank de Boer, Einar Broch Johnsen, Dave Clarke, Sophia Drossopoulou, Nobuko Yoshida, and Tobias Wrigstad. 2014.

1. All for the price of few: (Parameterized verification through view abstraction). Parosh Aziz Abdulla, Frédéric Haziza, and Lukáš Holík. In Verification, Model Checking, and Abstract Interpretation, volume 7737 of Lecture Notes in Computer Science, pp 476-495, Springer Berlin/Heidelberg, 2013.
2. 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.
3. Analysis of message passing programs using SMT-solvers. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jonathan Cederberg. In Automated Technology for Verification and Analysis: ATVA 2013, volume 8172 of Lecture Notes in Computer Science, pp 272-286, Springer Berlin/Heidelberg, 2013.
4. MEMORAX, a Precise and Sound Tool for Automatic 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 7795 of Lecture Notes in Computer Science, pp 530-536, Springer Berlin/Heidelberg, 2013.
5. 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.
6. Priced timed Petri nets. Parosh Aziz Abdulla and Richard Mayr. In Logical Methods in Computer Science, volume 9, number 4, pp 10:1-51, 2013.
7. Push-down automata with gap-order constraints. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, and Andreas Podelski. In Fundamentals of Software Engineering: FSEN 2013, volume 8161 of Lecture Notes in Computer Science, pp 199-216, Springer Berlin/Heidelberg, 2013.
8. Solving parity games on integer vectors. Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, and Jeremy Sproston. In CONCUR 2013 – Concurrency Theory, volume 8052 of Lecture Notes in Computer Science, pp 106-120, Springer Berlin/Heidelberg, 2013.
9. Tools for software verification: Introduction to the special section from the seventeenth international conference on tools and algorithms for the construction and analysis of systems. Parosh Aziz Abdulla and K. Rustan M. Leino. In International Journal on Software Tools for Technology Transfer, volume 15, number 2, pp 85-88, 2013.
10. Veri?cation of heap manipulating programs with ordered data by extended forest automata. Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, and Tomás Vojnar. In Automated Technology for Verification and Analysis: ATVA 2013, volume 8172 of Lecture Notes in Computer Science, pp 224-239, Springer Berlin/Heidelberg, 2013.
11. Verifying safety and liveness for the FlexTM hybrid transactional memory. Parosh Aziz Abdulla, Sandhya Dwarkadas, Ahmed Rezine, Arrvindh Shriraman, and Zhu Yunyun. In , pp 785-790, Grenoble, France, 2013.
12. A theory for control-flow graph exploration. Stephan Arlt, Philipp Rümmer, and Martin Schäf. In Automated Technology for Verification and Analysis: ATVA 2013, volume 8172 of Lecture Notes in Computer Science, pp 506-515, Springer Berlin/Heidelberg, 2013.
13. On using Erlang for parallelization: Experience from parallelizing Dialyzer. Stavros Aronis and Konstantinos Sagonas. In Trends in Functional Programming, volume 7829 of Lecture Notes in Computer Science, pp 295-310, Springer Berlin/Heidelberg, 2013.
14. Adjacent ordered multi-pushdown systems. Mohamed Faouzi Atig, K. Narayan Kumar, and Prakash Saivasan. In Developments in Language Theory: DLT 2013, volume 7907 of Lecture Notes in Computer Science, pp 58-69, Springer Berlin/Heidelberg, 2013.
15. Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning. Amel Benaceur, Chris Chilton, Malte Isberner, and Bengt Jonsson. In SEFM 2013, 11th Int. Conf. on Software Engineering and Formal Methods, volume 8137 of Lecture Notes in Computer Science, pp 274-288, Springer, 2013.
16. A Parametric Tool for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, and Björn Victor. In 13th International Conference on Application of Concurrency to System Design (ACSD 2013), International Conference on Application of Concurrency to System Design, pp 180-185, IEEE Computer Society, 2013.
17. RELEASE: A high-level paradigm for reliable large-scale server software. Olivier Boudeville, Francesco Cesarini, Natalia Chechina, Kenneth Lundin, Nikolaos Papaspyrou, Konstantinos Sagonas, Simon Thompson, Phil Trinder, and Ulf Wiger. In Trends in Functional Programming, volume 7829 of Lecture Notes in Computer Science, pp 263-278, Springer Berlin/Heidelberg, 2013.
18. Shared Resource Sensitivity in Task-Based Runtime Systems. Germán Ceballos and David Black-Schaffer. In Proc. 6th Swedish Workshop on Multi-Core Computing, Halmstad University Press, 2013.
19. An Algebraic Theory of Interface Automata. Chris Chilton, Bengt Jonsson, and Marta Kwiatkowska. University of Oxford, 2013.
20. Systematic testing for detecting concurrency errors in Erlang programs. Maria Christakis, Alkis Gotovos, and Konstantinos Sagonas. In Proc. 6th International Conference on Software Testing, Verification and Validation, pp 154-163, IEEE Computer Society, 2013.
21. Bayesian Inference Using Data Flow Analysis. Guillaume Claret, Sriram Rajamani, Aditya Nori, Andrew D. Gordon, and Johannes Borgström. In ESEC/FSE '13: Proceedings of the 9th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp 92-102, ACM Press, New York, NY, USA, 2013.
22. 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.
23. Bandwidth Bandit: Quantitative Characterization of Memory Contention. David Eklöv, Nikos Nikoleris, David Black-Schaffer, and Erik Hagersten. In Proc. 11th International Symposium on Code Generation and Optimization: CGO 2013, pp 99-108, IEEE Computer Society, 2013.
24. A Model-Learner Pattern for Bayesian Reasoning. Andrew D. Gordon, Mihhail Aizatulin, Johannes Borgström, Guillaume Claret, Thore Graepel, Aditya Nori, Sriram Rajamani, and Claudio Russo. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, volume 48 of ACM SIGPLAN NOTICES, pp 403-416, Association for Computing Machinery (ACM), New York, NY, 2013.
25. Adaptive fast multipole methods on the GPU. Anders Goude and Stefan Engblom. In Journal of Supercomputing, volume 63, pp 897-918, 2013.
26. Improving OCBP-based scheduling for mixed-criticality sporadic task systems. Chuancai Gu, Nan Guan, Qingxu Deng, and Wang Yi. In Proc. 19th International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE Computer Society, 2013.
27. FIFO cache analysis for WCET estimation: A quantitative approach. Nan Guan, Xinping Yang, Mingsong Lv, and Wang Yi. In Proc. 16th Conference on Design, Automation and Test in Europe, pp 296-301, IEEE, Piscataway, NJ, 2013.
28. Finitary Real-Time Calculus: Efficient Performance Analysis of Distributed Embedded Systems. Nan Guan and Wang Yi. In Proc. Real-Time Systems Symposium: RTSS 2013, IEEE Computer Society, 2013.
29. New Techniques for Building Timing-Predictable Embedded Systems. Nan Guan. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1094, Acta Universitatis Upsaliensis, Uppsala, 2013.
30. 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.
31. Scientific computing on hybrid architectures. Marcus Holm. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2013-002, Uppsala University, 2013.
32. Dynamic and speculative polyhedral parallelization of loop nests using binary code patterns. Alexandra Jimborean, Philippe Clauss, Jean-François Dollinger, Vincent Loechner, and Juan Manuel Martinez Caamaño. In ICCS 2013, volume 18 of Procedia Computer Science, pp 2575-2578, 2013.
33. Online dynamic dependence analysis for speculative polyhedral parallelization. Alexandra Jimborean, Philippe Clauss, Juan Manuel Martinez Caamaño, and Aravind Sukumaran-Rajam. In Euro-Par 2013 Parallel Processing, volume 8097 of Lecture Notes in Computer Science, pp 191-202, Springer Berlin/Heidelberg, 2013.
34. A New Perspective for Efficient Virtual-Cache Coherence. Stefanos Kaxiras and Alberto Ros. In Proceedings of the 40th Annual International Symposium on Computer Architecture, pp 535-546, 2013.
35. On the scalability of the Erlang term storage. David Klaftenegger, Konstantinos Sagonas, and Kjell Winblad. In Proc. 12th ACM SIGPLAN Workshop on Erlang, pp 15-26, ACM Press, New York, 2013.
36. Towards more efficient execution: a decoupled access-execute approach. Konstantinos Koukos, David Black-Schaffer, Vasileios Spiliopoulos, and Stefanos Kaxiras. In Proc. 27th ACM International Conference on Supercomputing, pp 253-262, ACM Press, New York, 2013.
37. Component-based system design: analytic real-time interfaces for state-based component implementations. Kai Lampka, Simon Perathoner, and Lothar Thiele. In International Journal on Software Tools for Technology Transfer, volume 15, number 3, pp 155-170, Springer Berlin/Heidelberg, 2013.
38. A Skiplist-based Concurrent Priority Queue with Minimal Memory Contention. Jonatan Lindén and Bengt Jonsson. In OPODIS 2013: 17th International Conference On Principles Of DIstributed Systems, volume 8304 of Lecture Notes in Computer Science, pp 206-220, Springer Berlin/Heidelberg, Berlin, 2013.
39. A priori power estimation of linear solvers on multi-core processors. Dimitar Lukarski and Tobias Skoglund. Technical report / Department of Information Technology, Uppsala University nr 2013-020, 2013.
40. Stealing the shared cache for fun and profit. Moncef Mechri. Student thesis, supervisor: Erik Berg, examiner: David Black-Schaffer, Ivan Christoff, IT nr 13 048, 2013.
41. Multi-Mode Monitoring for Mixed-Criticality Real-time Systems. Moritz Neukirchner, Kai Lampka, Sophie Quinton, and Rolf Ernst. In Proc. 11th International Conference on Hardware/Software Codesign and System Synthesis, ACM Press, New York, 2013.
42. Classifying and Solving Horn Clauses for Verification. Philipp Rümmer, Hossein Hojjat, and Viktor Kuncak. In Fifth Working Conference on Verified Software: Theories, Tools and Experiments (VSTTE), 2013.
43. Disjunctive Interpolants for Horn-Clause Verification. Philipp Rümmer, Hossein Hojjat, and Viktor Kuncak. In Computer Aided Verification: CAV 2013, volume 8044 of Lecture Notes in Computer Science, pp 347-363, Springer Berlin/Heidelberg, 2013.
44. Exploring Interpolants. Philipp Rümmer and Pavle Subotic. In Formal Methods in Computer-Aided Design (FMCAD), 2013.
45. Precise explanation of success typing errors. Konstantinos Sagonas, Josep Silva, and Salvador Tamarit. In Proc. ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, pp 33-42, ACM Press, New York, 2013.
46. Modeling performance variation due to cache sharing. Andreas Sandberg, Andreas Sembrant, Erik Hagersten, and David Black-Schaffer. In Proc. 19th IEEE International Symposium on High Performance Computer Architecture, pp 155-166, IEEE Computer Society, 2013.
47. Can users control their data in social software?: An ethical analysis of control systems. Rula Sayaf, James B. Rule, and Dave Clarke. In Proc. Security and Privacy Workshops 2013, IEEE Computer Society, 2013.
48. TLC: A tag-less cache for reducing dynamic first level cache energy. Andreas Sembrant, Erik Hagersten, and David Black-Schaffer. In Proceedings of the 46th International Symposium on Microarchitecture, pp 49-61, ACM Press, New York, 2013.
49. Introducing DVFS-Management in a Full-System Simulator. Vasileios Spiliopoulos, Akash Bagdia, Andreas Hansson, Peter Aldworth, and Stefanos Kaxiras. In Proc. 21st International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, IEEE Computer Society, 2013.
50. The fork-join real-time task model. Martin Stigge, Pontus Ekberg, and Wang Yi. In ACM SIGBED Review, volume 10, number 2, pp 20-20, 2013.
51. Accurate surface embedding for higher order finite elements. Stefan Suwelack, Dimitar Lukarski, Vincent Heuveline, Rüdiger Dillmann, and Stefanie Speidel. In Proc. 12th ACM SIGGRAPH/Eurographics Symposium on Computer Animation, pp 187-192, ACM Press, New York, 2013.
52. A task parallel implementation of a scattered node stencil-based solver for the shallow water equations. Martin Tillenius, Elisabeth Larsson, Erik Lehto, and Natasha Flyer. In Proc. 6th Swedish Workshop on Multi-Core Computing, pp 33-36, Halmstad University, Halmstad, Sweden, 2013.
53. Resource-aware task scheduling. Martin Tillenius, Elisabeth Larsson, Rosa M. Badia, and Xavier Martorell. In 4th Workshop on Parallel Programming and Run-Time Management Techniques for Many-core Architectures (PARMA), p 6, Tech. Univ. Berlin, Germany, 2013.
54. Accelerating COBAYA3 on multi-core CPU and GPU systems using PARALUTION. Nico Trost, Javier Jiménez, Dimitar Lukarski, and Victor Sanchez. In Proc. 2nd Joint International Conference on Supercomputing in Nuclear Applications and Monte Carlo, La Société Française d'Energie Nucléaire, Paris, France, 2013.
55. 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.
56. Bells and Whistles: Advanced language features in psi-calculi. Johannes Åman Pohjola. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2013-004, Uppsala University, 2013.

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, 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. In Static Analysis, volume 7460 of Lecture Notes in Computer Science, pp 164-180, 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. Dense-Timed Pushdown Automata. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman. In Proc. 27th ACM/IEEE Symposium on Logic in Computer Science, pp 35-44, IEEE Computer Society, 2012.
6. 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.
7. Petri Nets with Time and Cost. Parosh Aziz Abdulla and Mayr Richard. INFINITY 2012, 14th International Workshop on Verification of Infinite-State Systems, 2012.
8. Regular model checking. Parosh Aziz Abdulla. In International Journal on Software Tools for Technology Transfer, volume 14, number 2, pp 109-118, 2012.
9. 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.
10. 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.
11. A scalability benchmark suite for Erlang/OTP. Stavros Aronis, Nikolaos Papaspyrou, Katerina Roukounaki, Konstantinos Sagonas, Yiannis Tsiouris, and Ioannis E. Venetis. In Proc. 11th ACM SIGPLAN Workshop on Erlang, pp 33-42, ACM Press, New York, 2012.
12. 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.
13. 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.
14. What's decidable about weak memory models?. Mohamed Faouzi Atig, Ahmed Bouajjani, Sebastian Burckhardt, and Madanlal Musuvathi. In Programming Languages and Systems, volume 7211 of Lecture Notes in Computer Science, pp 26-46, Springer Berlin/Heidelberg, 2012.
15. A succinct canonical register automaton model for data domains with binary relations. Sofia Cassel, Bengt Jonsson, F. Howar, and B. Steffen. In Automated Technology for Verification and Analysis: 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings, volume 7561 of Lecture Notes in Computer Science, pp 57-71, Springer, 2012.
16. Assume-Guarantee Reasoning for Safe Component Behaviours. Chris Chilton, Bengt Jonsson, and Marta Kwiatkowska. In Proc. FACS: Formal Aspects of Component Software, 9th Int. Symp., volume 7684 of Lecture Notes in Computer Science, pp 92-109, Springer, 2012.
17. 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.
18. Bounding and shaping the demand of mixed-criticality sporadic tasks. Pontus Ekberg and Wang Yi. In Proc. 24th Euromicro Conference on Real-Time Systems, pp 135-144, IEEE Computer Society, 2012.
19. 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.
20. On the stability of stochastic jump kinetics. Stefan Engblom. Technical report / Department of Information Technology, Uppsala University nr 2012-005, 2012.
21. Adaptive fast multipole methods on the GPU. Anders Goude and Stefan Engblom. Technical report / Department of Information Technology, Uppsala University nr 2012-012, 2012.
22. Fixed-Priority Multiprocessor Scheduling: Critical Instant, Response Time and Utilization Bound. Nan Guan and Wang Yi. In 2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS &amp; PHD FORUM (IPDPSW), IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum-IPDPSW, pp 2470-2473, 2012.
23. Parametric Utilization Bounds for Fixed-Priority Multiprocessor Scheduling. Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. In 2012 IEEE 26th International Parallel and Distributed Processing Symposium (IPDPS), International Parallel and Distributed Processing Symposium IPDPS, pp 261-272, 2012.
24. WCET analysis with MRU caches: Challenging LRU for predictability. Nan Guan, Mingsong Lv, Wang Yi, and Ge Yu. In Proc. 18th Real-Time and Embedded Technology and Applications Symposium, pp 55-64, IEEE Computer Society, 2012.
25. 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.
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, Uppsala University, 2012.
27. 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.
28. Accelerating interpolants. H. Hojjat, R. Iosif, F. Kone?ný, V. Kuncak, and Phillipp Rümmer. In Automated Technology for Verification and Analysis: 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings, volume 7561 of Lecture Notes in Computer Science, pp 187-202, 2012.
29. A verification toolkit for numerical transition systems. Hossein Hojjat, Filip Konecný, Florent Garnier, Radu Iosif, Viktor Kuncak, and Philipp Rümmer. In FM 2012: Formal Methods, volume 7436 of Lecture Notes in Computer Science, pp 247-251, Springer Berlin/Heidelberg, 2012.
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. Inferring semantic interfaces of data structures. F. Howar, M. Isberner, B. Steffen, O. Bauer, and Bengt Jonsson. In Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change: 5th International Symposium, ISoLA 2012, Heraklion, Crete, Greece, October 15-18, 2012, Proceedings, Part I, volume 7609 of Lecture Notes in Computer Science, pp 554-571, 2012.
32. Inferring Canonical Register Automata. Falk Howar, Bernhard Steffen, Bengt Jonsson, and Sofia Cassel. In Verification, Model Checking, and Abstract Interpretation - 13th International Conference,, volume 7148 of Lecture Notes in Computer Science, pp 251-266, Springer, 2012.
33. 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.
34. Using refinement calculus techniques to prove linearizability. Bengt Jonsson. In Formal Aspects of Computing, volume 24, number 4-6, pp 537-554, 2012.
35. 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.
36. Demonstrating Learning of Register Automata. Maik Merten, Falk Howar, Bernhard Steffen, Sofia Cassel, and Bengt Jonsson. In Tools and Algorithms for the Construction and Analysis of Systems - 18th International Conference,, volume 7214 of Lecture Notes in Computer Science, pp 466-471, Springer Berlin/Heidelberg, Berlin, 2012.
37. Predicting the Cost of Lock Contention in Parallel Applications on Multicores using Analytic Modeling. Xiaoyue Pan, Jonatan Lindén, and Bengt Jonsson. In Proc. 5th Swedish Workshop on Multi-Core Computing, 2012.
38. Extending psi-calculi and their formal proofs. Palle Raabjerg. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2012-008, Uppsala University, 2012.
39. Complexity-effective multicore coherence. Alberto Ros and Stefanos Kaxiras. In Proc. 21st International Conference on Parallel Architectures and Compilation Techniques, pp 241-251, ACM Press, New York, 2012.
40. E-matching with free variables. Philipp Rümmer. In Logic for Programming, Artificial Intelligence, and Reasoning, volume 7180 of Lecture Notes in Computer Science, pp 359-374, Springer Berlin/Heidelberg, 2012.
41. Efficient techniques for predicting cache sharing and throughput. Andreas Sandberg, David Black-Schaffer, and Erik Hagersten. In Proc. 21st International Conference on Parallel Architectures and Compilation Techniques, pp 305-314, ACM Press, New York, 2012.
42. Efficient techniques for detecting and exploiting runtime phases. Andreas Sembrant. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2012-009, Uppsala University, 2012.
43. 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.
44. 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.
45. Logics and Algorithms for Verification of Concurrent Systems. Rafa? Somla. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 964, Acta Universitatis Upsaliensis, Uppsala, 2012.
46. 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.
47. Leveraging multicore processors for scientific computing. Martin Tillenius. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2012-006, Uppsala University, 2012.
48. 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.
49. 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.
50. 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.
51. 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.

1. Advanced Ramsey-based Büchi automata inclusion testing. Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, and Tomás Vojnar. In CONCUR 2011 — Concurrency Theory, volume 6901 of Lecture Notes in Computer Science, pp 187-202, Springer Berlin/Heidelberg, 2011.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. 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.
8. 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.
9. 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.
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, 2011.
11. 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.
12. 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.
13. 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.
14. 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.
15. Detection of asynchronous message passing errors using static analysis. Maria Christakis and Konstantinos Sagonas. In Practical Aspects of Declarative Languages, volume 6539 of Lecture Notes in Computer Science, pp 5-18, Springer Berlin/Heidelberg, 2011.
16. Computing Systems: Research Challenges Ahead: The HiPEAC Vision 2011/2012. Marc Duranton, David Black-Schaffer, Sami Yehia, and Koen de Bosschere. 2011.
17. 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.
18. 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.
19. Efficient methods for application performance analysis. David Eklöv. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2011-001, Uppsala University, 2011.
20. 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.
21. On well-separated sets and fast multipole methods. Stefan Engblom. In Applied Numerical Mathematics, volume 61, pp 1096-1102, 2011.
22. Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. Nan Guan, Pontus Ekberg, Martin Stigge, and Wang Yi. In Proc. Real-Time Systems Symposium, pp 13-23, IEEE, Piscataway, NJ, 2011.
23. 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.
24. 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.
25. 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.
26. 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.
27. 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.
28. 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.
29. 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.
30. McAiT — a timing analyzer for multicore real-time software. Mingsong Lv, Nan Guan, Qingxu Deng, Ge Yu, and Wang Yi. In Automated Technology for Verification and Analysis, volume 6996 of Lecture Notes in Computer Science, pp 414-417, Springer-Verlag, Berlin, 2011.
31. 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.
32. 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.
33. 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.
34. 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.
35. 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.
36. 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.
37. 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.
38. 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.
39. 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.
40. 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.
41. 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.

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. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. Formalising process calculi. Jesper Bengtson. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 93, Acta Universitatis Upsaliensis, Uppsala, 2010.
8. 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.
9. 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.
10. 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.
11. 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.
12. 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.
13. Fixed-Priority Multiprocessor Scheduling with Liu &amp; 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.
14. 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.
15. 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.
16. 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.
17. Psi-calculi: a framework for mobile process calculi: Cook your own correct process calculus - just add data and logic. Magnus Johansson. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 94, Acta Universitatis Upsaliensis, Uppsala, 2010.
18. 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.
19. 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.
20. 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.
21. 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.
22. 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.
23. 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.
24. 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.
25. 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.
26. 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.
27. 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.
28. 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.
29. 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.
30. 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.
31. 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.
32. 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.
33. Verifying parallel programs with dynamic communication structures. Tayssir Touili and Mohamed Faouzi Atig. In Theoretical Computer Science, volume 411, pp 3460-3468, 2010.
34. 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.
35. 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.
36. 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.
37. 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.

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. A uniform (bi-)simulation-based framework for reducing tree automata. Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In Electronic Notes in Theoretical Computer Science, volume 251, pp 27-48, 2009.
3. 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.
4. 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.
5. Psi-calculi in Isabelle. Jesper Bengtson and Joachim Parrow. In Theorem Proving in Higher Order Logics, volume 5674 of Lecture Notes in Computer Science, pp 99-114, Springer-Verlag, Berlin, 2009.
6. 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.
7. 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.
8. 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.
9. 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.
10. Parallel Structured Adaptive Mesh Refinement. Jarmo Rantakokko and Michael Thuné. In Parallel Computing: Numerics, Applications, and Trends, pp 147-173, Springer-Verlag, London, 2009.
11. 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.
12. 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.
13. 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.
14. 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.
15. 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.
16. 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.
17. 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.
18. 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.

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.

Search for publications in DIVA