Department of Information Technology
Department of Information Technology
Uppsala UniversityInformation TechnologyResearchUPMARC
Listen

NEW

UPMARC Posters
4posters-200x146.jpg

UPMARC_700x150.gif

Publications by UPMARC researchers

This list include both UPMARC and other publications

2018

  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. Optimal Stateless Model Checking under the Release-Acquire Semantics. Parosh Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, and Tuan-Phong Ngo. In Proceedings of the ACM on Programming Languages, volume 2, number OOPSLA, pp 1-29, Association for Computing Machinery (ACM), 2018.
  3. 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.
  4. 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.
  5. Complexity of reachability for data-aware dynamic systems. Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig, Marco Montali, and Othmane Rezine. In Proc. 18th International Conference on Application of Concurrency to System Design, pp 11-20, IEEE Computer Society, 2018.
  6. 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.
  7. Mending fences with self-invalidation and self-downgrade. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Stefanos Kaxiras, Carl Leonardsson, Alberto Ros, and Yunyun Zhu. In Logical Methods in Computer Science, volume 14, number 1, 2018.
  8. Model checking parameterized systems. Parosh Aziz Abdulla, A. Prasad Sistla, and Muralidhar Talupur. In Handbook of Model Checking, pp 685-725, Springer, 2018.
  9. 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.
  10. Trau: SMT solver for string constraints. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Phi Diep Bui, Lukas Holik, Ahmed Rezine, and Philipp Rümmer. In Proceedings of the 2018 18th Conference on Formal Methods in Computer Aided Design (FMCAD), IEEE, 2018.
  11. Universal safety for timed Petri nets is PSPACE-complete. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Radu Ciobanu, Richard Mayr, and Patrick Totzke. In 29th International Conference on Concurrency Theory, volume 118 of Leibniz International Proceedings in Informatics, pp 6:1-15, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2018.
  12. 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.
  13. Schedulability Analysis and Software Synthesis for Graph-Based Task Models with Resource Sharing. Jakaria Abdullah, Gaoyang Dai, Morteza Mohaqeqi, and Wang Yi. In Proc. 24th Real-Time and Embedded Technology and Applications Symposium, pp 261-270, IEEE Computer Society, 2018.
  14. Assessment of risk in written communication: Introducing the Profile Risk Assessment Tool (PRAT). Nazar Akrami, Amendra Shrestha, Mathias Berggren, Lisa Kaati, Milan Obaidi, and Katie Cohen. EUROPOL, Belgium, 2018.
  15. Dynamically Disabling Way-prediction to Reduce Instruction Replay. Ricardo Alves, Stefanos Kaxiras, and David Black-Schaffer. In 2018 IEEE 36th International Conference on Computer Design (ICCD), Proceedings IEEE International Conference on Computer Design, pp 140-143, IEEE, 2018.
  16. Forward deterministic pricing of options using Gaussian radial basis functions. Jamal Amani Rad, Josef Höök, Elisabeth Larsson, and Lina von Sydow. In Journal of Computational Science, volume 24, pp 209-217, 2018.
  17. Model Checking Bounded Continuous-time Extended Linear Duration Invariants. Jie An, Naijun Zhan, Xiaoshan Li, Miaomiao Zhang, and Yi Wang. In HSCC 2018: Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (HSCC), pp 81-90, ASSOC COMPUTING MACHINERY, 2018.
  18. 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.
  19. 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.
  20. Verification and Evaluation of Computer and Communication Systems. Mohamed Faouzi Atig, Saddek Bensalem, Simon Bliudze, and Bruno Monsuez (eds). Volume 11181 of Lecture Notes in Computer Science, Springer, 2018.
  21. Verifying quantitative temporal properties of procedural programs. Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan. In 29th International Conference on Concurrency Theory, volume 118 of Leibniz International Proceedings in Informatics, pp 15:1-17, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2018.
  22. Bit-Vector Interpolation and Quantifier Elimination by Lazy Reduction. Peter Backeman, Philipp Rümmer, and Aleksandar Zeljic. In Formal Methods in Computer-Aided Design, pp 50-59, IEEE, 2018.
  23. 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.
  24. 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.
  25. Extending Automata Learning to Extended Finite State Machines. Sofia Cassel, Falk Howar, Bengt Jonsson, and Bernhard Steffen. In Machine Learning for Dynamic Software Analysis: Potentials and Limits, volume 11026 of Lecture Notes in Computer Science, pp 149-177, Springer, 2018.
  26. Attached and Detached Closures in Actors. Elias Castegren, Dave Clarke, Kiko Fernandez-Reyes, Tobias Wrigstad, and Albert Mingkun Yang. In Proceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control, pp 54-61, ACM Digital Library, 2018.
  27. 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.
  28. 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.
  29. OOlong: An Extensible Concurrent Object Calculus. Elias Castegren and Tobias Wrigstad. In SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied Computing, pp 1022-1029, 2018.
  30. OOlong: A Concurrent Object Calculus for Extensibility and Reuse. Elias Castegren and Tobias Wrigstad. In ACM SIGAPP Applied Computing Review, volume 18, number 4, pp 47-60, Association for Computing Machinery, 2018.
  31. Environmental Control at the Edge. Victoria Catalán Rivas, Emil Fröjd, Tobias Holmberg, Felix Ragnarsson, Elsa Rick, Lorenzo Corneo, Ambuj Varshney, Christian Rohner, Thiemo Voigt, and Per Gunningberg. In , 2018.
  32. 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.
  33. 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.
  34. Tail-PASS: Resource-based Cache Management for Tiled Graphics Rendering Hardware. Germán Ceballos, Erik Hagersten, and David Black-Schaffer. In Proc. 16th International Conference on Parallel and Distributed Processing with Applications, pp 55-63, IEEE, 2018.
  35. 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.
  36. EDF-VD Scheduling of Flexible Mixed-Criticality System With Multiple-Shot Transitions. Gang Chen, Nan Guan, Biao Hu, and Yi Wang. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, volume 37, number 11, pp 2393-2403, 2018.
  37. Utilization-Based Scheduling of Flexible Mixed-Criticality Real-Time Tasks. Gang Chen, Nan Guan, Di Liu, Qingqiang He, Kai Huang, Todor Stefanov, and Yi Wang. In IEEE Transactions on Computers, volume 67, number 4, pp 543-558, IEEE COMPUTER SOC, 2018.
  38. 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.
  39. Scheduling at the Edge for Assisting Cloud Real-Time Systems. Lorenzo Corneo and Per Gunningberg. In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, pp 9-14, ACM, New York, NY, USA, 2018.
  40. 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.
  41. Scalable population-level modelling of biological cells incorporating mechanics and kinetics in continuous time. Stefan Engblom, Daniel B. Wilson, and Ruth E. Baker. In Royal Society Open Science, volume 5, pp 180379:1-17, 2018.
  42. 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.
  43. Avoiding an IoT  "Tragedy of the Commons". Laura Marie Feeney and Per Gunningberg. In Proc. 16th International Conference on Mobile Systems, Applications, and Services, pp 495-497, ACM Press, New York, 2018.
  44. Preliminary Results on LoRaWAN and IEEE 802.15.4-SUN Interference. Laura Marie Feeney, Charalampos Orfanidis, Martin Jacobsson, and Per Gunningberg. In SenSys '18: Proceedings of the 16th ACM Conference on Embedded Networked Sensor, pp 430-431, ACM Press, New York, 2018.
  45. Forward to a Promising Future. Kiko Fernandez-Reyes, Dave Clarke, Elias Castegren, and Huu-Phuc Vo. In Conference proceedings COORDINATION 2018, 2018.
  46. 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.
  47. 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.
  48. Model-theoretic Conservative Extension of Definitional Theories. Arve Gengelbach and Tjark Weber. In Electronical Notes in Theoretical Computer Science, volume 338, pp 133-145, 2018.
  49. A general high order two-dimensional panel method. Anders Goude and Stefan Engblom. In Applied Mathematical Modelling, volume 60, pp 1-17, 2018.
  50. A Platform for Experiments with Energy Storage Devices for Low-power Wireless Networks. Robert Hartung, Jan Käberich, Lars C. Wolf, Laura Marie Feeney, Christian Rohner, and Per Gunningberg. In Proc. 12th International Workshop on Wireless Network Testbeds, Experimental Evaluation & Characterization, pp 68-76, ACM Press, New York, 2018.
  51. Integration of a Platform for Energy Storage Experiments into a Generic Testbed Framework. Robert Hartung, Jan Käberich, Lars C. Wolf, Laura Marie Feeney, Christian Rohner, and Per Gunningberg. In Proc. 12th International Workshop on Wireless Network Testbeds, Experimental Evaluation & Characterization, pp 77-78, ACM Press, New York, 2018.
  52. On the Consensus Mechanisms of Blockchain/DLT for Internet of Things. Qingqiang He, Nan Guan, Mingsong Lv, and Yi Wang. In 2018 IEEE 13th International Symposium On Industrial Embedded Systems (SIES), International Symposium on Industrial Embedded Systems, pp 150-159, IEEE, 2018.
  53. The ELDARICA Horn Solver. Hossein Hojjat and Philipp Rümmer. In Formal Methods in Computer Aided Design, pp 158-164, IEEE, 2018.
  54. String constraints with concatenation and transducers solved efficiently. Lukas Holik, Petr Janku, Anthony W. Lin, Philipp Rümmer, and Tomas Vojnar. In Proceedings of the ACM on Programming Languages, volume 2, number POPL, pp 1-32, ACM Digital Library, New York, 2018.
  55. Automatic Detection of Large Extended Data-Race-Free Regions with Conflict Isolation. Alexandra Jimborean, Per Ekemark, Jonatan Waern, Stefanos Kaxiras, and Alberto Ros. In IEEE Transactions on Parallel and Distributed Systems, volume 29, number 3, pp 527-541, IEEE COMPUTER SOC, 2018.
  56. The Quest for Optimality in Stateless Model Checking of Concurrent Programs. Bengt Jonsson. In Formal Methods For Industrial Critical Systems, FMICS 2018, volume 11119 of Lecture Notes in Computer Science, pp XI-XII, Springer, 2018.
  57. HiPErJiT: A Profile-Driven Just-in-Time Compiler for Erlang. Konstantinos Kallas and Konstantinos Sagonas. In Proceedings of the 30th Symposium on Implementation and Application ff Functional Languages (IFL 2018), pp 25-36, Association for Computing Machinery (ACM), 2018.
  58. Non-Speculative Load Reordering in Total Store Ordering. Stefanos Kaxiras, Trevor E. Carlson, Mehdi Alipour, and Alberto Ros. In IEEE Micro, volume 38, number 3, pp 48-57, IEEE COMPUTER SOC, 2018.
  59. Queue Delegation Locking. David Klaftenegger, Konstantinos Sagonas, and Kjell Winblad. In IEEE Transactions on Parallel and Distributed Systems, volume 29, number 3, pp 687-704, IEEE COMPUTER SOC, 2018.
  60. Automating regression verification of pointer programs by predicate abstraction. Vladimir Klebanov, Philipp Rümmer, and Mattias Ulbrich. In Formal methods in system design, volume 52, number 3, pp 229-259, 2018.
  61. Effective Stateless Model Checking for C/C++ Concurrency. Michalis Kokologiannakis, Ori Lahav, Konstantinos Sagonas, and Viktor Vafeiadis. In Proceedings of the ACM on Programming Languages, volume 2, number POPL, pp 1-32, ACM Press, 2018.
  62. 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.
  63. 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.
  64. 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.
  65. 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.
  66. Automating Targeted Property-Based Testing. Andreas Löscher and Konstantinos Sagonas. In IEEE 11th International Conference on Software Testing, Verification and Validation (ICST), IEEE International Conference on Software Testing Verification and Validation, pp 70-80, IEEE, 2018.
  67. Ventral hippocampal OLM cells control type 2 theta oscillations and response to predator odor. Sanja Mikulovic, Carlos Ernesto Restrepo, Samer Siwani, Pavol Bauer, Stefano Pupe Johann, Adriano B. L. Tort, Klas Kullander, and Richardson N. Leão. In Nature Communications, volume 9, pp 3638:1-15, 2018.
  68. Multidimensional performance and scalability analysis for diverse applications based on system monitoring data. Maya Neytcheva, Sverker Holmgren, Jonathan R. Bull, Ali Dorostkar, Anastasia Kruchinina, Dmitry Nikitenko, Nina Popova, Pavel Shvets, Alexey Teplov, Vadim Voevodin, and Vladimir Voevodin. In Parallel Processing and Applied Mathematics: Part I, volume 10777 of Lecture Notes in Computer Science, pp 417-431, Springer, 2018.
  69. Delorean: Virtualized Directed Profiling for Cache Modeling in Sampled Simulation. Nikos Nikoleris, Erik Hagersten, and Trevor E. Carlson. Technical report / Department of Information Technology, Uppsala University, 2018.
  70. Verified Software. Theories, Tools, and Experiments: Revised Selected Papers. Ruzica Piskac and Philipp Rümmer (eds). Volume 11294 of Lecture Notes in Computer Science, Springer Publishing Company, 2018.
  71. Non-Speculative Store Coalescing in Total Store Order. Alberto Ros and Stefanos Kaxiras. In Proc.45th International Symposium on Computer Architecture, pp 221-234, IEEE, 2018.
  72. The Superfluous Load Queue. Alberto Ros and Stefanos Kaxiras. In 2018 51st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO), pp 95-107, IEEE, 2018.
  73. Radial basis function methods for the Rosenau equation and other higher order PDEs. Ali Safdari-Vaighani, Elisabeth Larsson, and Alfa Heryudono. In Journal of Scientific Computing, volume 75, pp 1555-1580, 2018.
  74. A contention adapting approach to concurrent ordered sets. Konstantinos Sagonas and Kjell Winblad. In Journal of Parallel and Distributed Computing, volume 115, pp 1-19, ACADEMIC PRESS INC ELSEVIER SCIENCE, 2018.
  75. Progress on Algorithms for Stateless Model Checking. Konstantinos Sagonas. In Proceedings of the Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation, OPEN PUBL ASSOC, 2018.
  76. A Capacity Augmentation Bound for Real-Time Constrained-Deadline Parallel Tasks Under GEDF. Jinghao Sun, Nan Guan, Xu Jiang, Shuangshuang Chang, Zhishan Guo, Qingxu Deng, and Yi Wang. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, volume 37, number 11, pp 2200-2211, 2018.
  77. 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.
  78. 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.
  79. 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.
  80. The Cause-Effect Latency Problem in Real-Time Systems. Yi Wang. In Formal Methods For Industrial Critical Systems, FMICS 2018, volume 11119 of Lecture Notes in Computer Science, pp XIII-XIII, SPRINGER INTERNATIONAL PUBLISHING AG, 2018.
  81. 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.
  82. 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.
  83. Lock-free Contention Adapting Search Trees. Kjell Winblad, Konstantinos Sagonas, and Bengt Jonsson. In The 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, New York, NY, USA, 2018.
  84. 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.
  85. Distributed dynamic load balancing for task parallel programming. Afshin Zafari and Elisabeth Larsson. 2018.
  86. TaskUniVerse: A Task-Based Unified Interface for Versatile Parallel Execution. Afshin Zafari. In Parallel Processing and Applied Mathematics: Part I, volume 10777 of Lecture Notes in Computer Science, pp 169-184, Springer, 2018.
  87. Exploring Approximations for Floating-Point Arithmetic using UppSAT. Aleksandar Zeljic, Peter Backeman, Christoph M. Wintersteiger, and Philipp Rümmer. In Automated Reasoning, volume 10900 of Lecture Notes in Computer Science, pp 246-262, 2018.
  88. 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.
  89. 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.

2017

  1. An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures. Parosh Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, and Ahmed Rezine. In International Journal on Software Tools for Technology Transfer, volume 19, number 5, pp 549-563, SPRINGER HEIDELBERG, 2017.
  2. 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.
  3. 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.
  4. 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.
  5. Flatten and Conquer: A Framework for Efficient Analysis of String Constraints. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Phi Diep Bui, Lukas Hol?k, Ahmed Rezine, and Philipp Rümmer. In SIGPLAN notices, volume 52, number 6, pp 602-617, 2017.
  6. 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.
  7. 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.
  8. Towards a Tool: TIMES-Pro for Modeling, Analysis, Simulation and Implementation of Cyber-Physical Systems. Jakaria Abdullah, Gaoyang Dai, Nan Guan, Morteza Mohaqeqi, and Yi Wang. 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 623-639, SPRINGER INTERNATIONAL PUBLISHING AG, 2017.
  9. A Taxonomy of Out-of-Order Instruction Commit. Mehdi Alipour, Trevor E. Carlson, and Stefanos Kaxiras. In 2017 Ieee International Symposium On Performance Analysis Of Systems And Software (Ispass), pp 135-136, IEEE Computer Society, Los Alamitos, 2017.
  10. 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.
  11. Addressing energy challenges in filter caches. Ricardo Alves, Nikos Nikoleris, Stefanos Kaxiras, and David Black-Schaffer. In Proc. 29th International Symposium on Computer Architecture and High Performance Computing, pp 49-56, IEEE Computer Society, 2017.
  12. 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.
  13. 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.
  14. Selected and extended papers from Partial Evaluation and Program Manipulation 2015 (PEPM ' 15). Kenichi Asai and Konstantinos Sagonas. In Science of Computer Programming, volume 137, pp 1-1, ELSEVIER SCIENCE BV, 2017.
  15. Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete. Mohamed Faouzi Atig, Benedikt Bollig, and Peter Habermehl. In International Journal of Foundations of Computer Science, volume 28, number 8, pp 945-975, 2017.
  16. 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.
  17. 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.
  18. 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.
  19. 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.
  20. 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.
  21. Numerical solution of the viscous flow past a cylinder with a non-global yet spectrally convergent meshless collocation method. Francisco Bernal, Alfa R. H. Heryudono, and Elisabeth Larsson. In Spectral and High Order Methods for Partial Differential Equations: ICOSAHOM 2016, volume 119 of Lecture Notes in Computational Science and Engineering, pp 495-507, Springer, 2017.
  22. Deriving Probability Density Functions from Probabilistic Functional Programs. Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, and Claudio Russo. In Logical Methods in Computer Science, volume 13, number 2, 2017.
  23. 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.
  24. Mining for Safety using Interactive Trace Analysis. Stephan Brandauer and Tobias Wrigstad. In Pre-Proceedings - Fifteenth International Workshop on Quantitative Aspects of Programming Languages and Systems, 2017.
  25. Spencer: Interactive Heap Analysis for the Masses. Stephan Brandauer and Tobias Wrigstad. In 2017 IEEE/ACM 14th International Conference on Mining Software Repositories (MSR 2017), IEEE International Working Conference on Mining Software Repositories, pp 113-123, IEEE, 2017.
  26. 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.
  27. Actors without Borders: Amnesty for Imprisoned State. Elias Castegren and Tobias Wrigstad. In , pp 10-20, 2017.
  28. Reference Capabilities for Concurrency &amp; Scalability: an Experience Report. Elias Castegren and Tobias Wrigstad. In , 2017.
  29. Relaxed Linear References for Lock-free Data Structures. Elias Castegren and Tobias Wrigstad. In , pp 47:1-47:31, 2017.
  30. Types for CAS: Relaxed Linearity with Ownership Transfer. Elias Castegren and Tobias Wrigstad. 2017.
  31. 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.
  32. 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.
  33. 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.
  34. 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.
  35. 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.
  36. 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.
  37. Learning to prove safety over parameterised concurrent systems. Yu-Fang Chen, Chih-Duo Hong, Anthony W. Lin, and Philipp Rümmer. In Proceedings of the 17th International Conference on Formal Methods in Computer-Aided Design, pp 76-83, IEEE, 2017.
  38. Vascular sprouts induce local attraction of proangiogenic neutrophils. Gustaf Christoffersson, Jalal Lomei, Paul O'Callaghan, Johan Kreuger, Stefan Engblom, and Mia Phillipson. In Journal of Leukocyte Biology, volume 102, pp 741-751, 2017.
  39. 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.
  40. Linguistic markers of a radicalized mind-set among extreme adopters. Katie Cohen, Tim Isbister, Lisa Kaati, and Amendra Shrestha. In Proc. 10th ACM International Conference on Web Search and Data Mining, pp 823-824, ACM Press, New York, 2017.
  41. Scope-Aware Classification: Taking the hierarchical private/shared data classification to the next level. Mahdad Davari, Erik Hagersten, and Stefanos Kaxiras. Technical report / Department of Information Technology, Uppsala University nr 2017-008, 2017.
  42. The best of both works: A hybrid data-race-free cache coherence scheme. Mahdad Davari, Erik Hagersten, and Stefanos Kaxiras. 2017.
  43. Systematic predicate abstraction using variable roles. Yulia Demyanova, Philipp Rümmer, and Florian Zuleger. In NASA Formal Methods, volume 10227 of Lecture Notes in Computer Science, pp 265-281, Springer, 2017.
  44. Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard. Pontus Ekberg and Yi Wang. In 2017 IEEE Real-Time Systems Symposium (RTSS)<em></em>, Real-Time Systems Symposium-Proceedings, pp 139-146, IEEE, 2017.
  45. Data-driven computational disease spread modeling: from measurement to parametrization and control. Stefan Engblom and Stefan Widgren. In Disease Modelling and Public Health: Part A, volume 36 of Handbook of Statistics, pp 305-328, Elsevier, 2017.
  46. Multiscale simulation of stochastic reaction–diffusion networks. Stefan Engblom, Andreas Hellander, and Per Lötstedt. In Stochastic Processes, Multiscale Modeling, and Numerical Methods for Computational Cellular Biology, pp 55-79, Springer, 2017.
  47. Stability and strong convergence for spatial stochastic kinetics. Stefan Engblom. In Stochastic Processes, Multiscale Modeling, and Numerical Methods for Computational Cellular Biology, pp 109-125, Springer, 2017.
  48. Making batteries a first class element in the design and evaluation of embedded wireless systems. Laura Marie Feeney, Christian Rohner, and Per Gunningberg. In Proc. 14th International Conference on Embedded Wireless Systems and Networks, pp 242-243, ACM Digital Library, 2017.
  49. Towards realistic lifetime estimation in battery-powered IoT devices. Laura Marie Feeney, Robert Hartung, Christian Rohner, Ulf Kulau, Lars Wolf, and Per Gunningberg. In Proceedings of the 15th ACM Conference on Embedded Network Sensor Systems Article No. 67, Association for Computing Machinery (ACM), 2017.
  50. Efficient Drone Hijacking Detection using Onboard Motion Sensors. Zhiwei Feng, Nan Guan, Mingsong Lv, Weichen Liu, Qingxu Deng, Xue Liu, and Yi Wang. In Proceedings Of The 2017 Design, Automation &amp; Test In Europe Conference &amp; Exhibition (DATE), Design Automation and Test in Europe Conference and Exhibition, pp 1414-1419, IEEE, 2017.
  51. IoT Data Profiles: The Routines of Your Life Reveals Who You Are. Johan Fernquist, Torbjörn Fängström, and Lisa Kaati. In 2017 European Intelligence and Security Informatics Conference (EISIC), European Intelligence and Security Informatics Conference, pp 61-67, IEEE, 2017.
  52. 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.
  53. Concolic testing for functional languages. Aggelos Giantsios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Science of Computer Programming, volume 147, pp 109-134, 2017.
  54. Preface to special issue on satisfiability modulo theories. Alberto Griggio and Philipp Rümmer. In Formal methods in system design, volume 51, number 3, pp 431-432, 2017.
  55. Deciding and Interpolating Algebraic Data Types by Reduction. Hossein Hojjat and Philipp Rümmer. In 2017 19th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC 2017), International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp 145-152, IEEE, New York, 2017.
  56. Gender Classification with Data Independent Features in Multiple Languages. Tim Isbister, Lisa Kaati, and Katie Cohen. In 2017 European Intelligence and Security Informatics Conference (EISIC), European Intelligence and Security Informatics Conference, pp 54-60, IEEE, 2017.
  57. Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors. Xu Jiang, Nan Guan, Xiang Long, and Wang Yi. In 2017 IEEE Real-Time Systems Symposium (RTSS), Real-Time Systems Symposium-Proceedings, pp 80-91, IEEE, 2017.
  58. 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.
  59. Quantified heap invariants for object-oriented programs. Temesghen Kahsai, Rody Kersten, Philipp Rümmer, and Martin Schäf. In 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 46 of EPiC Series in Computing, pp 368-384, 2017.
  60. 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.
  61. Generalized Finitary Real-Time Calculus. Kai Lampka, Steffen Bondorf, Jens B. Schmitt, Nan Guan, and Yi Wang. In IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, IEEE INFOCOM, IEEE, 2017.
  62. A least squares radial basis function partition of unity method for solving PDEs. Elisabeth Larsson, Victor Shcherbakov, and Alfa Heryudono. In SIAM Journal on Scientific Computing, volume 39, pp A2538-A2563, 2017.
  63. Book Review: A Primer on Radial Basis Functions with Applications to the Geosciences. Elisabeth Larsson. In SIAM Review, volume 59, pp 688-689, 2017.
  64. Fair termination for parameterized probabilistic concurrent systems. Ondrej Lengál, Anthony W. Lin, Rupak Majumdar, and Philipp Rümmer. In Tools and Algorithms for the Construction and Analysis of Systems: Part I, volume 10205 of Lecture Notes in Computer Science, pp 499-517, Springer, 2017.
  65. 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.
  66. Targeted property-based testing. Andreas Löscher and Konstantinos Sagonas. In Proc. 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, pp 46-56, ACM Press, New York, 2017.
  67. A flexible computational framework using R and Map-Reduce for permutation tests of massive genetic analysis of complex traits. Behrang Mahjani, Salman Toor, Carl Nettelblad, and Sverker Holmgren. In IEEE/ACM Transactions on Computational Biology & Bioinformatics, volume 14, pp 381-392, 2017.
  68. 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.
  69. 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.
  70. Investigating interference between LoRa and IEEE 802.15.4g networks. Charalampos Orfanidis, Laura Marie Feeney, Martin Jacobsson, and Per Gunningberg. In Proc. 13th International Conference on Wireless and Mobile Computing, Networking and Communications, pp 441-448, IEEE, 2017.
  71. Weak Nominal Modal Logic. Joachim Parrow, Tjark Weber, Johannes Borgström, and Lars-Henrik Eriksson. In Formal Techniques for Distributed Objects, Components, and Systems, volume 10321 of Lecture Notes in Computer Science, pp 179-193, Springer, 2017.
  72. 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.
  73. Efficient Self-Invalidation/Self-Downgrade for Critical Sections with Relaxed Semantics. Alberto Ros, Carl Leonardsson, Christos Sakalis, and Stefanos Kaxiras. In IEEE Transactions on Parallel and Distributed Systems, volume 28, number 12, pp 3413-3425, 2017.
  74. 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.
  75. The Contention Avoiding Concurrent Priority Queue. Konstantinos Sagonas and Kjell Winblad. In Languages and Compilers for Parallel Computing, volume 10136 of Lecture Notes in Computer Science, pp 314-330, Springer, 2017.
  76. A graphics tracing framework for exploring CPU+GPU memory systems. Andreas Sembrant, Trevor E. Carlson, Erik Hagersten, and David Black-Schaffer. In Proc. 20th International Symposium on Workload Characterization, pp 54-65, IEEE, 2017.
  77. 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.
  78. POSTER: Putting the G back into GPU/CPU Systems Research. Andreas Sembrant, Trevor E. Carlson, Erik Hagersten, and David Black-Schaffer. In 2017 26TH INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT), International Conference on Parallel Architectures and Compilation Techniques, pp 130-131, 2017.
  79. Multiscale stochastic neuron modeling – with applications in deep brain stimulation. Aleksandar Senek and Stefan Engblom. In Proc. Summer Simulation Multiconference: 2017, pp 38:1-5, Society for Computer Simulation International, San Diego, CA, 2017.
  80. A Machine Learning Approach Towards Detecting Extreme Adopters in Digital Communities. Amendra Shrestha, Lisa Kaati, and Katie Cohen. In 2017 28th International Workshop on Database and Expert Systems Applications (DEXA), International Workshop on Database and Expert Systems Applications-DEXA, pp 1-5, IEEE, 2017.
  81. Applying Real-Time Scheduling Theory to the Synchronous Data Flow Model of Computation. Abhishek Singh, Pontus Ekberg, and Sanjoy Baruah. In , 2017.
  82. Real-Time Scheduling and Analysis of OpenMP Task Systems with Tied Tasks. Jinghao Sun, Nan Guan, Yang Wang, Qingqiang He, and Yi Wang. In 2017 IEEE Real-Time Systems Symposium (RTSS), Real-Time Systems Symposium-Proceedings, pp 92-103, IEEE, 2017.
  83. Revisiting GPC and AND Connector in Real-Time Calculus. Yue Tang, Nan Guan, Weichen Liu, Linh Thi Xuan Phan, and Wang Yi. In 2017 IEEE Real-Time Systems Symposium (RTSS), Real-Time Systems Symposium-Proceedings, pp 255-265, IEEE, 2017.
  84. 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.
  85. 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.
  86. Benchmarking OpenMP Programs for Real-Time Scheduling. Yang Wang, Nan Guan, Jinghao Sun, Mingsong Lv, Qingqiang He, Tianzhang He, and Yi Wang. In 2017 IEEE 23Rd International Conference On Embedded And Real-Time Computing Systems And Applications (RTSCA), IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE Computer Society, 2017.
  87. Towards Customizable CPS: Composability, Efficiency and Predictability. Yi Wang. In Formal Methods and Software Engineering, volume 10610 of Lecture Notes in Computer Science, pp 3-15, Springer, 2017.
  88. 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.
  89. Mastery Learning-Like Teaching with Achievements. Tobias Wrigstad and Elias Castegren. In , 2017.
  90. 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.
  91. 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.

2016

  1. Automated Verification of Linearization Policies. Parosh Abdulla, Bengt Jonsson, and Cong Quy Trinh. In Automated Verification of Linearization Policies: 23rd International Symposium, SAS 2016, Edinburgh, UK, September 8-10, 2016, Proceedings, 2016.
  2. Qualitative Analysis of VASS-Induced MDPs. Parosh Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, and Jeremy Sproston. In Foundations Of Software Science And Computation Structures (FOSSACS 2016), volume 9634 of Lecture Notes in Computer Science, pp 319-334, 2016.
  3. Data Communicating Processes with Unreliable Channels. Parosh Aziz Abdulla, Aiswarya Cyriac, and Mohamed Faouzi Atig. In Proceedings Of The 31St Annual ACM-IEEE Symposium On Logic In Computer Science (LICS 2016), pp 166-175, 2016.
  4. Parameterized verification. Parosh A. Abdulla and Giorgio Delzanno. In International Journal on Software Tools for Technology Transfer, volume 18, number 5, pp 469-473, 2016.
  5. Counter-Example Guided Program Verification. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Phi Diep Bui. In FM 2016: Formal Methods, volume 9995 of Lecture Notes in Computer Science, pp 25-42, Springer, 2016.
  6. 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.
  7. Parameterized verification of time-sensitive models of ad hoc network protocols. Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, and Riccardo Traverso. In Theoretical Computer Science, volume 612, pp 1-22, 2016.
  8. 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.
  9. Recency-Bounded Verification of Dynamic Database-Driven Systems. Parosh Aziz Abdulla, Aiswarya Cyriac, Mohamed Faouzi Atig, Marco Montali, and Othmane Rezine. In PODS'16: PROCEEDINGS OF THE 35TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, pp 195-210, 2016.
  10. 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.
  11. 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.
  12. 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.
  13. 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.
  14. Multi-domain alias matching using machine learning. Michael Ashcroft, Fredrik Johansson, Lisa Kaati, and Amendra Shrestha. In Proc. 3rd European Network Intelligence Conference, pp 77-84, IEEE, 2016.
  15. 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.
  16. The complexity of regular abstractions of one-counter languages. Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, and Georg Zetzsche. In Proceedings Of The 31St Annual ACM-IEEE Symposium On Logic In Computer Science (LICS 2016), pp 207-216, 2016.
  17. 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.
  18. Psi-Calculi in Isabelle. Jesper Bengtson, Joachim Parrow, and Tjark Weber. In Journal of automated reasoning, volume 56, number 1, pp 1-47, 2016.
  19. AutoDietary: A wearable acoustic sensor system for food intake recognition in daily life. Yin Bi, Mingsong Lv, Chen Song, Wenyao Xu, Nan Guan, and Wang Yi. In IEEE Sensors Journal, volume 16, number 3, pp 806-816, 2016.
  20. Multi-feature fusion for thermal face recognition. Yin Bi, Mingsong Lv, Yangjie Wei, Nan Guan, and Wang Yi. In Infrared physics & technology, volume 77, pp 366-374, 2016.
  21. 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.
  22. Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing. Johan Blom, Bengt Jonsson, and Sven-Olof Nyström. In , 2016.
  23. Model-Based Protocol Testing in an Erlang Environment. Johan Blom. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 122, Acta Universitatis Upsaliensis, Uppsala, 2016.
  24. A Lambda-Calculus Foundation for Universal Probabilistic Programming. Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, and Marcin Szymczak. In SIGPLAN notices, volume 51, number 9, pp 33-46, 2016.
  25. 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.
  26. Fabular: Regression formulas as probabilistic programming. Johannes Borgström, Andrew D. Gordon, Long Ouyang, Claudio Russo, Adam Scibior, and Marcin Szymczak. In Proc. 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volume 51(1) of ACM SIGPLAN Notices, pp 271-283, ACM Press, New York, 2016.
  27. A direct solver for the advection–diffusion equation using Green's functions and low-rank approximation. Jonathan Bull, Stefan Engblom, and Sverker Holmgren. In Proc. 7th ECCOMAS Congress, pp 7302-7316, European Community on Computional Methods in Applied Sciences (ECCOMAS), 2016.
  28. 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.
  29. Extended versions of papers presented at WS-FM 2014 and Beat 2014. Marco Carbone, Thomas Hildebrandt, Joachim Parrow, and Matthias Weidlich. In Formal Aspects of Computing, volume 28, number 4, pp 529-530, 2016.
  30. 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.
  31. Determining progress in writing competency by assessing students’ argumentation. Sofia Cassel and Aletta Nylén. In Proc. 46th ASEE/IEEE Frontiers in Education Conference, IEEE Press, Piscataway, NJ, 2016.
  32. Kappa: Insights, Current Status and Future Work. Elias Castegren and Tobias Wrigstad. In , 2016.
  33. 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.
  34. Reference Capabilities for Concurrency Control. Elias Castegren and Tobias Wrigstad. In ECOOP 2016 — Object-Oriented Programming, 2016.
  35. 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.
  36. Types for CAS: Relaxed Linearity with Ownership Transfer. Elias Castegren and Tobias Wrigstad. In , 2016.
  37. 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.
  38. 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.
  39. Spatial and Temporal Cache Sharing Analysis in Tasks. Germán Ceballos and David Black-Schaffer. In , Timisoara, Romania, 2016.
  40. 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.
  41. Schedulability analysis of a graph-based task model for mixed-criticality systems. Pontus Ekberg and Wang Yi. In Real-time systems, volume 52, number 1, pp 1-37, 2016.
  42. Fast Matlab compatible sparse assembly on multicore computers. Stefan Engblom and Dimitar Lukarski. In Parallel Computing, volume 56, pp 1-17, 2016.
  43. 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.
  44. Measuring online affects in a white supremacy forum. Léo Figea, Lisa Kaati, and Ryan Scrivens. In Proc. 14th International Conference on Intelligence and Security Informatics, pp 85-90, IEEE, 2016.
  45. An Online Overclocking Scheme for Bursty Real-time Tasks and an Evaluation of its Thermal Impact. Bjoern Forsberg, Kai Lampka, and Vasileios Spiliopoulos. In 14Th ACM/IEEE Symposium On Embedded Systems For Real-Time Multimedia (ESTIMEDIA 2016), pp 104-113, 2016.
  46. Towards Enabling Low-Level Memory Optimisations at the High-Level with Ownership Annotations. Juliana Franco, Tobias Wrigstad, and Sophia Drossopoulou. In , 2016.
  47. Preface, Electronic Proceedings in Theoretical Computer Science. Vol 219. John Gallagher and Philipp Rümmer. In Electronic Proceedings in Theoretical Computer Science, number 219, OPEN PUBL ASSOC, 2016.
  48. Kleene Algebras with Domain. Victor B. F. Gomes, Walter Guttmann, Peter Höfner, Georg Struth, and Tjark Weber. In Archive of Formal Proofs, 2016.
  49. 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.
  50. 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.
  51. 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.
  52. Pointer Race Freedom. Frédéric Haziza, Lukás Holík, Roland Meyer, and Sebastian Wolff. In Verification, Model Checking, And Abstract Interpretation, VMCAI 2016, volume 9583 of Lecture Notes in Computer Science, pp 393-412, Springer, 2016.
  53. Preconditioning for radial basis function partition of unity methods. Alfa Heryudono, Elisabeth Larsson, Alison Ramage, and Lina von Sydow. In Journal of Scientific Computing, volume 67, pp 1089-1109, 2016.
  54. Optimizing Horn Solvers for Network Repair. Hossein Hojjat, Philipp Rümmer, Jedidiah McClurg, Pavol Cerny, and Nate Foster. In Proceedings of the 2016 16Th Conference on Formal Methods In Computer-Aided Design (FMCAD 2016), pp 73-80, IEEE, 2016.
  55. Concise Loads and Stores: The Case for an Asymmetric Compute-Memory Architecture for Approximation. Animesh Jain, Parker Hill, Shih-Chieh Lin, Muneeb Khan, Md E. Haque, Michael A. Laurenzano, Scott Mahlke, Lingjia Tang, and Jason Mars. In 2016 49Th Annual IEEE/ACM International Symposium On Microarchitecture (MICRO), International Symposium on Microarchitecture Proceedings, 2016.
  56. 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.
  57. Automatic detection of xenophobic narratives: A case study on Swedish alternative media. Lisa Kaati, Amendra Shrestha, Katie Cohen, and Sinna Lindquist. In Proc. 14th International Conference on Intelligence and Security Informatics, pp 121-126, IEEE, 2016.
  58. Countering lone actor terrorism: Weak signals and online activities. Lisa Kaati and Fredrik Johansson. In Understanding Lone Actor Terrorism: Past experience, future outlook, and response strategies, pp 266-279, Routledge, Abingdon, UK, 2016.
  59. Identifying Warning Behaviors of Violent Lone Offenders in Written Communication. Lisa Kaati, Amendra Shrestha, and Tony Sardella. In 2016 IEEE 16Th International Conference On Data Mining Workshops (ICDMW), International Conference on Data Mining Workshops, pp 1053-1060, IEEE, New York, 2016.
  60. Identifying warning behaviors of violent lone offenders in written communication. Lisa Kaati, Amendra Shrestha, and Tony Sardella. In Proc. 16th ICDM Workshops, pp 1053-1060, IEEE Computer Society, 2016.
  61. Linguistic analysis of lone offender manifestos. Lisa Kaati, Amendra Shrestha, and Katie Cohen. In Proc. 4th International Conference on Cybercrime and Computer Forensics, IEEE, 2016.
  62. Semantic technologies for detecting names of new drugs on darknets. Lisa Kaati, Fredrik Johansson, and Elinor Forsman. In Proc. 4th International Conference on Cybercrime and Computer Forensics, IEEE, 2016.
  63. JayHorn: A framework for verifying Java programs. Temesghen Kahsai, Philipp Rümmer, Huascar Sanchez, and Martin Schäf. In Computer Aided Verification: Part I, volume 9779 of Lecture Notes in Computer Science, pp 352-358, Springer, 2016.
  64. 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.
  65. 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.
  66. 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.
  67. 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.
  68. An adaptive interpolation scheme for molecular potential energy surfaces. Markus Kowalewski, Elisabeth Larsson, and Alfa Heryudono. In Journal of Chemical Physics, volume 145, pp 084104:1-10, 2016.
  69. Keep it cool and in time: With runtime monitoring to thermal-aware execution speeds for deadline constrained systems. Kai Lampka, Björn Forsberg, and Vasileios Spiliopoulos. In Journal of Parallel and Distributed Computing, volume 95, pp 79-91, 2016.
  70. 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.
  71. 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.
  72. 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.
  73. 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.
  74. EDF-VD scheduling of mixed-criticality systems with degraded quality guarantees. Di Liu, Jelena Spasic, Nan Guan, Gang Chen, Songran Liu, Todor Stefanov, and Wang Yi. In Proc. 37th Real-Time Systems Symposium, pp 35-46, IEEE Computer Society, 2016.
  75. 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.
  76. Speed planning for solar-powered electric vehicles. Mingsong Lv, Nan Guan, Ye Ma, Dong Ji, Erwin Knippel, Xue Liu, and Wang Yi. In Proc. 17th International Conference on Future Energy Systems, ACM Press, New York, 2016.
  77. The Nifty way to call hell from heaven. Andreas Löscher and Konstantinos Sagonas. In Proc. 15th International Workshop on Erlang, pp 1-11, ACM Press, New York, 2016.
  78. QTL as a service: PruneDIRECT for multi-dimensional QTL scans in cloud settings. Behrang Mahjani, Salman Toor, Carl Nettelblad, and Sverker Holmgren. In Bioinformatics, 2016. Publication status: Submitted
  79. 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.
  80. 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.
  81. On fixed-priority schedulability analysis of sporadic tasks with self-suspension. Morteza Mohaqeqi, Pontus Ekberg, and Wang Yi. In Proc. 24th International Conference on Real-Time Networks and Systems, pp 109-118, ACM Press, New York, 2016.
  82. 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.
  83. Multiprocessor Real-Time Locking Protocols for Replicated Resources. Catherine E. Nemitz, Kecheng Yang, Ming Yang, Pontus Ekberg, and James H. Anderson. In Proc. 28th Euromicro Conference on Real-Time Systems (ECRTS), Proceedings of the Euromicro Conference on Real-time Systems, pp 50-60, 2016.
  84. CoolSim: Statistical Techniques to Replace Cache Warming with Efficient, Virtualized Profiling. Nikos Nikoleris, Andreas Sandberg, Erik Hagersten, and Trevor E. Carlson. In Proceedings Of 2016 International Conference On Embedded Computer Systems: Architectures, Modeling And Simulation (Samos), pp 106-115, IEEE, 2016.
  85. CoolSim: Eliminating Traditional Cache Warming with Fast, Virtualized Profiling. Nikos Nikoleris, Andreas Sandberg, Erik Hagersten, and Trevor E. Carlson. In 2016 IEEE International Symposium On Performance Analysis Of Systems And Software ISPASS 2016, IEEE International Symposium on Performance Analysis of Systems and Software-ISPASS, pp 149-150, 2016.
  86. 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.
  87. A Comparative Study of GPUVerify and GKLEE. Anmol Panda, Philipp Rümmer, and Neena Goveas. In 2016 Fourth International Conference On Parallel, Distributed And Grid Computing (PDGC), pp 112-117, IEEE, 2016.
  88. General conditions for full abstraction. Joachim Parrow. In Mathematical Structures in Computer Science, volume 26, number 4, pp 655-657, 2016.
  89. The largest respectful function. Joachim Parrow and Tjark Weber. In Logical Methods in Computer Science, volume 12, number 2, 2016.
  90. Proceedings från 5:e utvecklingskonferensen för Sveriges ingenjörsutbildningar. Stefan Pålsson and Björn Victor (eds). Volume 2016-002 of Technical report / Department of Information Technology, Uppsala University, 2016.
  91. Efficient Self-Invalidation/Self-Downgrade for Critical Sections with Relaxed Semantics. Alberto Ros, Carl Leonardsson, Christos Sakalis, and Stefanos Kaxiras. In Proc. International Conference on Parallel Architectures and Compilation: PACT 2016, pp 433-434, ACM Press, New York, 2016.
  92. Racer: TSO Consistency via Race Detection. Alberto Ros and Stefanos Kaxiras. In 2016 49Th Annual IEEE/ACM International Symposium On Microarchitecture (MICRO), International Symposium on Microarchitecture Proceedings, 2016.
  93. 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.
  94. 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.
  95. 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.
  96. 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.
  97. Radial basis function partition of unity methods for pricing vanilla basket options. Victor Shcherbakov and Elisabeth Larsson. In Computers and Mathematics with Applications, volume 71, pp 185-200, 2016.
  98. Techniques for modulating error resilience in emerging multi-value technologies. Magnus Själander, Gustaf Borgström, Mykhailo V. Klymenko, Françoise Remacle, and Stefanos Kaxiras. In Proc. 13th International Conference on Computing Frontiers, pp 55-63, ACM Press, New York, 2016.
  99. A unified DVFS-cache resizing framework. Vasileios Spiliopoulos, Andreas Sembrant, Georgios Keramidas, Erik Hagersten, and Stefanos Kaxiras. Technical report / Department of Information Technology, Uppsala University nr 2016-014, 2016.
  100. 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.
  101. Feasibility of fork-join real-time task graph models: Hardness and algorithms. Jinghao Sun, Nan Guan, Yang Wang, Qingxu Deng, Peng Zeng, and Wang Yi. In ACM Transactions on Embedded Computing Systems, volume 15, number 1, 2016.
  102. Accelerating COBAYA3 on multi-core CPU and GPU systems using PARALUTION. Nico Trost, Javier Jimenez, Dimitar Lukarski, and Victor Sanchez. In SNA + MC 2013 - Joint International Conference On Supercomputing In Nuclear Applications + Monte Carlo, 2016.
  103. Analytical Processor Performance and Power Modeling Using Micro-Architecture Independent Characteristics. Sam Van den Steen, Stijn Eyerman, Sander De Pestel, Moncef Mechri, Trevor E. Carlson, David Black-Schaffer, Erik Hagersten, and Lieven Eeckhout. In IEEE Transactions on Computers, volume 65, number 12, pp 3537-3551, 2016.
  104. Approximation: A New Paradigm also for Wireless Sensing. Thiemo Voigt, Magnus Själander, Frederik Hermans, Alexandra Jimborean, Erik Hagersten, Per Gunningberg, and Stefanos Kaxiras. In , 2016.
  105. 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.
  106. 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.
  107. Scrambling and descrambling SMT-LIB benchmarks. Tjark Weber. In Satisfiability Modulo Theories: SMT 2016, volume 1617 of CEUR Workshop Proceedings, pp 31-40, RWTH Aachen University, 2016.
  108. The 2014 SMT Competition. Tjark Weber, David R. Cok, and David Deharbe. In Journal on Satisfiability, Boolean Modeling and Computation, 2016.
  109. Dynamic blind source separation based on source-direction prediction. Yangjie Wei and Wang Yi. In Neurocomputing, volume 185, pp 73-81, 2016.
  110. 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.
  111. 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.
  112. Task parallel implementation of a solver for electromagnetic scattering problems. Afshin Zafari, Elisabeth Larsson, Marco Righero, M. Alessandro Francavilla, Giorgio Giordanengo, Francesca Vipiana, and Giuseppe Vecchi. Technical report / Department of Information Technology, Uppsala University nr 2016-015, 2016.
  113. 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.
  114. Start time configuration for strictly periodic real-time task systems. Tianyu Zhang, Nan Guan, Qingxu Deng, and Wang Yi. In Journal of systems architecture, volume 66–67, pp 61-68, 2016.
  115. Bisimulation up-to techniques for psi-calculi. Johannes Åman Pohjola and Joachim Parrow. In Proc. 5th ACM SIGPLAN Conference on Certified Programs and Proofs, pp 142-153, ACM Press, New York, 2016.
  116. 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.
  117. The Expressive Power of Monotonic Parallel Composition. Johannes Åman Pohjola and Joachim Parrow. In Programming Languages and Systems, volume 9632 of Lecture Notes in Computer Science, pp 780-803, Springer, Berlin, 2016.
  118. 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.

2015

  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. Well Structured Transition Systems with History. Parosh A. Abdulla, Giorgio Delzanno, and Marco Montali. In Electronic Proceedings in Theoretical Computer Science, number 193, pp 115-128, 2015.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. What's decidable about availability languages?. Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, and Mehdi Seyed Salehi. In Proc. 35th IARCS Conference on Foundation of Software Technology and Theoretical Computer Science, volume 45 of LIPIcs, pp 192-205, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015.
  11. 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.
  12. A step towards detecting online grooming: Identifying adults pretending to be children. Michael Ashcroft, Lisa Kaati, and Maxime Meyer. In Proc. 5th European Intelligence and Security Informatics Conference, pp 98-104, IEEE Computer Society, 2015.
  13. Are You Really a Child?: A Machine Learning Approach To Protect Children from Online Grooming. Michael Ashcroft, Lisa Kaati, and Maxime Meyer. In Proc. National Symposium on Technology and Methodology for Security and Crisis Management: TAMSEC 2015, 2015.
  14. Detecting jihadist messages on twitter. Michael Ashcroft, Ali Fisher, Lisa Kaati, Enghin Omer, and Nico Prucha. In Proc. 5th European Intelligence and Security Informatics Conference, pp 161-164, IEEE Computer Society, 2015.
  15. Efficient algorithms for bounded rigid <em>E</em>-unification. Peter Backeman and Philipp Rümmer. In Automated Reasoning with Analytic Tableaux and Related Methods, volume 9323 of Lecture Notes in Computer Science, pp 70-85, Springer, 2015.
  16. Free variables and theories: Revisiting rigid <em>E-</em>unification. Peter Backeman and Philipp Rümmer. In Frontiers of Combining Systems, volume 9322 of Lecture Notes in Computer Science, pp 3-13, Springer, 2015.
  17. Theorem proving with bounded rigid <em>E</em>-unification. Peter Backeman and Philipp Rümmer. In Automated Deduction – CADE-25, volume 9195 of Lecture Notes in Computer Science, pp 572-587, Springer, 2015.
  18. 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.
  19. 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.
  20. 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.
  21. 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.
  22. 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.
  23. An automatable formal semantics for IEEE-754 floating-point arithmetic. Martin Brain, Cesare Tinelli, Philipp Rümmer, and Thomas Wahl. In Proc. 22nd Symposium on Computer Arithmetic, Proceedings Symposium on Computer Arithmetic, pp 160-167, IEEE Computer Society, 2015.
  24. Disjointness Domains for Fine-Grained Aliasing. Stephan Brandauer, Dave Clarke, and Tobias Wrigstad. In , ACM SIGPLAN NOTICES, pp 989-916, 2015.
  25. Parallel Objects for Multicores: A Glimpse at the Parallel Language ENCORE. Stephan Brandauer, Elias Castegren, Dave Clarke, Kiko Fernandez-Reyes, Einar Broch Johnsen, Ka I. Pun, S. Lizeth Tapia Tarifa, Tobias Wrigstad, and Albert Mingkun Yang. In Formal Methods for Multicore Programming, volume 9104 of Lecture Notes in Computer Science, pp 1-56, 2015.
  26. Modelling and analysing a WSN secure aggregation protocol: A comparison of languages and tool support. Volkan Cambazoglu, Ramunas Gutkovas, Johannes Åman Pohjola, and Björn Victor. Technical report / Department of Information Technology, Uppsala University nr 2015-033, 2015.
  27. The Load Slice Core Microarchitecture. Trevor E. Carlson, Wim Heirman, Osman Allam, Stefanos Kaxiras, and Lieven Eeckhout. In 2015 ACM/IEEE 42Nd Annual International Symposium On Computer Architecture (ISCA), pp 272-284, 2015.
  28. A structured approach to training open-ended problem solving. Sofia Cassel and Björn Victor. In Proc. 45th ASEE/IEEE Frontiers in Education Conference, Frontiers in Education Conference, pp 417-420, IEEE Press, Piscataway, NJ, 2015.
  29. A succinct canonical register automaton model. Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, and Bernhard Steffen. In Journal of Logical and Algebraic Methods in Programming, volume 84, number 1, pp 54-66, 2015.
  30. Active Learning for Extended Finite State Machines. Sofia Cassel, Falk Howar, Bengt Jonsson, and Bernhard Steffen. Technical report / Department of Information Technology, Uppsala University nr 2015-032, 2015.
  31. 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.
  32. RALib: A LearnLib extension for inferring EFSMs. Sofia Cassel, Howar Falk, and Bengt Jonsson. In , 2015.
  33. 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.
  34. StatTask: Reuse distance analysis for task-based applications. Germán Ceballos, Erik Hagersten, and David Black-Schaffer. In Proc. 7th Workshop on Rapid Simulation and Performance Evaluation: Methods and Tools, pp 1-7, ACM Press, New York, 2015.
  35. The 2013 Evaluation of SMT-COMP and SMT-LIB. David R. Cok, Aaron Stump, and Tjark Weber. In Journal of automated reasoning, volume 55, number 1, pp 61-90, 2015.
  36. BioImg.org: A catalog of virtual machine images for the life sciences. Martin Dahlö, Frédéric Haziza, Aleksi Kallio, Eija Korpelainen, Erik Bongcam-Rudloff, and Ola Spjuth. In Bioinformatics and Biology Insights, volume 9, pp 125-128, 2015.
  37. An efficient, self-contained, on-chip directory: DIR<sub>1</sub>-SISD. Mahdad Davari, Alberto Ros, Erik Hagersten, and Stefanos Kaxiras. In Proc. 24th International Conference on Parallel Architectures and Compilation Techniques, pp 317-330, IEEE Computer Society, 2015.
  38. Effects of Granularity/Adaptivity on Private/Shared Classification for Coherence. Mahdad Davari, Alberto Ros, Erik Hagersten, and Stefanos Kaxiras. In , 2015.
  39. The effects of granularity and adaptivity on private/shared classification for coherence. Mahdad Davari, Alberto Ros, Erik Hagersten, and Stefanos Kaxiras. In ACM Transactions on Architecture and Code Optimization (TACO), volume 12, number 3, 2015.
  40. 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.
  41. 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.
  42. 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.
  43. 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.
  44. 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.
  45. Enabling design of performance-controlled sensor network applications through task allocation and reallocation. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson, and Konstantinos Sagonas. In Proc. 11th International Conference on Distributed Computing in Sensor Systems, pp 248-253, IEEE Computer Society, 2015.
  46. ProFuN TG: A Tool Using Abstract Task Graphs to Facilitate the Development, Deployment and Maintenance of Wireless Sensor Network Applications. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson, and Konstantinos Sagonas. In Proc. Poster/Demo Session: 12th European Conference on Wireless Sensor Networks, pp 19-20, 2015.
  47. ProFuN TG: A tool for programming and managing performance-aware sensor network applications. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson, and Konstantinos Sagonas. In IEEE 40th Local Computer Networks Conference Workshops (LCN Workshops), pp 751-759, IEEE Computer Society, 2015.
  48. ProFuN TG: Programming Sensornets with Task Graphs for Increased Reliability and Energy-Efficiency. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson, and Konstantinos Sagonas. In , IEEE Computer Society, 2015.
  49. Strong convergence for split-step methods in stochastic jump kinetics. Stefan Engblom. In SIAM Journal on Numerical Analysis, volume 53, pp 2655-2676, 2015.
  50. Automating regression verification. Dennis Felsing, Sarah Grebing, Vladimir Klebanov, Philipp Rümmer, and Mattias Ulbrich. In Software Engineering &amp; Management 2015, volume 239 of Lecture Notes in Informatics, pp 75-76, Gesellschaft für Informatik, Germany, 2015.
  51. Internet of Things and Future Threats Towards our Society. Torbjörn Fängström and Lisa Kaati. In Proc. National Symposium on Technology and Methodology for Security and Crisis Management: TAMSEC 2015, 2015.
  52. Concolic Testing for Functional Languages. Aggelos Giantsios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Proceedings of the 17th international symposium on principles and practice of declarative programming (PPDP 2015), pp 137-148, Association for Computing Machinery (ACM), 2015.
  53. Probabilistic programs as spreadsheet queries. Andrew D. Gordon, Claudio Russo, Marcin Szymczak, Johannes Borgström, Nicolas Rolland, Thore Graepel, and Daniel Tarlow. In Programming Languages and Systems, volume 9032 of Lecture Notes in Computer Science, pp 1-25, Springer Berlin/Heidelberg, 2015.
  54. Motivation and Grade Gap Related to Gender in a Programming Course. Virginia Grande and Joachim Parrow. In , 2015.
  55. Data structures and algorithms for high-dimensional structured adaptive mesh refinement. Magnus Grandin. In Advances in Engineering Software, volume 82, pp 75-86, 2015.
  56. Bounding carry-in interference to improve fixed-priority global multiprocessor scheduling analysis. Nan Guan, Meiling Han, Chuancai Gu, Qingxu Deng, and Wang Yi. In Proc. 21st International Conference on Embedded and Real-Time Computing Systems and Applications, pp 11-20, IEEE Computer Society, 2015.
  57. Delay analysis of structural real-time workload. Nan Guan, Yue Tang, Yang Wang, and Wang Yi. In Proc. 18th Conference on Design, Automation and Test in Europe, pp 223-228, IEEE, Piscataway, NJ, 2015.
  58. Modular performance analysis of energy-harvesting real-time networked systems. Nan Guan, Mengying Zhao, Chun Jason Xue, Yongpan Liu, and Wang Yi. In Proc. 36th Real-Time Systems Symposium, pp 65-74, IEEE Computer Society, 2015.
  59. 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.
  60. 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.
  61. Handover for a portable communication device between local and wide area wireless networks. Pekka Hedqvist, Per Gunningberg, Mattias Hansson, Esbjörn Köhler, and Jonne Kodu. 2015.
  62. Mediator synthesis in a component algebra with data. Lukás Holik, Malte Isberner, and Bengt Jonsson. In Correct System Design, volume 9360 of Lecture Notes in Computer Science, pp 238-259, Springer, 2015.
  63. Parametric and nonparametric analysis of eye-tracking data by anomaly detection. Daniel Jansson, Olov Rosén, and Alexander Medvedev. In IEEE Transactions on Control Systems Technology, volume 23, number 4, pp 1578-1586, 2015.
  64. Analyzing multimode wireless sensor networks using the network calculus. Xi Jin, Nan Guan, Jintao Wang, and Peng Zeng. In Journal of Sensors, volume 2015, pp 851608:1-12, 2015.
  65. Timeprints for identifying social media users with multiple aliases. Fredrik Johansson, Lisa Kaati, and Amendra Shrestha. In Security Informatics, volume 4, pp 7:1-11, 2015.
  66. Detecting multipliers of jihadism on twitter. Lisa Kaati, Enghin Omer, Nico Prucha, and Amendra Shrestha. In Proc. 15th ICDM Workshops, pp 954-960, IEEE Computer Society, 2015.
  67. AREP: Adaptive Resource Efficient Prefetching for Maximizing Multicore Performance. Muneeb Khan, Michael A. Laurenzano, Jason Mars, Erik Hagersten, and David Black-Schaffer. In Proc. 24th International Conference on Parallel Architectures and Compilation Techniques, pp 367-378, IEEE Computer Society, 2015.
  68. Perf-Insight: A Simple, Scalable Approach to Optimal Data Prefetching in Multicores. Muneeb Khan, David Black-Schaffer, and Erik Hagersten. Technical report / Department of Information Technology, Uppsala University nr 2015-037, 2015.
  69. Noninvasive and continuous blood pressure monitoring using wearable body sensor networks. Hao Lin, Wenyao Xu, Nan Guan, Dong Ji, Yangjie Wei, and Wang Yi. In IEEE Intelligent Systems, volume 30, number 6, pp 38-48, 2015.
  70. Property-Based Testing of Sensor Networks. Andreas Löscher, Konstantinos Sagonas, and Thiemo Voigt. In Proc. 12th International Conference on Sensing, Communication, and Networking, pp 100-108, IEEE Communications Society, 2015.
  71. Bixie: Finding and understanding inconsistent code. Tim McCarthy, Philipp Rümmer, and Martin Schäf. In Proc. 37th IEEE/ACM International Conference on Software Engineering, pp 645-648, IEEE, Piscataway, NJ, 2015.
  72. 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.
  73. Stable difference methods for block-oriented adaptive grids. Anna Nissen, Katharina Kormann, Magnus Grandin, and Kristoffer Virta. In Journal of Scientific Computing, volume 65, pp 486-511, 2015.
  74. 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.
  75. Forecasting Lock Contention Before Adopting Another Lock Algorithm. Xiaoyue Pan, David Klaftenegger, and Bengt Jonsson. 2015.
  76. 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.
  77. 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.
  78. Callback: Efficient Synchronization without Invalidation with a Directory Just for Spin-Waiting. Alberto Ros and Stefanos Kaxiras. In 2015 ACM/IEEE 42Nd Annual International Symposium On Computer Architecture (ISCA), pp 427-438, 2015.
  79. Hierarchical private/shared classification: The key to simple and efficient coherence for clustered cache hierarchies. Alberto Ros, Mahdad Davari, and Stefanos Kaxiras. In Proc. 21st International Symposium on High Performance Computer Architecture, pp 186-197, IEEE Computer Society Digital Library, 2015.
  80. Parallel Stochastic Estimation on Multicore Platforms. Olov Rosén. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 111, Acta Universitatis Upsaliensis, Uppsala, 2015.
  81. Parallel recursive estimation using Monte Carlo and orthogonal series expansions. Olov Rosén and Alexander Medvedev. In Proc. American Control Conference: ACC 2015, pp 3905-3910, American Automatic Control Council, 2015.
  82. 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.
  83. A radial basis function partition of unity collocation method for convection–diffusion equations arising in financial applications. Ali Safdari-Vaighani, Alfa Heryudono, and Elisabeth Larsson. In Journal of Scientific Computing, volume 64, pp 341-367, 2015.
  84. 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.
  85. 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.
  86. Conflict-Directed Graph Coverage. Daniel Schwartz-Narbonne, Martin Schaef, Dejan Jovanovic, Philipp Rümmer, and Thomas Wies. In NASA FORMAL METHODS (NFM 2015), volume 9058 of Lecture Notes in Computer Science, pp 327-342, 2015.
  87. 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.
  88. Radial basis function partition of unity methods for pricing vanilla basket options. Victor Shcherbakov and Elisabeth Larsson. Technical report / Department of Information Technology, Uppsala University nr 2015-001, 2015.
  89. Combinatorial abstraction refinement for feasibility analysis of static priorities. Martin Stigge and Wang Yi. In Real-time systems, volume 51, number 6, pp 639-674, 2015.
  90. Graph-based models for real-time workload: a survey. Martin Stigge and Wang Yi. In Real-time systems, volume 51, number 5, pp 602-636, 2015.
  91. 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.
  92. 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.
  93. 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.
  94. Scaling predictive modeling in drug development with cloud computing. Behrooz Torabi Moghadam, Jonathan Alvarsson, Marcus Holm, Martin Eklund, Lars Carlsson, and Ola Spjuth. In Journal of Chemical Information and Modeling, volume 55, pp 19-25, 2015.
  95. 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.
  96. Micro-Architecture Independent Analytical Processor Performance and Power Modeling. Sam Van den Steen, Sander De Pestel, Moncef Mechri, Stijn Eyerman, Trevor Carlson, David Black-Schaffer, Erik Hagersten, and Lieven Eeckhout. In 2015 IEEE International Symposium on Performance Analysis and Software (ISPASS), IEEE International Symposium on Performance Analysis of Systems and Software-ISPASS, pp 32-41, 2015.
  97. The automatic detection and analysis of electrocardiogram based on Lorenz plot. Wenqi Wang, Yangjie Wei, Nan Guan, and Wang Yi. In Proc. 12th International Conference on Robotics and Biomimetics, pp 644-649, IEEE, Piscataway, NJ, 2015.
  98. Diffusion-based three-dimensional reconstruction of complex surface using monocular vision. Yangjie Wei, Chengdong Wu, Wang Yi, and Wenxue Wang. In Optics Express, volume 23, number 23, pp 30364-30378, 2015.
  99. Efficient shape reconstruction of microlens using optical microscopy. Yangjie Wei, Chengdong Wu, Wang Yi, and Zaili Dong. In IEEE Transactions on Industrial Electronics, volume 62, number 12, pp 7655-7664, 2015.
  100. BENCHOP—The BENCHmarking project in Option Pricing. Lina von Sydow, Lars Josef Höök, Elisabeth Larsson, Erik Lindström, Slobodan Milovanovi?, Jonas Persson, Victor Shcherbakov, Yuri Shpolyanskiy, Samuel Sirén, Jari Toivanen, Johan Waldén, Magnus Wiktorsson, Jeremy Levesley, Juxi Li, Cornelis W. Oosterlee, Maria J. Ruijter, Alexander Toropov, and Yangzhang Zhao. In International Journal of Computer Mathematics, volume 92, pp 2361-2379, 2015.
  101. 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.

2014

  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. Mediating for reduction (on minimizing alternating Buchi automata). Parosh Aziz Abdulla, Yu-Fang Chen, Lukag Holik, and Tomas Vojnar. In Theoretical Computer Science, volume 552, pp 26-43, 2014.
  7. Stochastic Parity Games on Lossy Channel Systems. Parosh Aziz Abdulla, Lorenzo Clemente, Richard Mayr, and Sven Sandberg. In Logical Methods in Computer Science, volume 10, number 4, 2014.
  8. 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.
  9. 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.
  10. 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.
  11. 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.
  12. Programming and automating mathematics in the Tarski-Kleene hierarchy. Alasdair Armstrong, Georg Struth, and Tjark Weber. In Journal of Logical and Algebraic Methods in Programming, volume 83, number 2, pp 87-102, 2014.
  13. Activity profiles in online social media. Mohamed Faouzi Atig, Sofia Cassel, Lisa Kaati, and Amendra Shrestha. In Proc. 6th International Conference on Advances in Social Networks Analysis and Mining, pp 850-855, IEEE Computer Society, 2014.
  14. Adjacent Ordered Multi-Pushdown Systems. Mohamed Faouzi Atig, K. Narayan Kumar, and Prakash Shivasan. In International Journal of Foundations of Computer Science, volume 25, number 8, pp 1083-1096, 2014.
  15. 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.
  16. 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.
  17. 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.
  18. Resilience and Opportunistic Forwarding: Beyond Average Value Analysis. Fredrik Bjurefors, Markourios Karaliopoulos, Christian Rohner, Paul Smith, George Theodoropoulos, and Per Gunningberg. In Computer Communications, volume 48, number SI, pp 111-120, 2014.
  19. 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.
  20. Proc. Combined 21st International Workshop on Expressiveness in Concurrency (EXPRESS 2014) and 11th Workshop on Structural Operational Semantics (SOS 2014). Johannes Borgström and Silvia Crafa (eds). Volume 160 of Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2014.
  21. Enhanced learning by promoting engineering competencies. Sofia Cassel, Aletta Nylén, and Björn Victor. In Proc. 44th ASEE/IEEE Frontiers in Education Conference, pp 2044-2049, IEEE Press, Piscataway, NJ, 2014.
  22. 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.
  23. Managing power constraints in a single-core scenario through power tokens. Juan M. Cebrian, Daniel Sanchez, Juan L. Aragon, and Stefanos Kaxiras. In Journal of Supercomputing, volume 68, number 1, pp 414-442, 2014.
  24. An algebraic theory of interface automata. Chris Chilton, Bengt Jonsson, and Marta Kwiatkowska. In Theoretical Computer Science, volume 549, pp 146-174, 2014.
  25. 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.
  26. The Effects of Granularity and Adaptivity on Private/Shared Classification for Coherence. Mahdad Davari, Alberto Ros, Erik Hagersten, and Stefanos Kaxiras. In , 2014.
  27. 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.
  28. 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.
  29. 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.
  30. 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.
  31. 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.
  32. On the stability of stochastic jump kinetics. Stefan Engblom. In Applied Mathematics, volume 5, pp 3217-3239, 2014.
  33. 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.
  34. How do the dynamics of battery discharge affect sensor lifetime?. Laura Marie Feeney, Christian Rohner, Per Gunningberg, Anders Lindgren, and Lars Andersson. In 2014 11th Annual Conference on Wireless On-demand Network Systems and Services (WONS), pp 49-56, IEEE, Piscataway, NJ, 2014.
  35. 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.
  36. Dynamic budgeting for settling DRAM contention of co-running hard and soft real-time tasks. Jonas Flodin, Kai Lampka, and Wang Yi. In Proc. 9th International Symposium on Industrial Embedded Systems, pp 151-159, IEEE, Piscataway, NJ, 2014.
  37. Static safety guarantees for a low-level multithreaded language with regions. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Science of Computer Programming, volume 80, number Part B, pp 223-263, 2014.
  38. Tabular: a schema-driven probabilistic programming language. Andrew D. Gordon, Thore Graepel, Nicolas Rolland, Claudio Russo, Johannes Borgström, and John Guiver. In Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volume 49:1 of ACM SIGPLAN NOTICES, pp 321-334, ACM Press, New York, 2014.
  39. 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.
  40. Data structures and algorithms for high-dimensional structured adaptive mesh refinement. Magnus Grandin. Technical report / Department of Information Technology, Uppsala University nr 2014-019, 2014.
  41. 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.
  42. 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.
  43. 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.
  44. WCET Analysis with MRU Cache: Challenging LRU for Predictability. Nan Guan, Mingsong Lv, Wang Yi, and Ge Yu. In ACM Transactions on Embedded Computing Systems, volume 13, number 4s, 2014.
  45. 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.
  46. A constraint programming approach for managing end-to-end requirements in sensor network macroprogramming. Farshid Hassani Bijarbooneh, Animesh Pathak, Justin Pearson, Valérie Issarny, and Bengt Jonsson. In Proc. 3rd International Conference on Sensor Networks, pp 28-40, SciTePress, Setúbal, Portugal, 2014.
  47. All is not lost: Understanding and exploiting packet corruption in outdoor sensor networks. Frederik Hermans, Hjalmar Wennerström, Liam McNamara, Christian Rohner, and Per Gunningberg. In Wireless Sensor Networks: EWSN 2014, volume 8354 of Lecture Notes in Computer Science, pp 116-132, Springer Berlin/Heidelberg, 2014.
  48. Supporting Heterogeneous LCD/Camera Links. Frederik Hermans, Liam McNamara, Thiemo Voigt, Christian Rohner, Edith Ngai, and Per Gunningberg. In Proc. 13th International Symposium on Information Processing in Sensor Networks, pp 289-290, IEEE Press, Piscataway, NJ, 2014.
  49. 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.
  50. 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.
  51. 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.
  52. Performance isolation for real-time systems with Xen hypervisor on multi-cores. Wei Jing, Nan Guan, and Wang Yi. In Proc. 20th International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE, Piscataway, NJ, 2014.
  53. Time profiles for identifying users in online environments. Fredrik Johansson, Lisa Kaati, and Amendra Shrestha. In Proc. 1st Joint Intelligence and Security Informatics Conference, pp 83-90, IEEE Computer Society, 2014.
  54. Analysis and mining of tags, (micro)blogs, and virtual communities. Lisa Kaati. In Encyclopedia of Social Network Analysis and Mining, pp 19-25, Springer, 2014.
  55. 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.
  56. A case for resource efficient prefetching in multicores. Muneeb Khan, Andreas Sandberg, and Erik Hagersten. In Proc. 43rd International Conference on Parallel Processing, pp 101-110, IEEE Computer Society, 2014.
  57. 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.
  58. 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.
  59. 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.
  60. Session types for broadcasting. Dimitrios Kouzapas, Ramunas Gutkovas, and Simon J. Gay. In Proc. 7th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, volume 155 of Electronic Proceedings in Theoretical Computer Science, pp 25-31, 2014.
  61. Impact of code refactoring using object-oriented methodology on a scientific computing application. Malin Källén, Sverker Holmgren, and Ebba þóra Hvannberg. In Proc. 14th International Working Conference on Source Code Analysis and Manipulation, pp 125-134, IEEE Computer Society, Los Alamitos, CA, 2014.
  62. 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.
  63. Quality-of-information-aware data collection for mobile sensor networks. Edith C.-H. Ngai and Per Gunningberg. In Pervasive and Mobile Computing, volume 11, pp 203-215, 2014.
  64. 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.
  65. Haggle: Opportunistic mobile content sharing using search. Erik Nordström, Christian Rohner, and Per Gunningberg. In Computer Communications, volume 48, pp 121-132, 2014.
  66. 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.
  67. 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.
  68. Nonlinear estimation of a parsimonious Wiener model for the neuromuscular blockade in closed-loop anesthesia. Olov Rosén, Margarida Martins da Silva, and Alexander Medvedev. In Proc. 19th IFAC World Congress, pp 9258-9264, International Federation of Automatic Control, 2014.
  69. Parallel recursive Bayesian estimation on multicore computational platforms using orthogonal basis functions. Olov Rosén and Alexander Medvedev. In Proc. American Control Conference: ACC 2014, pp 622-627, American Automatic Control Council, 2014.
  70. 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.
  71. 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.
  72. 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.
  73. 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.
  74. A tunable cache for approximate computing. Magnus Själander, Nina Shariati Nilsson, and Stefanos Kaxiras. In Proc. 10th International Symposium on Nanoscale Architectures, IEEE International Symposium on Nanoscale Architectures, pp 88-89, IEEE, Piscataway, NJ, 2014.
  75. Power-Efficient Computer Architectures: Recent Advances. Magnus Själander, Margaret Martonosi, and Stefanos Kaxiras. Morgan & Claypool Publishers, 2014.
  76. 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.
  77. Refinement-based Exact Response-Time Analysis. Martin Stigge, Nan Guan, and Wang Yi. In 2014 26TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS (ECRTS 2014), Euromicro Workshop on Real-Time Systems-Proceedings, pp 143-152, 2014.
  78. Service guarantee exploration for mixed-criticality systems. Hang Su, Nan Guan, and Dakai Zhu. In Proc. 20th International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE, Piscataway, NJ, 2014.
  79. Improving the response time analysis of global fixed-priority multiprocessor scheduling. Youcheng Sun, Giuseppe Lipari, Nan Guan, and Wang Yi. In Proc. 20th International Conference on Embedded and Real-Time Computing Systems and Applications, IEEE, Piscataway, NJ, 2014.
  80. 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.
  81. 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.
  82. 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.
  83. 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.
  84. Understanding the Dynamic Caches on Intel Processors: Methods and Applications. Yi Zhang, Nan Guan, and Wang Yi. In 2014 12th IEEE International Conference on Embedded and Ubiquitous Computing, pp 58-64, 2014.
  85. Scaling Future Software: The Manycore Challenge. Frank de Boer, Einar Broch Johnsen, Dave Clarke, Sophia Drossopoulou, Nobuko Yoshida, and Tobias Wrigstad. 2014.
  86. Priorities Without Priorities: Representing Preemption in Psi-Calculi. Johannes Åman Pohjola and Joachim Parrow. In Proc. 21st International Workshop on Expressiveness in Concurrency, and 11th Workshop on Structural Operational Semantics, volume 160 of Electronic Proceedings in Theoretical Computer Science, pp 2-15, 2014.

2013

  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. Verification of Directed Acyclic Ad Hoc Networks. Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Othmane Rezine. In Formal Techniques for Distributed Systems: FORTE 2013, volume 7892 of Lecture Notes in Computer Science, pp 193-208, Springer Berlin/Heidelberg, 2013.
  12. 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.
  13. Scientific analysis by queries in extended SPARQL over a scalable e-Science data store. Andrej Andrejev, Salman Toor, Andreas Hellander, Sverker Holmgren, and Tore Risch. In Proc. 9th International Conference on e-Science, pp 98-106, IEEE Computer Society, Los Alamitos, CA, 2013.
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. Deriving Probability Density Functions from Probabilistic Functional Programs. Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, and Claudio Russo. In Tools and Algorithms for the Construction and Analysis of Systems: 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, volume 7795 of Lecture Notes in Computer Science, pp 508-522, Springer Berlin/Heidelberg, Berlin/Heidelberg, 2013.
  19. Flexible and High-Speed System-Level Performance Analysis using Hardware-Accelerated Simulation. Sascha Bischoff, Andreas Sandberg, Andreas Hansson, Sunwoo Dam, Ali Saidi, Matthew Horsnell, and Bashir Al-Hashimi. In , Design, Automation & Test in Europe (DATE), Grenoble, France, 2013.
  20. Resilience and Opportunistic Forwarding: Beyond Average Value Analysis. Fredrik Bjurefors, Merkourios Karaliopoulos, Christian Rohner, Paul Smith, George Theodoropoulos, and Per Gunningberg. In CHANTS '13 Proceedings of the 8th ACM MobiCom workshop on Challenged networks, 2013.
  21. 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.
  22. Measure transformer semantics for Bayesian machine learning. Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson, and Jurgen van Gael. In Logical Methods in Computer Science, volume 9, number 3, p 11, 2013.
  23. Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics. Johannes Borgström and Bas Luttik (eds). Volume 120 of Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2013.
  24. 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.
  25. Computer science students’ perception of computer network security. Volkan Cambazoglu and Neena Thota. In Proc. 1st International Conference on Learning and Teaching in Computing and Engineering, pp 204-207, IEEE Computer Society, Los Alamitos, CA, 2013.
  26. Towards adaptive zero-knowledge protocols: A case study with Fiat–Shamir identification protocol. Volkan Cambazoglu and Christian Rohner. In Proc. 9th Swedish National Computer Networking Workshop, pp 67-70, 2013.
  27. Fördjupat lärande genom aktiverande examination. Sofia Cassel and Björn Victor. In 4:e Utvecklingskonferensen för Sveriges ingenjörsutbildningar, pp 51-54, 2013.
  28. 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.
  29. Efficient inter-core power and thermal balancing for multicore processors. Juan M. Cebrian, Daniel Sanchez, Juan L. Aragon, and Stefanos Kaxiras. In Computing, volume 95, number 7, pp 537-566, 2013.
  30. Assume-guarantee reasoning for safe component behaviours. C. Chilton, Bengt Jonsson, and M. Kwiatkowska. In Formal Aspects of Component Software: 9th International Symposium, FACS 2012, Mountain View, CA, USA, September 12-14, 2012. Revised Selected Papers, volume 7684 LNCS of Lecture Notes in Computer Science, pp 92-109, 2013.
  31. An Algebraic Theory of Interface Automata. Chris Chilton, Bengt Jonsson, and Marta Kwiatkowska. University of Oxford, 2013.
  32. 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.
  33. 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.
  34. Beyond the Geneva Convention on the Treatment of Object Aliasing. Dave Clarke, James Noble, and Tobias Wrigstad. In Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volume 7850 of Lecture Notes in Computer Science, pp 1-6, Springer Berlin/Heidelberg, 2013.
  35. 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.
  36. Ranking function synthesis for bit-vector relations. Byron Cook, Daniel Kroening, Philipp Rümmer, and Christoph M. Wintersteiger. In Formal methods in system design, volume 43, number 1, pp 93-120, 2013.
  37. System and method for data classification and efficient virtual cache coherence without reverse translation. Mahdad Davari, Alberto Ros, and Stefanos Kaxiras. 2013.
  38. The well-posedness of diffuse interface modeling of surfactants in two-phase fluid flow. Minh Do-Quang, Stefan Engblom, Anna-Karin Tornberg, and Gustav Amberg. In Wetting and Evaporation: Droplets of Pure and Complex Fluids, pp 80-81, Aix-Marseille Université, France, 2013.
  39. 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.
  40. On diffuse interface modeling and simulation of surfactants in two-phase fluid flow. Stefan Engblom, Minh Do-Quang, Gustav Amberg, and Anna-Karin Tornberg. In Communications in Computational Physics, volume 14, pp 879-915, 2013.
  41. 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.
  42. Adaptive fast multipole methods on the GPU. Anders Goude and Stefan Engblom. In Journal of Supercomputing, volume 63, pp 897-918, 2013.
  43. 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.
  44. 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.
  45. 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.
  46. 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.
  47. 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.
  48. SoNIC: Classifying interference in 802.15.4 sensor networks. Frederik Hermans, Olof Rensfelt, Thiemo Voigt, Edith Ngai, Lars-Åke Nordén, and Per Gunningberg. In Proc. 12th International Conference on Information Processing in Sensor Networks, pp 55-66, ACM Press, New York, 2013.
  49. Scientific computing on hybrid architectures. Marcus Holm. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2013-002, Uppsala University, 2013.
  50. Skitracker: Measuring skiing performance using a body-area network. Thomas Homewood, Christer Norström, and Per Gunningberg. In Proc. 12th International Conference on Information Processing in Sensor Networks, pp 319-320, ACM Press, New York, 2013.
  51. Non-parametric analysis of eye-tracking data by anomaly detection. Daniel Jansson, Olov Rosén, and Alexander Medvedev. In Proc. 12th European Control Conference, pp 632-637, IEEE, 2013.
  52. Detecting multiple aliases in social media. Fredrik Johansson, Lisa Kaati, and Amendra Shrestha. In Proc. 5th International Conference on Advances in Social Networks Analysis and Mining, pp 1004-1011, ACM Press, New York, 2013.
  53. 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.
  54. 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.
  55. A Galerkin radial basis function method for the Schrödinger equation. Katharina Kormann and Elisabeth Larsson. In SIAM Journal on Scientific Computing, volume 35, pp A2832-A2855, 2013.
  56. Towards Power Efficiency on Task-Based, Decoupled Access-Execute Models. Konstantinos Koukos, David Black-Schaffer, Vasileios Spiliopoulos, and Stefanos Kaxiras. In PARMA 2013, 4th Workshop on Parallel Programming and Run-Time Management Techniques for Many-core Architectures, 2013.
  57. 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.
  58. Gender-aware course reform in Scientific Computing. Elisabeth Larsson, Stefan Pålsson, Jarmo Rantakokko, Lina von Sydow, and Michael Thuné. In International journal of engineering education, volume 29, number 2, pp 403-414, 2013.
  59. Radial basis function methods in computational finance. Elisabeth Larsson, Sônia M. Gomes, Alfa Heryudono, and Ali Safdari-Vaighani. In Proc. 13th International Conference on Computational and Mathematical Methods in Science and Engineering: Volume III, pp 895-906, Universidad de Almería, Spain, 2013.
  60. Skors skönhet ur en matematikers perspektiv. Elisabeth Larsson. In Skor är huvudsaken: Sjutton kvinnliga forskares funderingar om skor, pp 30-31, Uppsala universitet, 2013.
  61. Stable computation of differentiation matrices and scattered node stencils based on Gaussian radial basis functions. Elisabeth Larsson, Erik Lehto, Alfa Heryudono, and Bengt Fornberg. In SIAM Journal on Scientific Computing, volume 35, pp A2096-A2119, 2013.
  62. Preface: e-Science Applications and Tools. Erwin Laure and Sverker Holmgren. In Future generations computer systems, volume 29, number 8, pp 2115-2116, 2013.
  63. 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.
  64. 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.
  65. Stable and accurate wave simulations in complex geometries and discontinuous media. Ken Mattsson, Martin Almquist, and Stefan Engblom. In Proc. 11th International Conference on Mathematical and Numerical Aspects of Waves, pp 201-202, ENIT, Tunisia, 2013.
  66. MAPfastR: Quantitative trait loci mapping in outbred line crosses. Ronald M. Nelson, Carl Nettelblad, Mats E. Pettersson, Xia Shen, Lucy Crooks, François Besnier, José Álvarez-Castro, Lars Rönnegård, Weronica Ek, Zheya Sheng, Marcin Kierczak, Sverker Holmgren, and Örjan Carlborg. In G3: Genes, Genomes, Genetics, volume 3, pp 2147-2149, 2013.
  67. Fast and accurate detection of multiple quantitative trait loci. Carl Nettelblad, Behrang Mahjani, and Sverker Holmgren. In Journal of Computational Biology, volume 20, pp 687-702, 2013.
  68. Evaluating Battery Models in Wireless Sensor Networks. Christian Rohner, Laura Marie Feeney, and Per Gunningberg. In Wired/Wireless Internet Communication, volume 7889 of Lecture Notes in Computer Science, pp 29-42, Springer Berlin/Heidelberg, 2013.
  69. Efficient parallel implementation of state estimation algorithms on multicore platforms. Olov Rosén and Alexander Medvedev. In IEEE Transactions on Control Systems Technology, volume 21, number 1, pp 107-120, 2013.
  70. Non-parametric anomaly detection in trajectorial data. Olov Rosén, Alexander Medvedev, and Daniel Jansson. 2013.
  71. Parallelization of stochastic estimation algorithms on multicore computational platforms. Olov Rosén. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2013-001, Uppsala University, 2013.
  72. Parallelization of the Kalman filter on multicore computational platforms. Olov Rosén, Alexander Medvedev, and Torbjörn Wigren. In Control Engineering Practice, volume 21, number 9, pp 1188-1194, 2013.
  73. 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.
  74. 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.
  75. Exploring Interpolants. Philipp Rümmer and Pavle Subotic. In Formal Methods in Computer-Aided Design (FMCAD), 2013.
  76. A radial basis function partition of unity collocation method for convection-diffusion equations. Ali Safdari-Vaighani, Alfa Heryudono, and Elisabeth Larsson. Technical report / Department of Information Technology, Uppsala University nr 2013-023, 2013.
  77. 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.
  78. 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.
  79. 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.
  80. Author recognition in discussion boards. Amendra Shrestha, Lisa Kaati, Sofia Cassel, and Mohamed Faouzi Atig. In National Symposium on Technology and Methodology for Security and Crisis Management, 2013.
  81. 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.
  82. Combinatorial Abstraction Refinement for Feasibility Analysis. Martin Stigge and Wang Yi. In IEEE 34TH REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2013), Real-Time Systems Symposium-Proceedings, pp 340-349, 2013.
  83. 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.
  84. 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.
  85. 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.
  86. 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.
  87. 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.
  88. 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.
  89. 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.
  90. Negative premises in applied process calculi. Johannes Åman Pohjola, Johannes Borgström, Joachim Parrow, Palle Raabjerg, and Ioana Rodhe. Technical report / Department of Information Technology, Uppsala University nr 2013-014, 2013.

2012

  1. Regular model checking for LTL(MSO). Parosh Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, and Mayank Saksena. In International Journal on Software Tools for Technology Transfer, 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. Model-Checking of Ordered Multi-Pushdown Automata. Mohamed Faouzi Atig. In Logical Methods in Computer Science, volume 8, number 3, p 20, 2012.
  15. 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.
  16. A social node model for realising information dissemination strategies in delay tolerant networks. Saeed Bastani, Björn Landfeldt, Christian Rohner, and Per Gunningberg. In Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems, pp 79-88, ACM Press, New york, 2012.
  17. Professionella kompetenser i projektkurser. Åsa Cajander, Mats Daniels, Helena Bernáld, and Björn Victor. In Proc. 3:e Utvecklingskonferensen för Sveriges ingenjörsutbildningar, volume 75 of Linköping Electronic Conference Proceedings, pp 123-128, Linköping University Electronic Press, 2012.
  18. The impact of trace and adversary models on location privacy provided by K-anonymity. Volkan Cambazoglu, Christian Rohner, and Björn Victor. In Proc. 1st Workshop on Measurement, Privacy, and Mobility, ACM Press, New York, 2012.
  19. 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.
  20. A Compositional Specification Theory for Component Behaviours. Taolue Chen, Chris Chilton, Bengt Jonsson, and Marta Kwiatkowska. In Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012,, Lecture Notes in Computer Science, pp 148-168, 2012.
  21. A Compositional Specification Theory for Component Behaviours. Taolue Chen, Chris Chilton, Bengt Jonsson, and Marta Kwiatkowska. 2012.
  22. 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.
  23. 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.
  24. 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.
  25. A Profiling Method for Analyzing Scalability Bottlenecks on Multicores. David Eklöv. 2012.
  26. Bandwidth bandit: Quantitative characterization of memory contention. David Eklöv, Nikkos Nikoleris, David Black-Schaffer, and Erik Hägersten. In Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT, pp 457-458, 2012.
  27. 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.
  28. Quantitative Characterization of Memory Contention. David Eklöv, Nikos Nikoleris, David Black-Schaffer, and Erik Hägersten. Technical report / Department of Information Technology, Uppsala University nr 2012-029, Uppsala universitet, Uppsala, 2012.
  29. On the stability of stochastic jump kinetics. Stefan Engblom. Technical report / Department of Information Technology, Uppsala University nr 2012-005, 2012.
  30. Adaptive fast multipole methods on the GPU. Anders Goude and Stefan Engblom. Technical report / Department of Information Technology, Uppsala University nr 2012-012, 2012.
  31. 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.
  32. 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.
  33. 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.
  34. 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.
  35. Numerical evaluation of the Communication-Avoiding Lanczos algorithm. Magnus Gustafsson, James Demmel, and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2012-001, 2012.
  36. 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.
  37. 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.
  38. A Lightweight Approach to Online Detection and Classification of Interference in 802.15.4-based Sensor Networks. Frederik Hermans, Olof Rensfelt, Lars-Åke Larzon, and Per Gunningberg. In ACM SIGBED Review, volume 9, number 3, pp 11-20, 2012.
  39. Global Source Mobility in the Content-Centric Networking Architecture. Frederik Hermans, Edith Ngai, and Per Gunningberg. In Proc. 1st ACM Workshop on Emerging Name-Oriented Mobile Networking Design: Architecture, Algorithms, and Applications, pp 13-18, ACM Press, New York, 2012.
  40. 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.
  41. 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.
  42. 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.
  43. 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.
  44. 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.
  45. 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.
  46. Using refinement calculus techniques to prove linearizability. Bengt Jonsson. In Formal Aspects of Computing, volume 24, number 4-6, pp 537-554, 2012.
  47. 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.
  48. An adaptive pseudospectral method for wave packet dynamics. Emil Kieri, Sverker Holmgren, and Hans O. Karlsson. In Journal of Chemical Physics, volume 137, pp 044111:1-12, 2012.
  49. An RBF–Galerkin approach to the time-dependent Schrödinger equation. Katharina Kormann and Elisabeth Larsson. Technical report / Department of Information Technology, Uppsala University nr 2012-024, 2012.
  50. Stable computation of differentiation matrices and scattered node stencils based on Gaussian radial basis functions. Elisabeth Larsson, Erik Lehto, Alfa Heryudono, and Bengt Fornberg. Technical report / Department of Information Technology, Uppsala University nr 2012-020, 2012.
  51. 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.
  52. Quality-of-Information aware data collection for mobile sensor networks. Edith C.-H. Ngai and Per Gunningberg. In Proc. 10th International Conference on Pervasive Computing and Communications Workshops, pp 38-43, IEEE Communications Society, 2012.
  53. 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.
  54. On preserving term sharing in the Erlang virtual machine. Nikolaos Papaspyrou and Konstantinos Sagonas. In Proc. 11th ACM SIGPLAN Workshop on Erlang, pp 11-20, ACM Press, New York, 2012.
  55. 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.
  56. SoNIC: Classifying and Surviving Interference in 802.15.4-based Sensor Networks. Olof Rensfelt, Frederik Hermans, Thiemo Voigt, Edith Ngai, Lars-Åke Nordén, and Per Gunningberg. Technical report / Department of Information Technology, Uppsala University nr 2012-022, 2012.
  57. Making the Most of Your Contacts: Transfer Ordering in Data-Centric Opportunistic Networks. Christian Rohner, Fredrik Bjurefors, Per Gunningberg, Liam McNamara, and Erik Nordström. In Proceedings of the 2012 ACM MobiOpp Workshop on Mobile Opportunistic Networks, ACM Press, Zürich, 2012.
  58. 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.
  59. An on-line algorithm for anomaly detection in trajectory data. Olov Rosén and Alexander Medvedev. In Proc. American Control Conference: ACC 2012, pp 1117-1122, American Automatic Control Council, 2012.
  60. Parallelization of the Kalman filter for banded systems on multicore computational platforms. Olov Rosén and Alexander Medvedev. In Proc. 51st Conference on Decision and Control, pp 2022-2027, IEEE, Piscataway, NJ, 2012.
  61. 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.
  62. ErLLVM: An LLVM backend for Erlang. Konstantinos Sagonas, Chris Stavrakakis, and Yiannis Tsiouris. In Proc. 11th ACM SIGPLAN Workshop on Erlang, pp 21-32, ACM Press, New York, 2012.
  63. 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.
  64. 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.
  65. 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.
  66. 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.
  67. 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.
  68. Hardness Results for Static Priority Real-Time Scheduling. Martin Stigge and Wang Yi. In Proceedings Of The 24th Euromicro Conference On Real-Time Systems (Ecrts 2012), Euromicro Workshop on Real-Time Systems-Proceedings, pp 189-198, 2012.
  69. 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.
  70. Investigating an open source cloud storage infrastructure for CERN-specific data analysis. Salman Toor, Rainer Töebbicke, Maitane Zotes Resines, and Sverker Holmgren. In Proc. 7th International Conference on Networking, Architecture, and Storage, pp 84-88, IEEE Computer Society, Los Alamitos, CA, 2012.
  71. 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.
  72. 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.
  73. Abstractions for scaling eScience applications to distributed computing environments: A StratUm integration case study in molecular systems biology. Per-Olov Östberg, Andreas Hellander, Brian Drawert, Erik Elmroth, Sverker Holmgren, and Linda Petzold. In Proc. 3rd International Conference on Bioinformatics Models, Methods and Algorithms, pp 290-294, SciTePress, Setúbal, Portugal, 2012.
  74. Reducing complexity in management of eScience computations. Per-Olov Östberg, Andreas Hellander, Brian Drawert, Erik Elmroth, Sverker Holmgren, and Linda Petzold. In Proc. 12th International Symposium on Cluster, Cloud and Grid Computing, pp 845-852, IEEE Computer Society, Los Alamitos, CA, 2012.
  75. 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.
  76. 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.

2011

  1. A classification of the expressive power of well-structured transition systems. Parosh Aziz Abdulla, Giorgio Delzanno, and Laurent Van Begin. In Information and Computation, volume 209, number 3, pp 248-279, 2011.
  2. 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.
  3. Automatic verification of directory-based consistency protocols with graph constraints. Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In International Journal of Foundations of Computer Science, volume 22, number 4, pp 761-782, 2011.
  4. 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.
  5. On the verification of timed ad hoc networks. Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, and Riccardo Traverso. In Formal Modeling and Analysis of Timed Systems: FORMATS 2011, volume 6919 of Lecture Notes in Computer Science, pp 256-270, Springer Berlin/Heidelberg, 2011.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. Maintaining Database Integrity with Refinement Types. Ioannis G. Baltopoulos, Johannes Borgström, and Andrew D. Gordon. In ECOOP 2011 – Object-Oriented Programming, volume 6813 of Lecture Notes in Computer Science, pp 484-509, Springer-Verlag, Berlin, 2011.
  11. 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.
  12. 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.
  13. 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.
  14. Congestion Avoidance in a Data-Centric Opportunistic Network. Fredrik Bjurefors, Per Gunningberg, Christian Rohner, and Sam Tavakoli. In Proceedings of the 2011 ACM SIGCOMM Workshop on Information-Centric Networking (ICN-2011), 2011.
  15. Haggle Testbed: a Testbed for Opportunistic Networks. Fredrik Bjurefors, Per Gunningberg, and Christian Rohner. In In Proceedings of the 7th Swedish National Computer Networking Workshop, 2011.
  16. 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.
  17. 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.
  18. An interpolating sequent calculus for quantifier-free Presburger arithmetic. Angelo Brillout, Daniel Kroening, Philipp Rümmer, and Thomas Wahl. In Journal of automated reasoning, volume 47, number 4, pp 341-367, 2011.
  19. Beyond quantifier-free interpolation in extensions of Presburger arithmetic. Angelo Brillout, Daniel Kroening, Philipp Rümmer, and Thomas Wahl. In Verification, Model Checking, and Abstract Interpretation: VMCAI 2011, volume 6538 of Lecture Notes in Computer Science, pp 88-102, Springer Berlin/Heidelberg, 2011.
  20. 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.
  21. 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.
  22. 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.
  23. 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.
  24. Automatic analysis of DMA races using model checking and k-induction. Alastair F. Donaldson, Daniel Kroening, and Philipp Rümmer. In Formal methods in system design, volume 39, number 1, pp 83-113, 2011.
  25. SCRATCH: a tool for automatic analysis of DMA races. Alastair F. Donaldson, Daniel Kroening, and Philipp Rümmer. In Proc. 16th ACM Symposium on Principles and Practice of Parallel Programming, pp 311-312, ACM Press, New York, 2011.
  26. Software verification using <em>k</em>-induction. Alastair F. Donaldson, Leopold Haller, Daniel Kroening, and Philipp Rümmer. In Static Analysis: SAS 2011, volume 6887 of Lecture Notes in Computer Science, pp 351-368, Springer Berlin/Heidelberg, 2011.
  27. Tightening test coverage metrics: A case study in equivalence checking using <em>k</em>-induction. Alastair F. Donaldson, Nannan He, Daniel Kroening, and Philipp Rümmer. In Formal Methods for Components and Objects: FMCO 2010, volume 6957 of Lecture Notes in Computer Science, pp 297-315, Springer Berlin/Heidelberg, 2011.
  28. Computing Systems: Research Challenges Ahead: The HiPEAC Vision 2011/2012. Marc Duranton, David Black-Schaffer, Sami Yehia, and Koen de Bosschere. 2011.
  29. A distributed swarm-intelligent localization for sensor networks with mobile nodes. Pontus Ekberg and Edith C.-H. Ngai. In Proc. 7th International Wireless Communications and Mobile Computing Conference, pp 83-88, IEEE, Piscataway, NJ, 2011.
  30. 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.
  31. 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.
  32. 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.
  33. 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.
  34. On well-separated sets and fast multipole methods. Stefan Engblom. In Applied Numerical Mathematics, volume 61, pp 1096-1102, 2011.
  35. Mobile system for establishing the lactate threshold by analysing the respiratory air. Mia Folke, Frederik Hermans, Ioana Rodhe, Mats Björkman, Maria Lindén, and Per Gunningberg. In Proc. 2nd International Conference on Ambulatory Monitoring of Physical Activity and Movement, pp 102-102, Glasgow Caledonian University, Scotland, 2011.
  36. Stable computations with Gaussian radial basis functions. Bengt Fornberg, Elisabeth Larsson, and Natasha Flyer. In SIAM Journal on Scientific Computing, volume 33, pp 869-892, 2011.
  37. A type and effect system for deadlock avoidance in low-level languages. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Proc. 6th International Workshop on Types in Language Design and Implementation, pp 15-28, ACM Press, New York, 2011.
  38. 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.
  39. 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.
  40. 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.
  41. Stable difference methods for block-structured adaptive grids. Magnus Gustafsson, Anna Nissen, and Katharina Kormann. Technical report / Department of Information Technology, Uppsala University nr 2011-022, 2011.
  42. Test-case generation for embedded Simulink via formal concept analysis. Nannan He, Philipp Rümmer, and Daniel Kroening. In Proc. 48th Design Automation Conference, pp 224-229, ACM Press, New York, 2011.
  43. Mobile Sources in an Information-Centric Network with Hierarchical Names: An Indirection Approach. Frederik Hermans, Edith C.-H. Ngai, and Per Gunningberg. In Proc. 7th Swedish National Computer Networking Workshop, 2011.
  44. Sensei-UU — a relocatable WSN testbed supporting repeatable node mobility. Frederik Hermans, Olof Rensfelt, Per Gunningberg, Lars-Åke Larzon, and Edith Ngai. In Testbeds and Research Infrastructures: Development of Networks and Communities, volume 46 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, pp 612-614, Springer-Verlag, Berlin, 2011.
  45. 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.
  46. Twitter in Disaster Mode: Opportunistic Communication and Distribution of Sensor Data in Emergencies. Theus Hossmann, Franck Legendre, Paolo Carta, Per Gunningberg, and Christian Rohner. In ExtremeCom2011, ACM Press, 2011.
  47. Twitter in Disaster Mode: Security Architecture. Theus Hossmann, Paolo Carta, Dominik Schatzmann, Franck Legendre, Per Gunningberg, and Christian Rohner. In Conference on emerging Networking EXperiments and Technologies (CoNEXT): Special Workshop on the Internet and Disasters (SWID), ACM Press, Tokyo, 2011.
  48. 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.
  49. Learning of automata models extended with data. Bengt Jonsson. In Formal Methods for Eternal Networked Software Systems: SFM 2011, Advanced Lectures, volume 6659 of Lecture Notes in Computer Science, pp 327-349, Springer Berlin/Heidelberg, 2011.
  50. 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.
  51. 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.
  52. Global error control of the time-propagation for the Schrödinger equation with a time-dependent Hamiltonian. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. In Journal of Computational Science, volume 2, pp 178-187, 2011.
  53. Radial basis functions for the time-dependent Schrödinger equation. Katharina Kormann and Elisabeth Larsson. In Numerical Analysis and Applied Mathematics: ICNAAM 2011, volume 1389 of AIP Conference Proceedings, pp 1323-1326, American Institute of Physics (AIP), Melville, NY, 2011.
  54. 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.
  55. 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.
  56. Robust and flexible Internet connectivity for mobile ad hoc networks. Erik Nordström, Per Gunningberg, and Christian Tschudin. In Ad hoc networks, volume 9, number 1, pp 1-15, Elsevier, 2011.
  57. Repeatable experiments with mobile nodes in a relocatable WSN testbed. Olof Rensfelt, Frederik Hermans, Per Gunningberg, Lars-Åke Larzon, and Erik Björnemo. In Computer journal, volume 54, number 12, pp 1973-1986, 2011.
  58. Efficient Parallel Implementation of a Kalman Filter for Single Output Systems on Multicore Computational Platforms. Olov Rosén and Alexander Medvedev. In Proc. 50th Conference on Decision and Control, IEEE, Piscataway, NJ, 2011.
  59. 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.
  60. 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.
  61. 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.
  62. 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.
  63. 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.
  64. 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.
  65. Implementation of a collocated boundary element method for acoustic wave propagation in multilayered fluid media. Elena Sundkvist and Elisabeth Larsson. Technical report / Department of Information Technology, Uppsala University nr 2011-016, 2011.
  66. Lower trees with fixed degrees: a recipe for efficient secure hierarchical aggregation in WSNs. Davor Sutic, Ioana Rodhe, Christian Rohner, and Björn Victor. In 2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), pp 659-664, IEEE Computer Society, 2011.
  67. A scalable architecture for e-Science data management. Salman Toor, Manivasakan Sabesan, Sverker Holmgren, and Tore Risch. In Proc. 7th International Conference on e-Science, pp 210-217, IEEE Computer Society, Los Alamitos, CA, 2011.
  68. A LEGO-Based Mobile Robotic Platform for Evaluation of Parallel Control and Estimation Algorithms. Fredrik Wahlberg, Alexander Medvedev, and Olov Rosén. In Proc. 50th Conference on Decision and Control, pp 4548-4553, IEEE, Piscataway, NJ, 2011.
  69. 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.
  70. 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.
  71. 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.
  72. 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.
  73. Regions as Owners: A Discussion on Ownership-based Effects in Practice. Johan Östlund and Tobias Wrigstad. International Workshop on Aliasing, Confinement and Ownership in object-oriented programming: IWACO at ECOOP, 2011.

2010

  1. Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. Fides Aarts, Bengt Jonsson, and Johan Uijen. In Testing Software and Systems: ICTSS 2010, volume 6435 of Lecture Notes in Computer Science, pp 188-204, Springer-Verlag, Berlin, 2010.
  2. Analyzing the security in the GSM radio network using attack jungles. Parosh Aziz Abdulla, Jonathan Cederberg, and Lisa Kaati. In Leveraging Applications of Formal Methods, Verification, and Validation: Part I, volume 6415 of Lecture Notes in Computer Science, pp 60-74, Springer-Verlag, Berlin, 2010.
  3. Constrained monotonic abstraction: A CEGAR for parameterized verification. Parosh Aziz Abdulla, Yu-Fang Chen, Giorgio Delzanno, Frédéric Haziza, Chih-Duo Hong, and Ahmed Rezine. In CONCUR 2010 – Concurrency Theory, volume 6269 of Lecture Notes in Computer Science, pp 86-101, Springer-Verlag, Berlin, 2010.
  4. Forcing monotonicity in parameterized verification: From multisets to words. Parosh Aziz Abdulla. In SOFSEM 2010: Theory and Practice of Computer Science, volume 5901 of Lecture Notes in Computer Science, pp 1-15, Springer-Verlag, Berlin, 2010.
  5. Sampled semantics of timed automata. Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi. In Logical Methods in Computer Science, volume 6, number 3, pp 14:1-37, 2010.
  6. Simulation subsumption in Ramsey-based Büchi automata universality and inclusion testing. Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, and Tomás Vojnar. In Computer Aided Verification, volume 6174 of Lecture Notes in Computer Science, pp 132-147, Springer-Verlag, Berlin, 2010.
  7. Well (and better) quasi-ordered transition systems. Parosh Aziz Abdulla. In Bulletin of Symbolic Logic, volume 16, number 4, pp 457-515, 2010.
  8. When simulation meets antichains: On checking language inclusion of nondeterministic finite (tree) automata. Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, and Tomás Vojnar. In Tools and Algorithms for the Construction and Analysis of Systems, volume 6015 of Lecture Notes in Computer Science, pp 158-174, Springer-Verlag, Berlin, 2010.
  9. 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.
  10. 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.
  11. 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.
  12. Formalising process calculi. Jesper Bengtson. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 93, Acta Universitatis Upsaliensis, Uppsala, 2010.
  13. Interest dissemination in a searchable data-centric opportunistic network. Fredrik Bjurefors, Per Gunningberg, Erik Nordström, and Christian Rohner. In Proc. European Wireless Conference: EW 2010, pp 889-895, IEEE, Piscataway, NJ, 2010.
  14. 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.
  15. Inferring Compact Models of Communication Protocol Entities. Therese Bohlin, Bengt Jonsson, and Siavash Soleimanifard. In Leveraging Applications of Formal Methods, Verification, and Validation: Part I, volume 6415 of Lecture Notes in Computer Science, pp 658-672, Springer-Verlag, Berlin, 2010.
  16. Invariant synthesis for programs manipulating lists with unbounded data. Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Ahmed Rezine, and Mihaela Sighireanu. In Computer Aided Verification, volume 6174 of Lecture Notes in Computer Science, pp 72-88, Springer-Verlag, Berlin, 2010.
  17. A note on radial basis function interpolant limits. Martin D. Buhmann, Slawomir Dinew, and Elisabeth Larsson. In IMA Journal of Numerical Analysis, volume 30, pp 543-554, 2010.
  18. 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.
  19. 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.
  20. 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.
  21. 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.
  22. A concurrent language with a uniform treatment of regions and locks. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Proc. 2nd Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software: PLACES 2009, volume 17 of Electronic Proceedings in Theoretical Computer Science, pp 79-93, 2010.
  23. Race-free and memory-safe multithreading: Design and implementation in Cyclone. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Proc. 5th International Workshop on Types in Language Design and Implementation, pp 15-26, ACM Press, New York, 2010.
  24. Learning of event-recording automata. Olga Grinchtein, Bengt Jonsson, and Martin Leucker. In Theoretical Computer Science, volume 411, number 47, pp 4029-4054, 2010.
  25. 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.
  26. Handover for a portable communication device between local and wide area wireless networks. Per Gunningberg, Mattias Hansson, Pekka Hedqvist, Jonne Kodu, and Esbjörn Köhler. EU, WO, 2010.
  27. 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.
  28. 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.
  29. On Handling Data in Automata Learning: Considerations from the CONNECT Perspective. Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen, and Sofia Cassel. In Leveraging Applications of Formal Methods, Verification, and Validation: Part II, volume 6416 of Lecture Notes in Computer Science, pp 221-235, Springer-Verlag, Berlin, 2010.
  30. A Grid-Enabled Problem Solving Environment for QTL Analysis in R. Mahen Jayawardena, Carl Nettelblad, Salman Toor, Per-Olov Östberg, Erik Elmroth, and Sverker Holmgren. In Proc. 2nd International Conference on Bioinformatics and Computational Biology, pp 202-209, ISCA, Cary, NC, 2010.
  31. Computational and visualization tools for genetic analysis of complex traits. Mahen Jayawardena, Salman Toor, and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2010-001, 2010.
  32. 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.
  33. 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.
  34. 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.
  35. 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.
  36. 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.
  37. 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.
  38. A Fourier-coefficient based solution of an optimal control problem in quantum chemistry. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. In Journal of Optimization Theory and Applications, volume 147, pp 491-506, 2010.
  39. Efficient algorithms for multidimensional global optimization in genetic mapping of complex traits. Kajsa Ljungberg, Kateryna Mishchenko, and Sverker Holmgren. In Advances and Applications in Bioinformatics and Chemistry, volume 3, pp 75-88, 2010.
  40. 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.
  41. 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.
  42. 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.
  43. Assessing a multiple QTL search using the variance component model. Kateryna Mishchenko, Lars Rönnegård, Sverker Holmgren, and Volodymyr Mishchenko. In Computational biology and chemistry (Print), volume 34, pp 34-41, 2010.
  44. Stochastically guaranteed global optima in multi-dimensional QTL searches. Carl Nettelblad and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2010-006, 2010.
  45. 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.
  46. Repeatable experiments with mobile nodes in a relocatable WSN testbed. Olof Rensfelt, Frederik Hermans, Per Gunningberg, and Lars-Åke Larzon. In Proc. 6th IEEE International Conference on Distributed Computing in Sensor Systems Workshops: DCOSSW 2010, pp 1-6, IEEE Computer Society, 2010.
  47. Sensei-UU: a relocatable sensor network testbed. Olof Rensfelt, Frederik Hermans, Lars-Åke Larzon, and Per Gunningberg. In Proc. 5th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization, pp 63-70, ACM Press, 2010.
  48. Speedup and tracking accuracy evaluation of parallel particle filter algorithms implemented on a multicore architecture. Olov Rosén, Alexander Medvedev, and Mats Ekman. In Proc. International Conference on Control Applications: CCA 2010, pp 440-445, IEEE, Piscataway, NJ, 2010.
  49. 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.
  50. 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.
  51. 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.
  52. 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.
  53. 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.
  54. Case-study for different models of resource brokering in grid systems. Salman Toor, Bjarte Mohn, David Cameron, and Sverker Holmgren. Technical report / Department of Information Technology, Uppsala University nr 2010-009, 2010.
  55. Verifying parallel programs with dynamic communication structures. Tayssir Touili and Mohamed Faouzi Atig. In Theoretical Computer Science, volume 411, pp 3460-3468, 2010.
  56. 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.
  57. 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.
  58. 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.
  59. Welterweight Java. Johan Östlund and Tobias Wrigstad. In Objects, Models, Components, Patterns, volume 6141 of Lecture Notes in Computer Science, pp 97-116, Springer-Verlag, Berlin, 2010.

2009

  1. Approximated Context-Sensitive Analysis for Parameterized Verification. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Formal Techniques for Distributed Systems: Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings, volume 5522 of Lecture notes in computer science, pp 41-56, 2009.
  2. Approximated parameterized verification of infinite-state processes with global conditions. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Formal methods in system design, volume 34, number 2, pp 126-156, 2009.
  3. Automatic Verification of Directory-Based Consistency Protocols. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Reachability Problems: 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, volume 5797 of Lecture notes in computer science, pp 36-50, 2009.
  4. Monotonic Abstraction: on Efficient Verification of Parameterized Systems. Aziz Abdulla, Giorgio Delzanno, Ben Henda, and Ahmed Rezine. In International Journal of Foundations of Computer Science, volume 20, number 5, pp 779-801, 2009.
  5. A uniform (bi-)simulation-based framework for reducing tree automata. Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In Electronical Notes in Theoretical Computer Science, volume 251, pp 27-48, 2009.
  6. Composed bisimulation for tree automata. Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In International Journal of Foundations of Computer Science, volume 20, number 4, pp 685-700, 2009.
  7. Universality of R-automata with value copying. Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi. In Electronical Notes in Theoretical Computer Science, volume 239, pp 131-141, 2009.
  8. Formalising the ?-calculus using nominal logic. Jesper Bengtson and Joachim Parrow. In Logical Methods in Computer Science, volume 5, number 2, pp 16:1-36, 2009.
  9. Psi-calculi: Mobile processes, nominal data, and logic. Jesper Bengtson, Magnus Johansson, Joachim Parrow, and Björn Victor. In Proc. 24th Annual IEEE Symposium on Logic in Computer Science, pp 39-48, IEEE, Piscataway, NJ, 2009.
  10. Psi-calculi in Isabelle. Jesper Bengtson and Joachim Parrow. In Theorem Proving in Higher Order Logics, volume 5674 of Lecture Notes in Computer Science, pp 99-114, Springer-Verlag, Berlin, 2009.
  11. Analytical solutions for a single blade in vertical axis turbine motion in two dimensions. Paul Deglaire, Stefan Engblom, Olov Ågren, and Hans Bernhoff. In European journal of mechanics. B, Fluids, volume 28, pp 506-520, 2009.
  12. Galerkin spectral method applied to the chemical master equation. Stefan Engblom. In Communications in Computational Physics, volume 5, pp 871-896, 2009.
  13. Parallel in time simulation of multiscale stochastic chemical kinetics. Stefan Engblom. In Multiscale Modeling & simulation, volume 8, pp 46-68, 2009.
  14. Simulation of stochastic reaction-diffusion processes on unstructured meshes. Stefan Engblom, Lars Ferm, Andreas Hellander, and Per Lötstedt. In SIAM Journal on Scientific Computing, volume 31, pp 1774-1797, 2009.
  15. Spectral approximation of solutions to the chemical master equation. Stefan Engblom. In Journal of Computational and Applied Mathematics, volume 229, pp 208-221, 2009.
  16. Stable computations with Gaussian radial basis functions in 2-D. Bengt Fornberg, Elisabeth Larsson, and Natasha Flyer. Technical report / Department of Information Technology, Uppsala University nr 2009-020, 2009.
  17. 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.
  18. Improving scalability of model-checking for minimizing buffer requirements of synchronous dataflow graphs. Nan Guan, Zonghua Gu, Wang Yi, and Ge Yu. In Proc. 14th Asia and South Pacific Design Automation Conference, pp 715-720, IEEE, Piscataway, NJ, 2009.
  19. 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.
  20. 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.
  21. CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. Valérie Issarny, Bernhard Steffen, Bengt Jonsson, Gordon Blair, Paul Grace, Marta Kwiatkowska, Radu Calinescu, Paola Inverardi, Massimo Tivoli, Antonia Bertolino, and Antonino Sabetta. In Proc. 14th International Conference on Engineering of Complex Computer Systems, pp 154-161, IEEE, Piscataway, NJ, 2009.
  22. A grid portal for genetic analysis of complex traits. Mahen Jayawardena, Salman Toor, and Sverker Holmgren. In Proc. 32nd International Convention on Information and Communication Technology, Electronics and Microelectronics: Volume I, pp 281-284, MIPRO, Rijeka, Croatia, 2009.
  23. 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.
  24. A Fourier-coefficient based solution of an optimal control problem in quantum chemistry. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. Technical report / Department of Information Technology, Uppsala University nr 2009-022, 2009.
  25. Global error control of the time-propagation for the Schrödinger equation with a time-dependent Hamiltonian. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. Technical report / Department of Information Technology, Uppsala University nr 2009-021, 2009.
  26. Implicit-explicit Runge-Kutta methods for stiff combustion problems. Erik Lindblad, Damir M. Valiev, Bernhard Müller, Jarmo Rantakokko, Per Lötstedt, and Michael A. Liberman. In Shock Waves: Volume 1, pp 299-304, Springer-Verlag, Berlin, 2009.
  27. WCET Analysis of the ?C/OS-II Real-Time Kernel. Mingsong Lv, Nan Guan, Yi Zhang, Rui Chen, Qingxu Deng, Ge Yu, and Wang Yi. In Proc. 12th International Conference on Computational Science and Engineering: Vol. 2, pp 270-276, IEEE, Piscataway, NJ, 2009.
  28. cnF2freq: Efficient determination of genotype and haplotype probabilities in outbred populations using Markov models. Carl Nettelblad, Sverker Holmgren, Lucy Crooks, and Örjan Carlborg. In Bioinformatics and Computational Biology, volume 5462 of Lecture Notes in Computer Science, pp 307-319, Springer-Verlag, Berlin, 2009.
  29. A Search-based Network Architecture for Mobile Devices. Erik Nordström, Per Gunningberg, and Christian Rohner. Technical report / Department of Information Technology, Uppsala University nr 2009-003, 2009.
  30. Haggle: A Data-centric Network Architecture for Mobile Devices. Erik Nordström, Per Gunningberg, and Christian Rohner. 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing: Mobihoc Wireless S3 Workshop (Invited talk), 2009.
  31. Parallel Structured Adaptive Mesh Refinement. Jarmo Rantakokko and Michael Thuné. In Parallel Computing: Numerics, Applications, and Trends, pp 147-173, Springer-Verlag, London, 2009.
  32. Sensei-UU: a flexible testbed for heterogeneous wireless sensor networks. Olof Rensfelt, Frederik Hermans, Christofer Ferm, Lars-Åke Larzon, and Per Gunningberg. In Testbeds and Research Infrastructures for the Development of Networks Communities and Workshops, 2009. TridentCom 2009. 5th International Conference on, pp 1-2, 2009.
  33. Automatic refactoring of Erlang programs. Konstantinos Sagonas and Thanassis Avgerinos. In Proc. 11th ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pp 13-23, ACM Press, New York, 2009.
  34. 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.
  35. 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.
  36. 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.
  37. 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.
  38. 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.
  39. 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.
  40. 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.
  41. Modeling and analysis of thread-pools in an industrial communication platform. Frank S. de Boer, Immo Grabe, Mohammad Mahdi Jaghoori, Andries Stam, and Wang Yi. In Formal Methods and Software Engineering, volume 5885 of Lecture Notes in Computer Science, pp 367-386, Springer-Verlag, Berlin, 2009.

2008

  1. Monotonic Abstraction in Parameterized Verification. Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Electronical Notes in Theoretical Computer Science, volume 223, pp 3-14, 2008.
  2. Composed Bisimulation for Tree Automata. Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In Implementation and Application of Automata, volume 5148 of Lecture Notes in Computer Science, pp 212-222, Springer Berlin/Heidelberg, 2008.
  3. Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata. Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, and Tomás Vojnar. In Tools and Algorithms for the Construction and Analysis of Systems, volume 4963 of Lecture Notes in Computer Science, pp 93-108, Springer Berlin/Heidelberg, 2008.
  4. Handling parameterized systems with non-atomic global conditions. Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, and Ahmed Rezine. In Verification, Model Checking, and Abstract Interpretation, volume 4905 of Lecture Notes in Computer Science, pp 22-36, Springer-Verlag, Berlin, 2008.
  5. Model Checking Race-Freeness. Parosh Aziz Abdulla, Frédéric Haziza, and Mats Kindahl. In Proc. 1st Swedish Workshop on Multi-Core Computing, volume 2008:07 of Research report / Blekinge Institute of Technology, pp 89-96, 2008.
  6. Model checking race-freeness. Parosh Aziz Abdulla, Frédéric Haziza, and Mats Kindahl. In SIGARCH Computer Architecture News, volume 36, number 5, pp 72-79, 2008.
  7. Monotonic abstraction for programs with dynamic memory heaps. Parosh Aziz Abdulla, Ahmed Bouajjani, Jonathan Cederberg, Frédéric Haziza, and Ahmed Rezine. In Computer Aided Verification, volume 5123 of Lecture Notes in Computer Science, pp 341-354, Springer-Verlag, Berlin, 2008.
  8. Monotonic abstraction in action: Automatic verification of distributed mutex algorithms. Parosh Aziz Abdulla, Giorgio Delzanno, and Ahmed Rezine. In Theoretical Aspects of Computing - ICTAC 2008, volume 5160 of Lecture Notes in Computer Science, pp 50-65, Springer-Verlag, Berlin, 2008.
  9. Monotonic and downward closed games. Parosh Aziz Abdulla, Ahmed Bouajjani, and Julien d'Orso. In Journal of logic and computation (Print), volume 18, number 1, pp 153-169, 2008.
  10. Parameterized tree systems. Parosh Aziz Abdulla, Noomene Ben Henda, Giorgio Delzanno, Frédéric Haziza, and Ahmed Rezine. In Formal Techniques for Networked and Distributed Systems: FORTE 2008?, volume 5048 of Lecture Notes in Computer Science, pp 69-83, Springer-Verlag, Berlin, 2008.
  11. R-automata. Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi. In CONCUR 2008 - Concurrency Theory, volume 5201 of Lecture Notes in Computer Science, pp 67-81, Springer-Verlag, Berlin, 2008.
  12. Stochastic games with lossy channels. Parosh Aziz Abdulla, Noomene Ben Henda, Luca de Alfaro, Richard Mayr, and Sven Sandberg. In Foundations of Software Science and Computational Structures: Proceedings, volume 4962 of Lecture Notes in Computer Science, pp 35-49, Springer-Verlag, Berlin, 2008.
  13. Universality Analysis for One-Clock Timed Automata. Parosh Aziz Abdulla, Johann Deneux, Joel Ouaknine, Karin Quaas, and James Worrell. In Fundamenta Informaticae, volume 89, number 4, pp 419-450, 2008.
  14. Presentation of the VINN Excellence Center for Wireless Sensor Networks (WISENET). Anders Ahlén, Bengt Ahlgren, Roland Grönroos, Per Gunningberg, Klas Hjort, Ilia Katardjiev, Christian Rohner, and Anders Rydberg. In Conference on Radio Science (RVK08), Växjö, 2008.
  15. Re?nement Types for Secure Implementations. Jesper Bengtson, Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon, and Sergio Maffeis. In Proc. 21st IEEE Computer Security Foundations Symposium, pp 17-32, IEEE, Piscataway, NJ, 2008.
  16. Regular Inference for State Machines Using Domains with Equality Tests. Therese Berg, Bengt Jonsson, and Harald Raffelt. In Fundamental Approaches to Software Engineering, volume 4961 of Lecture Notes in Computer Science, pp 317-331, Springer-Verlag, Berlin, 2008.
  17. Regular Inference for Communication Protocol Entities. Therese Bohlin and Bengt Jonsson. Technical report / Department of Information Technology, Uppsala University nr 2008-024, 2008.
  18. On-line placement of real-time tasks on 2D partially run-time reconfigurable FPGAs. Qingxu Deng, Fanxin Kong, Nan Guan, Mingsong Lv, and Wang Yi. In Proc. 5th IEEE International Symposium on Embedded Computing, pp 20-25, IEEE, Piscataway, NJ, 2008.
  19. Timed Automata Patterns. Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, and Wang Yi. In IEEE Transactions on Software Engineering, volume 34, number 6, pp 844-859, 2008.
  20. Empowering a flexible application portal with a SOA-based grid job management framework. Erik Elmroth, Sverker Holmgren, Jonas Lindemann, Salman Toor, and Per-Olov Östberg. PARA 2008: State of the Art in Scientific and Parallel Computing, Norwegian University of Science and Technology, Trondheim, Norway, 2008.
  21. A discrete spectral method for the chemical master equation. Stefan Engblom. Technical report / Department of Information Technology, Uppsala University nr 2008-005, 2008.
  22. Numerical Solution Methods in Stochastic Chemical Kinetics. Stefan Engblom. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 564, Acta Universitatis Upsaliensis, Uppsala, 2008.
  23. Parallel in time simulation of multiscale stochastic chemical kinetics. Stefan Engblom. Technical report / Department of Information Technology, Uppsala University nr 2008-020, 2008.
  24. Simulation of stochastic reaction-diffusion processes on unstructured meshes. Stefan Engblom, Lars Ferm, Andreas Hellander, and Per Lötstedt. Technical report / Department of Information Technology, Uppsala University nr 2008-012, 2008.
  25. Time-parallel simulation of stochastic chemical kinetics. Stefan Engblom. In Numerical Analysis and Applied Mathematics: ICNAAM 2008, volume 1048 of AIP Conference Proceedings, pp 174-177, American Institute of Physics (AIP), Melville, NY, 2008.
  26. Inference of Event-Recording Automata using Timed Decision Trees. Olga Grinchtein and Bengt Jonsson. Technical report / Department of Information Technology, Uppsala University nr 2008-014, 2008.
  27. Learning of Event-Recording Automata. Olga Grinchtein, Bengt Jonsson, and Martin Leucker. Technical report / Department of Information Technology, Uppsala University nr 2008-013, 2008.
  28. New schedulability test conditions for non-preemptive scheduling on multiprocessor platforms. Nan Guan, Wang Yi, Zonghua Gu, Qingxu Deng, and Ge Yu. In Proc. Real-Time Systems Symposium: RTSS 2008, pp 137-146, IEEE, Piscataway, NJ, 2008.
  29. Improving cache utilization using Acumem VPE. Erik Hagersten, Mats Nilsson, and Magnus Vesterlund. In Tools for High Performance Computing, pp 115-135, Springer-Verlag, Berlin, 2008.
  30. 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.
  31. Extended pi-Calculi. Magnus Johansson, Joachim Parrow, Björn Victor, and Jesper Bengtson. In Automata, Languages and Programming, PT 2: Proceedings of ICALP 2008, volume 5126 of Lecture Notes in Computer Science, pp 87-98, 2008.
  32. Cyclic dependencies in modular performance analysis. Bengt Jonsson, Simon Perathoner, Lothar Thiele, and Wang Yi. In Proc. 8th ACM International Conference on Embedded Software, pp 179-188, ACM Press, New York, 2008.
  33. 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.
  34. 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.
  35. Reduction Techniques for Finite (Tree) Automata. Lisa Kaati. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 562, Acta Universitatis Upsaliensis, Uppsala, 2008.
  36. Accurate time propagation for the Schrödinger equation with an explicitly time-dependent Hamiltonian. Katharina Kormann, Sverker Holmgren, and Hans O. Karlsson. In Journal of Chemical Physics, volume 128, pp 184101:1-11, 2008.
  37. Multi-dimensional option pricing using radial basis functions and the generalized Fourier transform. Elisabeth Larsson, Krister Åhlander, and Andreas Hall. In Journal of Computational and Applied Mathematics, volume 222, pp 175-192, 2008.
  38. Newton-type methods for REML estimation in genetic analysis of quantitative traits. Kateryna Mishchenko, Sverker Holmgren, and Lars Rönnegård. In Journal of Computational Methods in Sciences and Engineering, volume 8, pp 53-67, 2008.
  39. 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.
  40. Expressiveness of Process Algebras. Joachim Parrow. In Electronical Notes in Theoretical Computer Science, volume 209, pp 173-186, 2008.
  41. Improved radial basis function methods for multi-dimensional option pricing. Ulrika Pettersson, Elisabeth Larsson, Gunnar Marcusson, and Jonas Persson. In Journal of Computational and Applied Mathematics, volume 222, pp 82-93, 2008.
  42. An Interactive Test-bed for Heterogeneous Wireless Sensor Networks.. Olof Rensfelt, Frederik Hermans, Christofer Ferm, Per Gunningberg, and Lars-Åke Larzon. In DCOSS demo proceedings, volume 5067 of Lecture Notes in Computer Science, Springer Verlag, 2008.
  43. Parameterized Systems: Generalizing and Simplifying Automatic Verification. Ahmed Rezine. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 72, Acta Universitatis Upsaliensis, Uppsala, 2008.
  44. Gradual Typing of Erlang Programs: A Wrangler Experience. Konstantinos Sagonas and Daniel Luna. In Proc. 7th ACM SIGPLAN Workshop on ERLANG, pp 73-81, ACM Press, New York, 2008.
  45. Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. Mayank Saksena, Oskar Wibling, and Bengt Jonsson. In Tools and Algorithms for the Construction and Analysis of Systems, volume 4963 of Lecture Notes in Computer Science, pp 18-32, Springer-Verlag, Berlin, 2008.
  46. Model-based validation of QoS properties of biomedical sensor networks. Simon Tschirner, Liang Xuedong, and Wang Yi. In Proc. 8th ACM International Conference on Embedded Software, pp 69-78, ACM Press, New York, 2008.

Updated  2018-01-03 11:36:46 by Roland Grönroos.