Hoppa till huvudinnehållet
Institutionen för informationsteknologi

Publikationer av Avdelningen för Datalogi

2021

  1. Age-Optimal UAV Scheduling for Data Collection With Battery Recharging. Ghafour Ahani, Di Yuan och Yixin Zhao. I IEEE Communications Letters, volym 25, nummer 4, pp 1254-1258, Institute of Electrical and Electronics Engineers (IEEE), 2021. (DOI).
  2. From Declarative Models to Local Search. Gustav Björdal. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 2022, Acta Universitatis Upsaliensis, Uppsala, 2021. (Online Defence, fulltext, preview image).
  3. TSOPER: Efficient Coherence-Based Strict Persistency. Per Ekemark, Yuan Yao, Alberto Ros, Konstantinos Sagonas och Stefanos Kaxiras. I 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), International Symposium on High-Performance Computer Architecture : Proceedings, pp 125-138, Institute of Electrical and Electronics Engineers (IEEE), 2021. (DOI).
  4. Dala: a simple capability-based dynamic language design for data race-freedom. Kiko Fernandez-Reyes, Isaac Oscar Gariano, James Noble, Erin Greenwood-Thessman, Michael Homer och Tobias Wrigstad. I Onward! 2021: Proceedings of the 2021 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software, pp 1-17, 2021. (DOI).
  5. Abstractions to Control the Future. Francisco Ramón Fernández Reyes. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1986, Acta Universitatis Upsaliensis, Uppsala, 2021. (Online defence, fulltext, preview image).
  6. Conservative Definitions for Higher-order Logic with Ad-hoc Overloading. Arve Gengelbach. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 2021, Acta Universitatis Upsaliensis, Uppsala, 2021. (Online defence, fulltext, preview image).
  7. Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading. Arve Gengelbach, Johannes Åman Pohjola och Tjark Weber. I Proceedings Fifteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, volym 332 av Electronic Proceedings in Theoretical Computer Science (EPTCS), pp 1-17, Open Publishing Association, 2021. (DOI, Fulltext, fulltext:print).
  8. Generic Quality Assurance in Software Projects. Daniel Jansson. Examensarbete, handledare: Alfred Yrelin, examinator: Lars-Åke Nordén, Aletta Nylén, UPTEC IT nr 21040, 2021. (fulltext).
  9. Proportionality in Spatial Keyword Search. Georgios Kalamatianos, Georgios J Fakas och Nikos Mamoulis. I Proceedings of the 2021 International Conference on Management of Data, pp 885-897, Association for Computing Machinery (ACM), 2021. (DOI).
  10. Defining and measuring probabilistic ego networks. Amin Kaveh, Matteo Magnani och Christian Rohner. I Social Network Analysis and Mining, volym 11, 2021. (DOI, Fulltext).
  11. Probabilistic network sparsification with ego betweenness. Amin Kaveh, Matteo Magnani och Christian Rohner. I Applied Network Science, volym 6, Springer Nature, 2021. (DOI, Fulltext, fulltext:print).
  12. Probabilistic Programming for Birth-Death Models of Evolution. Jan Kudlicka. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 2006, Acta Universitatis Upsaliensis, Uppsala, 2021. (Online defence, fulltext, preview image).
  13. Jupyter Notebooks on GitHub: Characteristics and Code Clones. Malin Källén och Tobias Wrigstad. I The Art, Science, and Engineering of Programming, volym 5, nummer 3, 2021. (DOI, Fulltext, fulltext:print).
  14. Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages. Daniel Lunden, Johannes Borgström och David Broman. I Programming Languages And Systems, ESOP 2021, Lecture Notes in Computer Science, pp 404-431, Springer Nature, 2021. (DOI, Fulltext, fulltext:print).
  15. Analysis of Multiplex Social Networks with R. Matteo Magnani, Luca Rossi och Davide Vega. I Journal of Statistical Software, volym 98, nummer 8, pp 1-30, Foundation for Open Access Statistic, 2021. (DOI, Fulltext, fulltext:print).
  16. Community Detection in Multiplex Networks. Matteo Magnani, Obaida Hanteer, Roberto Interdonato, Luca Rossi och Andrea Tagarelli. I ACM Computing Surveys, volym 54, nummer 3, Association for Computing Machinery (ACM), 2021. (DOI).
  17. Deep neural networks for social visuals: studying climate communication on YouTube. Matteo Magnani och Alexandra Segerberg. I Selected Papers of Internet Research, SPIR, Association of Internet Researchers, 2021. (DOI).
  18. On the conditions for integrating deep learning into the study of visual politics. Matteo Magnani och Alexandra Segerberg. I WebSci '21: Proceedings of the 13th ACM Web Science Conference 2021, pp 56-64, Association for Computing Machinery (ACM), 2021. (DOI, fulltext:postprint).
  19. Analytics of IIoT Data Using a NoSQL Datastore. Khalid Mahmood, Tore Risch och Kjell Orsborn. I 2021 IEEE International Conference on Smart Computing (SMARTCOMP), International Conference on Smart Computing (SMARTCOMP), pp 97-104, Institute of Electrical and Electronics Engineers (IEEE), 2021. (DOI).
  20. Scalable Data Management for Internet of Things. Khalid Mahmood. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 2095, Acta Universitatis Upsaliensis, Uppsala, 2021. (fulltext, preview image).
  21. Scalable Real-Time Analytics for IoT Applications. Khalid Mahmood och Tore Risch. I 2021 IEEE International Conference on Smart Computing (SMARTCOMP), International Conference on Smart Computing (SMARTCOMP), pp 404-406, Institute of Electrical and Electronics Engineers (IEEE), 2021. (DOI).
  22. Second-hand goods classification with CNNs: A proposal for a step towards a more sustainable fashion industry. Torsten Malmgård. Examensarbete, handledare: Muntazir Mehdi, examinator: Matteo Magnani, Tomas Nyberg, UPTEC F nr 21032, 2021. (fulltext).
  23. Modal Logics for Nominal Transition Systems. Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Forsberg Gutkovas och Tjark Weber. I Logical Methods in Computer Science, volym 17, nummer 1, 2021. (DOI, Fulltext, Extern länk, Extern länk, fulltext:preprint, fulltext:print).
  24. Universal probabilistic programming offers a powerful approach to statistical phylogenetics. Fredrik Ronquist, Jan Kudlicka, Viktor Senderov, Johannes Borgström, Nicolas Lartillot, Daniel Lundén, Lawrence M. Murray, Thomas B. Schön och David Broman. I Communications Biology, volym 4, Springer Nature, 2021. (DOI, Fulltext, fulltext:print).
  25. Fifteen Years of Successfully Dialyzing Erlang and Elixir Code: Abstract. Konstantinos Sagonas. I Erlang '21: Proceedings of the 20th ACM SIGPLAN international workshop on Erlang, pp 1-1, Association for Computing Machinery (ACM), 2021. (DOI).
  26. Kravanalys av digitala medel och tjänster vid popup-butiker: En studie av den digitala utvecklingen i relationen mellan fastighetsägare och detaljhandeln. Sofia Skoghagen och Malin Sjöberg. Examensarbete, handledare: Johan Svenungsson, Björn Clemensson, examinator: Elísabet Andrésdóttir, Björn Victor, UPTEC STS nr 20003, 2021. (fulltext).
  27. Lock-free Contention Adapting Search Trees. Kjell Winblad, Konstantinos Sagonas och Bengt Jonsson. I ACM TRANSACTIONS ON PARALLEL COMPUTING, volym 8, nummer 2, Association for Computing Machinery (ACM), 2021. (DOI).
  28. A Note on Decoding Order in User Grouping and Power Optimization for Multi-Cell NOMA With Load Coupling. Lei You och Di Yuan. I IEEE Transactions on Wireless Communications, volym 20, nummer 1, pp 495-505, Institute of Electrical and Electronics Engineers (IEEE), 2021. (DOI).
  29. On Resource Optimization in Multi-IRS-assisted and Interference-coupled Multi-cell Systems. Zhanwei Yu och Di Yuan. I 2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp 1408-1412, Institute of Electrical and Electronics Engineers (IEEE), 2021. (DOI).
  30. Delivering more to cell edge via joint multi-cell non-orthogonal multiple access and traffic offloading. Yi Zhao, Di Yuan och Lei You. I IET Networks, volym 10, nummer 6, pp 265-277, Institution of Engineering and Technology, 2021. (DOI, Fulltext, fulltext:print).

2020

  1. Accounting for Information Freshness in Scheduling of Content Caching. Ghafour Ahani och Di Yuan. I ICC 2020: 2020 IEEE International Conference on Communications (ICC), IEEE International Conference on Communications, 2020. (DOI).
  2. Optimal scheduling of content caching subject to deadline. Ghafour Ahani och Di Yuan. I IEEE Open Journal of the Communications Society, volym 1, pp 293-307, IEEE, 2020. (DOI, Fulltext, fulltext:print).
  3. Routing and scheduling of network flows with deadlines and discrete capacity allocation. Ghafour Ahani, Pawel Wiatr och Di Yuan. I Networks, volym 76, nummer 1, pp 54-74, WILEY, 2020. (DOI).
  4. Dimensions of Professionalism: A Study of Computer Science Teaching in Saudi Arabia. Fayiq Alghamdi. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1965, Acta Universitatis Upsaliensis, Uppsala, 2020. (Online defence, fulltext, preview image).
  5. Strategies for array data retrieval from a relational back-end based on access patterns. Andrej Andrejev, Kjell Orsborn och Tore Risch. I Computing, volym 102, nummer 5, pp 1139-1158, 2020. (DOI, Fulltext, fulltext:print).
  6. Solving Satisfaction Problems using Large-Neighbourhood Search. Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey och Guido Tack. I Principles and Practice of Constraint Programming, volym 12333 av Lecture Notes in Computer Science, pp 55-71, 2020. (DOI).
  7. Diversified spatial keyword search on RDF data. Zhi Cai, Georgios Kalamatianos, Georgios J. Fakas, Nikos Mamoulis och Dimitris Papadias. I The VLDB journal, volym 29, nummer 5, pp 1171-1189, 2020. (DOI, Fulltext, fulltext:print).
  8. Modeling and Optimization of Mobility-Aware Dynamic Caching With Time-Varying Content Popularity. Tao Deng, Pingzhi Fan och Di Yuan. I IEEE Transactions on Vehicular Technology, volym 69, nummer 1, pp 1157-1162, 2020. (DOI).
  9. Analysis of DTLS Implementations Using Protocol State Fuzzing. Paul Fiterau-Brostean, Bengt Jonsson, Robert Merget, Joeri de Ruiter, Konstantinos Sagonas och Juraj Somorovsky. I Proceedings of the 29th USENIX Security Symposium, pp 2523-2540, 2020. (Proceedings paper fulltext, fulltext:print).
  10. Towards Explainable, Compliant and Adaptive Human-Automation Interaction. Barbara Gallina, Görkem Paçac?, David Johnson, Steve McKeever, Andreas Hamfelt, Stefania Costantini, Pierangelo Dell'Acqua och Gloria-Cerasela Crisan. I Proceedings of the 3rd EXplainable AI in Law Workshop (XAILA 2020), volym 2891 av CEUR Workshop Proceedings, 2020. (Extern länk, fulltext:print).
  11. Proof-theoretic Conservativity for HOL with Ad-hoc Overloading. Arve Gengelbach och Tjark Weber. I Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30 - December 4, 2020, Lecture Notes in Computer Science, pp 23-42, Springer, 2020. (DOI, Extern länk).
  12. Unspoken Assumptions in Multi-layer Modularity maximization. Obaida Hanteer och Matteo Magnani. I Scientific Reports, volym 10, nummer 1, NATURE PUBLISHING GROUP, 2020. (DOI, Fulltext, fulltext:print).
  13. Multilayer network simplification: Approaches, models and methods. Roberto Interdonato, Matteo Magnani, Diego Perna, Andrea Tagarelli och Davide Vega. I Computer Science Review, volym 36, 2020. (DOI).
  14. A structured approach to selecting the most suitable log management system for an organization. Lucas Kristiansson Herrera. Examensarbete, handledare: Isak Isacsson, examinator: Lars-Åke Nordén, Karl Marklund, UPTEC IT nr 20017, 2020. (fulltext).
  15. Particle Filter with Rejection Control and Unbiased Estimator of the Marginal Likelihood. Jan Kudlicka, Lawrence M. Murray, Thomas B. Schön och Fredrik Lindsten. I ICASSP 2020: 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), International Conference on Acoustics Speech and Signal Processing (ICASSP), pp 5860-5864, 2020. (DOI).
  16. Probabilistic programming for birth-death models of evolution using an alive particle filter with delayed sampling. Jan Kudlicka, Lawrence M. Murray, Fredrik Ronquist och Thomas B. Schön. I The 35th Uncertainty in Artificial Intelligence Conference (UAI), Proceedings of Machine Learning Research, pp 679-689, JOURNAL MACHINE LEARNING RESEARCH, San Diego, 2020.
  17. Parallel Graph-Based Stateless Model Checking. Magnus Lång och Konstantinos Sagonas. I Automated Technology for Verification and Analysis: 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19–23, 2020, Proceedings, volym 12302 av Lecture Notes in Computer Science (LNCS), pp 377-393, 2020. (DOI).
  18. Wrapping a NoSQL Datastore for Stream Analytics. Khalid Mahmood, Kjell Orsborn och Tore Risch. I 2020 IEEE 21st International Conference On Information Reuse And Integration For Data Science (IRI 2020), pp 301-305, Institute of Electrical and Electronics Engineers (IEEE), 2020. (DOI).
  19. Functional and Logic Programming: 15th International Symposium, FLOPS 2020, Akita, Japan, September 14–16, 2020, Proceedings. Keisuke Nakano och Konstantinos Sagonas (red). Volym 12073 av Lecture Notes in Computer Science, Springer, Cham, 2020. (DOI).
  20. Reshape your layouts, not your programs: A safe language extension for better cache locality. Alexandros Tasos, Juliana Franco, Sophia Drossopoulou, Tobias Wrigstad och Susan Eisenbach. I Science of Computer Programming, volym 197, 2020. (DOI).
  21. Clearing the Shadows: Recovering Lost Performance for Invisible Speculative Execution through HW/SW Co-Design. Kim-Anh Tran, Christos Sakalis, Magnus Själander, Alberto Ros, Stefanos Kaxiras och Alexandra Jimborean. I PACT ’20: Proceedings of the ACM International Conference on Parallel Architectures and Compilation Techniques, International Conference on Parallel Architectures and Compilation Techniques, pp 241-254, Association for Computing Machinery (ACM), 2020. (DOI, Extern länk).
  22. A Twitter-Based Study of the European Internet of Things. Funda Ustek-Spilda, Davide Vega, Matteo Magnani, Luca Rossi, Irina Shklovski, Sebastian Lehuede och Alison Powell. I Information Systems Frontiers, volym 23, nummer 1, pp 135-149, 2020. (DOI, Fulltext, fulltext:print).
  23. Graph-theoretic approaches and tools for quantitatively assessing curricula coherence. Damiano Varagnolo, Steffi Knorn, Kjell Staffas, Eva Fjällström och Tobias Wrigstad. I European Journal of Engineering Education, volym 46, nummer 3, pp 344-363, 2020. (DOI).
  24. Reformulations of Constraint Satisfaction Problems: A Survey. Huu-Phuc Vo. 2020. (fulltext).
  25. Improving Program Locality in the GC using Hotness. Albert Mingkun Yang, Erik Österlund och Tobias Wrigstad. I PLDI 2020: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp 301-313, ASSOC COMPUTING MACHINERY, 2020. (DOI).
  26. ThinGC: complete isolation with marginal overhead. Albert Mingkun Yang, Eric Österlund, Jesper Wilhelmsson, Hanna Nyblom och Tobias Wrigstad. I ISMM 2020: Proceedings of the 2020 ACM SIGPLAN International Symposium on Memory Management, pp 74-86, Association for Computing Machinery (ACM), 2020. (DOI).
  27. User-centric Performance Optimization with Remote Radio Head Cooperation in C-RAN. Lei You och Di Yuan. I IEEE Transactions on Wireless Communications, volym 19, nummer 1, pp 340-353, 2020. (DOI, Extern länk).
  28. Leveraging Muiti-cell NOMA for Cell Edge. Zhanwei Yu, Lei You och Di Yuan. I 2020 IEEE International Conference on Advanced Networks and Telecommunications Systems  (IEEE ANTS), IEEE International Conference on Advanced Networks and Telecommunication Systems, Institute of Electrical and Electronics Engineers (IEEE), 2020. (DOI).
  29. Towards Pricing for Sensor-Cloud. Chunsheng Zhu, Xiuhua Li, Victor C. M. Leung, Laurence T. Yang, Edith C.-H. Ngai och Lei Shu. I IEEE Transactions on Cloud Computing, volym 8, nummer 4, pp 1018-1029, 2020. (DOI).
  30. Grammar-Based Testing for Little Languages: An Experience Report with Student Compilers. Phillip van Heerden, Moeketsi Raselimo, Konstantinos Sagonas och Bernd Fischer. I Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, pp 253-269, Association for Computing Machinery (ACM), 2020. (DOI, Fulltext).
  31. A Mechanised Semantics for HOL with Ad-hoc  Overloading. Johannes Åman Pohjola och Arve Gengelbach. I , EPiC Series in Computing, pp 498-515, 2020. (DOI, Fulltext, Extern länk).
  32. Automating regression testing on fat clientsAutomatiska regressionstester av feta klienter. Emil Österberg. Examensarbete, handledare: Ingemar Wararak, examinator: Lars-Åke Nordén, Lars-Henrik Eriksson, UPTEC IT nr 20010, 2020. (fulltext).

2019

  1. Optimal stateless model checking for reads-from equivalence under sequential consistency. Parosh Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan-Phong Ngo och Konstantinos Sagonas. I Proceedings of the ACM on Programming Languages, Association for Computing Machinery (ACM), 2019. (DOI, Fulltext, Extern länk, fulltext:print).
  2. BS-assisted Task Offloading for D2D Networks with Presence of User Mobility. Ghafour Ahani och Di Yuan. I 2019 IEEE 89TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2019-SPRING), IEEE Vehicular Technology Conference Proceedings, IEEE, 2019. (DOI).
  3. Teachers’ Awards: an Incentive for Pedagogical Development in Saudi Arabia. Fayiq Alghamdi, Aletta Nylén och Arnold Pears. I 2019 IEEE Frontiers in Education Conference (FIE), Frontiers in Education Conference, 2019. (DOI).
  4. Molecular Drivers of Crystallization Kinetics for Drugs in Supersaturated Aqueous Solutions. Amjad Alhalaweh, Ahmad Alzghoul och Christel A. S. Bergström. I Journal of Pharmaceutical Sciences, volym 108, nummer 1, pp 252-259, ELSEVIER SCIENCE INC, 2019. (DOI, fulltext:print).
  5. TOOLympics 2019: An overview of competitions in formal methods. Ezio Bartocci, Dirk Beyer, Paul E. Black, Grigory Fedyukovich, Hubert Garavel, Arnd Hartmanns, Marieke Huisman, Fabrice Kordon, Julian Nagele, Mihaela Sighireanu, Bernhard Steffen, Martin Suda, Geoff Sutcliffe, Tjark Weber och Akihisa Yamada. I Tools and Algorithms for the Construction and Analysis of Systems: 25 years of TACAS, Part III, volym 11429 av Lecture Notes in Computer Science, pp 3-24, Springer, 2019. (DOI, Fulltext, fulltext:print).
  6. Exploring declarative local-search neighbourhoods with constraint programming. Gustav Björdal, Pierre Flener, Justin Pearson och Peter J. Stuckey. I Principles and Practice of Constraint Programming, volym 11802 av Lecture Notes in Computer Science, pp 37-53, Springer, Switzerland, 2019. (DOI).
  7. Generating compound moves in local search by hybridisation with complete search. Gustav Björdal, Pierre Flener och Justin Pearson. I Integration of Constraint Programming, Artificial Intelligence, and Operations Research, volym 11494 av Lecture Notes in Computer Science, pp 95-111, Springer, 2019. (DOI).
  8. Run, Actor, Run: Towards Cross-Actor Language Benchmarking. Sebastian Blessing, Kiko Fernandez-Reyes, Albert Mingkun Yang, Sophia Drossopoulou och Tobias Wrigstad. I AGERE 2019 Proceedings of the 9th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control, pp 41-50, Association for Computing Machinery (ACM), 2019. (DOI, fulltext:postprint).
  9. The MaRiQ model: A quantitative approach to risk management. Elin Carlsson och Moa Mattsson. Examensarbete, handledare: Emelie Eriksson Thörnell, Martin Bergling, examinator: Elísabet Andrésdóttir, Björn Victor, UPTEC STS nr 19017, 2019. (fulltext).
  10. Developing a Monadic Type Checker for an Object-Oriented Language: An Experience Report. Elias Castegren och Kiko Fernandez-Reyes. I , pp 184-196, Association for Computing Machinery (ACM), 2019. (DOI, Extern länk).
  11. Resource Optimization for Joint LWA and LTE-U in Load-Coupled and Multi-Cell Networks. Bolin Chen, Lei You, Di Yuan, Nikolaos Pappas och Jie Zhang. I IEEE Communications Letters, volym 23, nummer 2, pp 330-333, 2019. (DOI).
  12. Optimizing Retention-Aware Caching in Vehicular Networks. Tao Deng, Pingzhi Fan och Di Yuan. I IEEE Transactions on Communications, volym 67, nummer 9, pp 6139-6152, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019. (DOI).
  13. Accurate optimization models for interference constrained bandwith allocation in cellular networks. Grit Ecker, Di Yuan, Arie M. C. A. Koster och Anke Schmeink. I Computers & Operations Research, volym 101, pp 1-12, 2019. (DOI).
  14. Godot: All the Benefits of Implicit and Explicit Futures. Kiko Fernandez-Reyes, Dave Clarke, Ludovic Henrio, Einar Broch Johnsen och Tobias Wrigstad. I 33rd European Conference on Object-Oriented Programming (ECOOP 2019), volym 134 av Leibniz International Proceedings in Informatics (LIPIcs), 2019. (DOI, Fulltext, Extern länk, fulltext:print).
  15. Courses-Concepts-Graphs as a Tool to Measure the Importance of Concepts in University Programmes. Eva Fjällstrom, Christoffer Forsberg, Felix Trulsson, Steffi Knorn, Kjell Staffas, Damiano Varagnolo och Tobias Wrigstad. I 2019 18th European Control Conference (ECC), pp 3076-3083, IEEE, 2019. (DOI).
  16. Multiple Authentic Project-Based Experiences and Persistent Learning?. Ville Isomöttönen och Aletta Nylén. I 2019 IEEE Frontiers in Education Conference (FIE 2019), Frontiers in Education Conference, IEEE, 2019. (DOI).
  17. Finding mislabeled data in datasets: A study on finding mislabeled data in datasetsby studying loss function. Salam Jadari. Examensarbete, handledare: Johan Nyberg, examinator: Elísabet Andrésdóttir, Michael Ashcroft, UPTEC STS nr 19028, 2019. (fulltext).
  18. Comparing node degrees in probabilistic networks. Amin Kaveh, Matteo Magnani och Christian Rohner. I Journal of Complex Networks, volym 7, nummer 5, pp 749-763, 2019. (DOI).
  19. Local measures for probabilistic networks. Amin Kaveh. Licentiatavhandling, IT licentiate theses / Uppsala University, Department of Information Technology nr 2019-004, Uppsala University, 2019. (fulltext).
  20. Reasoning about knowledge and messages in asynchronous multi-agent systems. Sophia Knight, Bastien Maubert och François Schwarzentruber. I Mathematical Structures in Computer Science, volym 29, nummer 1, pp 127-168, 2019. (DOI).
  21. Quantitative analysis of curricula coherence using directed graphs. Steffi Knorn, Damiano Varagnolo, Kjell Staffas, Tobias Wrigstad och Eva Fjällstrom. I IFAC-PapersOnLine, volym 52, nummer 9, pp 318-323, ELSEVIER, 2019. (DOI).
  22. Stateless model checking of the Linux kernel's read-copy update (RCU). Michalis Kokologiannakis och Konstantinos Sagonas. I International Journal on Software Tools for Technology Transfer, volym 21, nummer 3, pp 287-306, SPRINGER HEIDELBERG, 2019. (DOI, Fulltext, fulltext:print).
  23. An Analysis of the Consequences of the General Data Protection Regulation on Social Network Research. Andreas Kotsios, Matteo Magnani, Davide Vega, Luca Rossi och Irina Shklovski. I ACM Transactions on Social Computing, volym 2, nummer 3, Association for Computing Machinery (ACM), 2019. (DOI, fulltext:postprint).
  24. Performance of an OO compute kernel on the JVM: Revisiting Java as a language for scientific computing applications. Malin Källén och Tobias Wrigstad. I Proc. 16th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes, pp 144-156, ACM Press, New York, 2019. (DOI).
  25. Performance of an OO compute kernel on the JVM: Revisiting Java as a language for scientific computing applications (extended version). Malin Källén och Tobias Wrigstad. Technical report / Department of Information Technology, Uppsala University nr 2019-007, 2019. (Extern länk).
  26. Load Coupling and Energy Optimization in Multi-Cell and Multi-Carrier NOMA Networks. Lei Lei, Lei You, Yang Yang, Di Yuan, Symeon Chatzinotas och Bjoern Ottersten. I IEEE Transactions on Vehicular Technology, volym 68, nummer 11, pp 11323-11337, 2019. (DOI).
  27. Comparison of NoSQL Datastores for Large Scale Data Stream Log Analytics. Khalid Mahmood, Kjell Orsborn och Tore Risch. I 2019 IEEE International Conference on Smart Computing (SMARTCOMP), pp 478-480, IEEE, 2019. (DOI).
  28. Formal Approaches to Secure Compilation: A Survey of Fully Abstract Compilation and Related Work. Marco Patrignani, Amal Ahmed och Dave Clarke. I ACM Computing Surveys, volym 51, nummer 6, 2019. (DOI).
  29. Observing the tech, using meetup data to observe the evolution of the discourse around IoT. Luca Rossi, Matteo Magnani, Davide Vega D'Aurelio och Obaida Hanteer. I Selected Papers of Internet Research, SPIR, Annual Conference of the Association of Internet Researchers, 2019. (DOI).
  30. Concolic Testing of Higher-order Functional Languages. Konstantinos Sagonas. I Electronic Proceedings in Theoretical Computer Science, pp 2-2, Open Publishing Association, 2019. (Abstrakt).
  31. Metrics for Temporal Text Networks. Davide Vega och Matteo Magnani. I Temporal Network Theory, pp 147-160, Springer, 2019. (DOI, fulltext:preprint).
  32. Machine-Assisted Reformulation for MiniZinc. Huu-Phuc Vo. I , 2019. (fulltext:postprint).
  33. Towards Efficient Algorithms for Constraint Satisfaction Problems. Huu-Phuc Vo. I , 2019. (fulltext:postprint).
  34. Towards Efficient Solvers for Optimisation Problems. Huu-Phuc Vo. I Proc. 19th International Symposium on Cluster, Cloud and Grid Computing, IEEE-ACM International Symposium on Cluster Cloud and Grid Computing, pp 169-172, 2019. (DOI).
  35. Routing and wavelength assignment vs EDFA reliability performance in optical backbone networks: An operational cost perspective. Pawel Wiatr, Jiajia Chen, Paolo Monti, Lena Wosinska och Di Yuan. I Optical Switching and Networkning Journal, volym 31, pp 211-217, 2019. (DOI).
  36. Network Optimization of Evolving Mobile Systems with Presence of Interference Coupling. Lei You. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1843, Acta Universitatis Upsaliensis, Uppsala, 2019. (fulltext, preview image).
  37. Joint Resource Allocation for Latency-Sensitive Services Over Mobile Edge Computing Networks With Caching. Jiao Zhang, Xiping Hu, Zhaolong Ning, Edith Ngai, Li Zhou, Jibo Wei, Jun Cheng, Bin Hu och Victor C. M. Leung. I IEEE Internet of Things Journal, volym 6, nummer 3, pp 4283-4294, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2019. (DOI).
  38. Announcement as effort on topological spaces. Hans van Ditmarsch, Sophia Knight och Aybüke Özgün. I Synthese, volym 196, nummer 7, pp 2927-2969, 2019. (DOI, Fulltext).
  39. Progress Report: Exploring API Design for Capabilities for Programming with Arrays. Beatrice Åkerblom, Elias Castegren och Tobias Wrigstad. I Proceedings Of The 12Th Workshop On Implementation, Compilation And Optimization Of Object-Oriented Languages, Programs And Systems (ICOOOLPS' 19), Association for Computing Machinery (ACM), New York, 2019. (DOI).

2018

  1. Optimal Stateless Model Checking under the Release-Acquire Semantics. Parosh Abdulla, Mohamed Faouzi Atig, Bengt Jonsson och Tuan-Phong Ngo. I Proceedings of the ACM on Programming Languages, volym 2, nummer OOPSLA, pp 1-29, Association for Computing Machinery (ACM), 2018. (DOI, Fulltext, fulltext:print).
  2. On optimal proactive and retention-aware caching with user mobility. Ghafour Ahani och Di Yuan. I 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall), IEEE Vehicular Technology Conference Proceedings, IEEE, 2018. (DOI).
  3. Changing the Educational Epistemologies of Computer Science Teachers: A Case Study of the Kingdom of Saudi Arabia. Fayiq Alghamdi, Aletta Nylén och Arnold Pears. I 2018 IEEE Frontiers in Education Conference (FIE), Frontiers in Education Conference, IEEE, Piscataway, NJ, 2018. (DOI).
  4. Computer science teachers perspectives on competencies: A case study in the Kingdom of Saudi Arabia. Fayiq Alghamdi, Arnold Pears och Aletta Nylén. I Informatics in Schools. Fundamentals of Computer Science and Software Engineering, volym 11169 av Lecture Notes in Computer Science, pp 129-140, Springer, 2018. (DOI).
  5. Effective Techniques for Stateless Model Checking. Stavros Aronis. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1602, Acta Universitatis Upsaliensis, Uppsala, 2018. (fulltext, preview image).
  6. Optimal dynamic partial order reduction with observers. Stavros Aronis, Bengt Jonsson, Magnus Lång och Konstantinos Sagonas. I Tools and Algorithms for the Construction and Analysis of Systems: Part II, volym 10806 av Lecture Notes in Computer Science, pp 229-248, Springer, 2018. (DOI, Fulltext, Förlagets fulltext - Bok, fulltext:print).
  7. International Workshop on Mining Attributed Networks (MATNET 2018) Chairs' Welcome. Martin Atzmueller, Sabrina Gaito, Roberto Interdonato, Rushed Kanawati, Christine Largeron, Matteo Magnani och Alessandra Sala. I WWW '18: Companion Proceedings of the Web Conference 2018, pp 1231-1233, Association for Computing Machinery (ACM), 2018. (DOI).
  8. Preface for the special issue on Interaction and Concurrency Experience 2016. Massimo Bartoletti, Ludovic Henrio, Sophia Knight och Hugo Torres Vieira. I The Journal of logical and algebraic methods in programming, volym 98, pp 26-26, 2018. (DOI).
  9. Declarative local-search neighbourhoods in MiniZinc. Gustav Björdal, Pierre Flener, Justin Pearson, Peter J. Stuckey och Guido Tack. I PROCEEDINGS OF THE 2018 IEEE 30TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), pp 98-105, IEEE Computer Society, 2018. (DOI).
  10. Using XGBoost to classify theBeihang Keystroke Dynamics Database. Johanna Blomqvist. Examensarbete, handledare: David Strömberg, Daniel Lindberg, examinator: Tomas Nyberg, Michael Ashcroft, UPTEC F nr 18049, 2018. (fulltext).
  11. C?: A New Modular Approach to Implementing Efficient and Tunable Collections. Stephan Brandauer, Elias Castegren och Tobias Wrigstad. I 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. (DOI).
  12. Structured Data. Stephan Brandauer. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1749, Acta Universitatis Upsaliensis, Uppsala, 2018. (fulltext, preview image).
  13. Quantifying layer similarity in multiplex networks: a systematic study. Piotr Brodka, Anna Chmiel, Matteo Magnani och Giancarlo Ragozini. I Royal Society Open Science, volym 5, nummer 8, ROYAL SOC, 2018. (DOI, Fulltext, fulltext:print).
  14. Attached and Detached Closures in Actors. Elias Castegren, Dave Clarke, Kiko Fernandez-Reyes, Tobias Wrigstad och Albert Mingkun Yang. I Proceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control, pp 54-61, ACM Digital Library, 2018. (DOI).
  15. Bestow and Atomic: Concurrent programming using isolation, delegation and grouping. Elias Castegren, Joel Wallin och Tobias Wrigstad. I The Journal of logical and algebraic methods in programming, volym 100, pp 130-151, 2018. (DOI).
  16. Capability-Based Type Systems for Concurrency Control. Elias Castegren. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1611, Acta Universitatis Upsaliensis, Uppsala, 2018. (fulltext, preview image).
  17. OOlong: An Extensible Concurrent Object Calculus. Elias Castegren och Tobias Wrigstad. I SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied Computing, pp 1022-1029, 2018. (DOI, fulltext:postprint).
  18. OOlong: A Concurrent Object Calculus for Extensibility and Reuse. Elias Castegren och Tobias Wrigstad. I ACM SIGAPP Applied Computing Review, volym 18, nummer 4, pp 47-60, Association for Computing Machinery, 2018. (DOI).
  19. Cost-optimal caching for D2D networks with user mobility: Modeling, analysis, and computational approaches. Tao Deng, Ghafour Ahani, Pingzhi Fan och Di Yuan. I IEEE Transactions on Wireless Communications, volym 17, nummer 5, pp 3082-3094, 2018. (DOI).
  20. Device caching for network offloading: Delay minimization with presence of user mobility. Tao Deng, Lei You, Pingzhi Fan och Di Yuan. I IEEE Wireless Communications Letters, volym 7, nummer 4, pp 558-561, 2018. (DOI).
  21. Exploring properties of a telecommunication protocol with message delay using interactive theorem prover. Catherine Dubois, Olga Grinchtein, Justin Pearson och Mats Carlsson. I Software Engineering and Formal Methods, volym 10886 av Lecture Notes in Computer Science, pp 239-253, Springer, 2018. (DOI).
  22. Thematic ranking of object summaries for keyword search. Georgios J. Fakas, Yilun Cai, Zhi Cai och Nikos Mamoulis. I Data & Knowledge Engineering, volym 113, pp 1-17, 2018. (DOI).
  23. A generalized force-directed layout for multiplex sociograms. Zahra Fatemi, Matteo Magnani och Mostafa Salehi. I Social Informatics: 10th International Conference, SocInfo 2018, St. Petersburg, Russia, September 25-28, 2018, Proceedings, Part I, volym 0302-9743 av Lecture Notes in Computer Science, pp 212-227, Springer, 2018. (DOI).
  24. Forward to a Promising Future. Kiko Fernandez-Reyes, Dave Clarke, Elias Castegren och Huu-Phuc Vo. I Conference proceedings COORDINATION 2018, 2018. (fulltext:preprint).
  25. The impact of opt-in gamification on students' grades in a software design course. Kiko Fernandez-Reyes, Dave Clarke och Janina Hornbach. I Proceedings of the 21st ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings, pp -97, ACM Publications, New York, NY, USA, 2018. (DOI).
  26. Correctness of a concurrent object collector for actor languages. Juliana Franco, Sylvan Clebsch, Sophia Drossopoulou, Jan Vitek och Tobias Wrigstad. I Programming Languages and Systems, volym 10801 av Lecture Notes in Computer Science, pp 885-911, Springer, 2018. (DOI, Fulltext).
  27. Safely Abstracting Memory Layouts. Juliana Franco, Alexandros Tasos, Sophia Drossopoulou, Tobias Wrigstad och Susan Eisenbach. I 20th Workshop on Formal Techniques for Java-like Programs, 2018. (Extern länk).
  28. Model-theoretic Conservative Extension of Definitional Theories. Arve Gengelbach och Tjark Weber. I Electronical Notes in Theoretical Computer Science, volym 338, pp 133-145, 2018. (DOI, Fulltext, fulltext:print).
  29. From Interaction to Participation: The Role of the Imagined Audience in Social Media Community Detection and an Application to Political Communication on Twitter. Obaida Hanteer, Luca Rossi, Davide Vega och Matteo Magnani. I 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp 531-534, IEEE Computer Society, 2018. (DOI).
  30. How students get going: Triggers for students' learning in project-based education. Ville Isomöttönen och Aletta Nylén. I Proc. 23rd Conference on Innovation and Technology in Computer Science Education, pp 117-122, ACM Press, New York, 2018. (DOI).
  31. HiPErJiT: A Profile-Driven Just-in-Time Compiler for Erlang. Konstantinos Kallas och Konstantinos Sagonas. I Proceedings of the 30th Symposium on Implementation and Application ff Functional Languages (IFL 2018), pp 25-36, Association for Computing Machinery (ACM), 2018. (DOI).
  32. Understanding initial undergraduate expectations and identity in computing studies. Päivi Kinnunen, Matthew Butler, Michael Morgan, Aletta Nylén, Anne-Kathrin Peters, Jane Sinclair, Sara Kalvala och Erkki Pesonen. I European Journal of Engineering Education, volym 43, nummer 2, pp 201-218, 2018. (DOI).
  33. Queue Delegation Locking. David Klaftenegger, Konstantinos Sagonas och Kjell Winblad. I IEEE Transactions on Parallel and Distributed Systems, volym 29, nummer 3, pp 687-704, IEEE COMPUTER SOC, 2018. (DOI).
  34. Effective Stateless Model Checking for C/C++ Concurrency. Michalis Kokologiannakis, Ori Lahav, Konstantinos Sagonas och Viktor Vafeiadis. I Proceedings of the ACM on Programming Languages, volym 2, nummer POPL, pp 1-32, ACM Press, 2018. (DOI, Fulltext, fulltext:print).
  35. Efficient minimum-energy scheduling with machine-learning based predictions for multiuser MISO systems. Lei Lei, Thang X. Vu, Lei You, Scott Fowler och Di Yuan. I Proc. International Conference on Communications: ICC 2018, IEEE Communications Society, 2018. (DOI).
  36. Power and Load Optimization in Interference-Coupled Non-Orthogonal Multiple Access Networks. Lei Lei, Lei You, Yang Yang, Di Yuan, Symeon Chatzinotas och Bjorn Ottersten. I 2018 IEEE Global Communications Conference (GLOBECOM), IEEE Global Communications Conference, IEEE, 2018. (DOI).
  37. A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. Jonatan Lindén och Bengt Jonsson. Technical report / Department of Information Technology, Uppsala University nr 2018-003, 2018.
  38. Automating Targeted Property-Based Testing. Andreas Löscher och Konstantinos Sagonas. I 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. (DOI).
  39. Delayed sampling and automatic Rao-Blackwellization of probabilistic programs. Lawrence Murray, Daniel Lundén, Jan Kudlicka, David Broman och Thomas B. Schön. I Proceedings of the 21st International Conference on Artificial Intelligence and Statistics (AISTATS), Lanzarote, Spain, April, 2018, Proceedings of Machine Learning Research, 2018. (Extern länk).
  40. Why are we here?: The educational value model (EVM) as a framework to investigate the role of students’ professional identity development. Aletta Nylén, Mats Daniels, Arnold Pears, Åsa Cajander, Roger McDermott och Ville Isomöttönen. I 2018 IEEE Frontiers in Education Conference (FIE), Frontiers in Education Conference, IEEE, Piscataway, NJ, 2018. (DOI).
  41. Application of the German Traffic Sign Recognition Benchmark on the VGG16 network using transfer learning and bottleneck features in Keras. Siri Persson. Examensarbete, handledare: Magnus Lundstedt, examinator: Tomas Nyberg, Michael Ashcroft, UPTEC F nr 18 003, 2018. (fulltext).
  42. A contention adapting approach to concurrent ordered sets. Konstantinos Sagonas och Kjell Winblad. I Journal of Parallel and Distributed Computing, volym 115, pp 1-19, ACADEMIC PRESS INC ELSEVIER SCIENCE, 2018. (DOI).
  43. Progress on Algorithms for Stateless Model Checking. Konstantinos Sagonas. I 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. (DOI, Extern länk).
  44. Extending SHAPES for SIMD Architectures –: An approach to native support for Struct of Arrays in languages. Alexandros Tasos, Juliana Franco, Tobias Wrigstad, Sophia Drossopoulou och Susan Eisenbach. I 13th Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems Workshop, 2018. (Extern länk).
  45. Partial and Overlapping Community Detection in Multiplex Social Networks. Nazanin Afsarmanesh Tehrani och Matteo Magnani. I 10th International Conference on Social Informatics (SocInfo2018 ), volym 11186 av Lecture Notes in Computer Science, pp 15-28, Springer, 2018. (DOI).
  46. Foundations of Temporal Text Networks. Davide Vega och Matteo Magnani. I Applied Network Science, volym 3, nummer 25, 2018. (DOI, Fulltext, fulltext:print).
  47. Optical Interconnect Architectures for Datacenters. Pawel Wiatr, Di Yuan, Lena Wosinska och Jiajia Chen. I 2018 IEEE Photonics Conference (IPC), IEEE Photonics Conference, IEEE, 2018. (DOI).
  48. Reliability performance aware routing. Pawel Wiatr och Di Yuan. I Proc. 10th International Workshop on Resilient Networks Design and Modeling, IEEE, 2018. (DOI).
  49. Dynamic Adaptations of Synchronization Granularity in Concurrent Data Structures. Kjell Winblad. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1684, Acta Universitatis Upsaliensis, Uppsala, 2018. (fulltext, preview image).
  50. Lock-free Contention Adapting Search Trees. Kjell Winblad, Konstantinos Sagonas och Bengt Jonsson. I The 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, New York, NY, USA, 2018. (DOI).
  51. Resource Optimization With Flexible Numerology and Frame Structure for Heterogeneous Services. Lei You, Qi Liao, Nikolaos Pappas och Di Yuan. I IEEE Communications Letters, volym 22, nummer 12, pp 2579-2582, IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2018. (DOI).
  52. Resource optimization with load coupling in multi-cell NOMA. Lei You, Di Yuan, Lei Lei, Sumei Sun, Symeon Chatzinotas och Björn Ottersten. I IEEE Transactions on Wireless Communications, volym 17, nummer 7, pp 4735-4749, 2018. (DOI).
  53. Private announcements on topological spaces. Hans van Ditmarsch, Sophia Knight och Aybüke Özgün. I Studia Logica: An International Journal for Symbolic Logic, volym 106, nummer 3, pp 481-513, 2018. (DOI, Fulltext).
  54. Parallel Programming With Arrays in Kappa. Beatrice Åkerblom, Elias Castegren och Tobias Wrigstad. I 5th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, 2018. (Extern länk).

2017

  1. Comparing source sets and persistent sets for partial order reduction. Parosh Abdulla, Stavros Aronis, Bengt Jonsson och Konstantinos Sagonas. I Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, volym 10460 av Lecture Notes in Computer Science, pp 516-536, Springer, 2017. (DOI).
  2. Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. Parosh Abdulla, Stavros Aronis, Bengt Jonsson och Konstantinos Sagonas. I Journal of the ACM, volym 64, nummer 4, Association for Computing Machinery (ACM), 2017. (DOI).
  3. Stateless model checking for TSO and PSO. Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson och Konstantinos Sagonas. I Acta Informatica, volym 54, nummer 8, pp 789-818, 2017. (DOI).
  4. Why do female students choose to study CS in the Kingdom of Saudi Arabia?. Fayiq Alghamdi. I Proc. 5th International Conference on Learning and Teaching in Computing and Engineering, International Conference on Teaching and Learning in Computing and Engineering, pp 49-53, IEEE Computer Society, 2017. (DOI, fulltext:postprint).
  5. MiniZinc with strings. Roberto Amadini, Pierre Flener, Justin Pearson, Joseph D. Scott, Peter J. Stuckey och Guido Tack. I Logic-Based Program Synthesis and Transformation, volym 10184 av Lecture Notes in Computer Science, pp 59-75, Springer, 2017. (DOI).
  6. Testing And Verifying Chain Repair Methods For CORFU Using Stateless Model Checking. Stavros Aronis, Konstantinos Sagonas och Scott Lystig Fritchie. I , volym 10510 av Lecture Notes in Computer Science, pp 227-242, Springer, Cham, 2017. (DOI, fulltext:postprint).
  7. The shared-memory interferences of Erlang/OTP built-ins. Stavros Aronis och Konstantinos Sagonas. I Proceedings Of The 16Th Acm Sigplan International Workshop On Erlang (Erlang '17), pp 43-54, Association for Computing Machinery (ACM), New York, 2017. (DOI, fulltext:postprint).
  8. Selected and extended papers from Partial Evaluation and Program Manipulation 2015 (PEPM ' 15). Kenichi Asai och Konstantinos Sagonas. I Science of Computer Programming, volym 137, pp 1-1, ELSEVIER SCIENCE BV, 2017. (DOI).
  9. Proc. 10th Interaction and Concurrency Experience. Massimo Bartoletti, Laura Bocchi, Ludovic Henrio och Sophia Knight (red). Volym 261 av Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2017. (DOI, Fulltext).
  10. A Join Operator for Property Graphs. Giacomo Bergami, Matteo Magnani och Danilo Montesi. I EDBT/ICDT Workshops, 2017.
  11. Deriving Probability Density Functions from Probabilistic Functional Programs. Sooraj Bhat, Johannes Borgström, Andrew D. Gordon och Claudio Russo. I Logical Methods in Computer Science, volym 13, nummer 2, 2017. (DOI, Fulltext).
  12. Mining for Safety using Interactive Trace Analysis. Stephan Brandauer och Tobias Wrigstad. I Pre-Proceedings - Fifteenth International Workshop on Quantitative Aspects of Programming Languages and Systems, 2017. (Pre-Proceedings, fulltext:print).
  13. Spencer: Interactive Heap Analysis for the Masses. Stephan Brandauer och Tobias Wrigstad. I 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. (DOI, Extern länk, fulltext:postprint).
  14. Multiple time-series forecasting on mobile network data using an RNN-RBM model. Arvid Bäärnhielm. Examensarbete, handledare: Tor Kvernvik, examinator: Tomas Nyberg, Justin Pearson, UPTEC F nr 17005, 2017. (fulltext).
  15. Unexpected student behaviour and learning opportunities: Using the theory of planned behaviour to analyse a critical incident. Åsa Cajander, Mats Daniels, Diane Golay, Jonas Moll, Aletta Nylén, Arnold Pears, Anne-Kathrin Peters och Roger McDermott. I Proc. 47th ASEE/IEEE Frontiers in Education Conference, IEEE Press, Piscataway, NJ, 2017. (DOI).
  16. Modelling and verification of user interactions using constraint programming. Mats Carlsson, Olga Grinchtein och Justin Pearson. I Proc. 3rd International Conference on Software Quality, Reliability and Security, pp 541-547, IEEE Computer Society, 2017. (DOI).
  17. Actors without Borders: Amnesty for Imprisoned State. Elias Castegren och Tobias Wrigstad. I , pp 10-20, 2017. (DOI, Fulltext, Fulltext, fulltext:postprint).
  18. Reference Capabilities for Concurrency & Scalability: an Experience Report. Elias Castegren och Tobias Wrigstad. I , 2017. (fulltext:preprint).
  19. Relaxed Linear References for Lock-free Data Structures. Elias Castegren och Tobias Wrigstad. I , pp 47:1-47:31, 2017. (DOI, Fulltext, Extern länk, fulltext:postprint).
  20. Types for CAS: Relaxed Linearity with Ownership Transfer. Elias Castegren och Tobias Wrigstad. 2017.
  21. Orca: GC and Type System Co-design for Actor Languages. Sylvan Clebsch, Juliana Franco, Sophia Drossopoulou, Albert Mingkun Yang, Tobias Wrigstad och Jan Vitek. I Proceedings of the ACM on Programming Languages, volym 1, nummer OOPSLA, pp 1-28, ACM, 2017. (DOI, Fulltext, Extern länk, fulltext:print).
  22. A survey of active object languages. Frank De Boer, Vlad Serbanescu, Reiner Hähnle, Ludovic Henrio, Justine Rochas, Crystal Chang Din, Einar Broch Johnsen, Marjan Sirjani, Ehsan Khamespanah, Kiko Fernández-Reyes och Albert Mingkun Yang. I ACM Computing Surveys, volym 50, nummer 5, Association for Computing Machinery (ACM), 2017. (DOI).
  23. Auto-tabling for subproblem presolving in MiniZinc. Jip J. Dekker, Gustav Björdal, Mats Carlsson, Pierre Flener och Jean-Noël Monette. I Constraints, volym 22, nummer 4, pp 512-529, 2017. (DOI, Fulltext).
  24. Cost-Optimal Caching for D2D Networks with Presence of User Mobility. Tao Deng, Ghafour Ahani, Pingzhi Fan och Di Yuan. I GLOBECOM 2017 - 2017 IEEE Global Communications Conference, IEEE Global Communications Conference, IEEE, 2017. (DOI).
  25. Affine killing: Semantics for stopping the ParT. Kiko Fernandez-Reyes och Dave Clarke. I Proc. 2nd International Workshop on Type-Driven Development, ACM Press, New York, 2017. (fulltext:postprint).
  26. Analysis, synthesis and application of automaton-based constraint descriptions. María Andreína Francisco Rodríguez. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1591, Acta Universitatis Upsaliensis, Uppsala, 2017. (fulltext, preview image, errata).
  27. Automatic generation of descriptions of time-series constraints. María Andreína Francisco Rodríguez, Pierre Flener och Justin Pearson. I IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), Proceedings-International Conference on Tools With Artificial Intelligence, pp 102-109, IEEE Computer Society, 2017. (DOI).
  28. You can have it all: abstraction and good cache performance. Juliana Franco, Martin Hagelin, Tobias Wrigstad, Sophia Drossopoulou och Susan Eisenbach. I 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. (DOI, fulltext:print).
  29. Shortest Paths in Multiplex Networks. Saeed Ghariblou, Mostafa Salehi, Matteo Magnani och Mahdi Jalili. I Scientific Reports, volym 7, 2017. (DOI, Fulltext, fulltext:print).
  30. Concolic testing for functional languages. Aggelos Giantsios, Nikolaos Papaspyrou och Konstantinos Sagonas. I Science of Computer Programming, volym 147, pp 109-134, 2017. (DOI).
  31. Stateless model checking of the Linux kernel's hierarchical read-copy-update (tree RCU). Michalis Kokologiannakis och Konstantinos Sagonas. I Proc. 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, pp 172-181, ACM Press, New York, 2017. (DOI).
  32. A deep learning approach for optimizing content delivering in cache-enabled HetNet. Lei Lei, Lei You, Gaoyang Dai, Thang Xuan Vu, Di Yuan och Symeon Chatzinotas. I Proc. 14th International Symposium on Wireless Communication Systems, pp 449-453, IEEE, 2017. (DOI).
  33. Blockchain technology in Scania Services: An investigative study of how blockchain technology can be utilized by Scania. Jim Lindberg. Examensarbete, handledare: Susan Miller Tiedemann, examinator: Elísabet Andrésdóttir, Björn Victor, UPTEC STS nr 17031, 2017. (fulltext).
  34. Targeted property-based testing. Andreas Löscher och Konstantinos Sagonas. I Proc. 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, pp 46-56, ACM Press, New York, 2017. (DOI).
  35. Introduction to the special issue on multilayer networks. Matteo Magnani och Stanley Wasserman. I NETWORK SCIENCE, volym 5, nummer 2, pp 141-143, CAMBRIDGE UNIV PRESS, 2017. (DOI).
  36. The authenticity of 'authentic' assessment: Some faculty perceptions. Roger McDermott, Mark Zarb, Mats Daniels, Aletta Nylén, Arnold Pears, Ville Isomöttönen och Michael Caspersen. I Proc. 47th ASEE/IEEE Frontiers in Education Conference, IEEE Press, Piscataway, NJ, 2017. (DOI).
  37. VisDM-A Data Stream Visualization Platform. Lars Melander, Kjell Orsborn, Tore Risch och Daniel Wedlund. I Database Systems For Advanced Applications (DASFAA 2017), Proceedings Pt II, volym 10178 av Lecture Notes in Computer Science, pp 677-680, SPRINGER INTERNATIONAL PUBLISHING AG, 2017. (DOI).
  38. Examining manual and semi-automated methods of analysing MOOC data for computing education. Michael Morgan, Matthew Butler, Neena Thota, Aletta Nylén, Anna Eckerdal och Päivi Kinnunen. I Proc. 17th International Conference on Computing Education Research: Koli Calling, pp 153-157, ACM Press, New York, 2017. (DOI).
  39. Exploring the critical incident technique to encourage reflection during project-based learning. Aletta Nylén och Ville Isomöttönen. I Proc. 17th International Conference on Computing Education: Koli Calling, pp 88-97, ACM Press, New York, 2017. (DOI).
  40. Open-ended projects opened up – aspects of openness. Aletta Nylén, Mats Daniels, Ville Isomöttönen och Roger McDermott. I Proc. 47th ASEE/IEEE Frontiers in Education Conference, IEEE Press, Piscataway, NJ, 2017. (DOI).
  41. Why are we here?: Student perspectives on the goal of STEM higher education. Aletta Nylén, Åsa Cajander, Mats Daniels, Arnold Pears och Roger McDermott. I Proc. 47th ASEE/IEEE Frontiers in Education Conference, IEEE Press, Piscataway, NJ, 2017. (DOI).
  42. Weak Nominal Modal Logic. Joachim Parrow, Tjark Weber, Johannes Borgström och Lars-Henrik Eriksson. I Formal Techniques for Distributed Objects, Components, and Systems, volym 10321 av Lecture Notes in Computer Science, pp 179-193, Springer, 2017. (DOI).
  43. Typed connector families and their semantics. Jose Proenca och Dave Clarke. I Science of Computer Programming, volym 146, pp 28-49, 2017. (DOI).
  44. The Contention Avoiding Concurrent Priority Queue. Konstantinos Sagonas och Kjell Winblad. I Languages and Compilers for Parallel Computing, volym 10136 av Lecture Notes in Computer Science, pp 314-330, Springer, 2017. (DOI).
  45. Design and implementation of bounded-length sequence variables. Joseph D. Scott, Pierre Flener, Justin Pearson och Christian Schulte. I Integration of AI and OR Techniques in Constraint Programming, volym 10335 av Lecture Notes in Computer Science, pp 51-67, 2017. (DOI).
  46. 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 och Kjell Winblad. I ACM Transactions on Programming Languages and Systems, volym 39, nummer 4, 2017. (DOI).
  47. A Radar Signal Processing Case Study for Dataflow Programming of Manycores. Zain Ul-Abdin och Albert Mingkun Yang. I Journal of Signal Processing Systems, volym 87, nummer 1, pp 49-62, 2017. (DOI).
  48. A perspective from Vietnamese students on teaching of soft skills. Huu-Phuc Vo, Anders Berglund och Mats Daniels. I Proc. 5th International Conference on Learning and Teaching in Computing and Engineering, International Conference on Teaching and Learning in Computing and Engineering, pp 23-24, IEEE Computer Society, 2017. (DOI).
  49. Digital Capital: A platform for developing computational thinking. Tina Vrieler. I Proc. 17th International Conference on Computing Education Research: Koli Calling, pp 205-206, ACM Press, New York, 2017. (DOI).
  50. What computing instructors did last summer: Experiences and lessons learned. Tina Vrieler, Aletta Nylén och Åsa Cajander. I Proc. 47th ASEE/IEEE Frontiers in Education Conference, IEEE Press, Piscataway, NJ, 2017. (DOI).
  51. Device Reliability Performance Awareness: Impact of RWA on EDFA Failure Reparation Cost in Optical Networks. Pawel Wiatr, Jiajia Chen, Paolo Monti, Lena Wosinska och Di Yuan. I Proceedings of 2017 9Th International Workshop On Resilient Networks Design And Modeling (Rndm), IEEE, 2017.
  52. Mastery Learning-Like Teaching with Achievements. Tobias Wrigstad och Elias Castegren. I , 2017. (fulltext:postprint).
  53. Scalable validation of industrial equipment using a functional DSMS. Cheng Xu, Elisabeth Källström, Tore Risch, John Lindström, Lars Håkansson och Jonas Larsson. I Journal of Intelligent Information Systems, volym 48, nummer 3, pp 553-577, 2017. (DOI, Fulltext, fulltext:print).
  54. Type-assisted automatic garbage collection for lock-free data structures. Albert Mingkun Yang och Tobias Wrigstad. I SIGPLAN notices, volym 52, nummer 9, pp 14-24, ACM Press, New York, 2017. (DOI).
  55. A Framework for Optimizing Multi-cell NOMA: Delivering Demand with Less Resource. Lei You, Lei Lei, Di Yuan, Sumei Sun, Symeon Chatzinotas och Bjoern Ottersten. I GLOBECOM 2017 - 2017 IEEE Global Communications Conference, IEEE Global Communications Conference, IEEE, 2017. (DOI).
  56. Energy-Aware Wireless Relay Selection in Load-Coupled OFDMA Cellular Networks. Lei You, Di Yuan, Nikolaos Pappas och Peter Varbrand. I IEEE Communications Letters, volym 21, nummer 1, pp 144-147, Institute of Electrical and Electronics Engineers (IEEE), 2017. (DOI).
  57. Joint CoMP-Cell Selection and Resource Allocation in Fronthaul-Constrained C-RAN. Lei You och Di Yuan. I Proc. 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, IEEE, 2017. (DOI).
  58. From Machine Arithmetic to Approximations and back again: Improved SMT Methods for Numeric Data Types. Aleksandar Zeljic. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1603, Acta Universitatis Upsaliensis, Uppsala, 2017. (fulltext, preview image).

2016

  1. Recency-Bounded Verification of Dynamic Database-Driven Systems. Parosh Aziz Abdulla, Aiswarya Cyriac, Mohamed Faouzi Atig, Marco Montali och Othmane Rezine. I PODS'16: PROCEEDINGS OF THE 35TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, pp 195-210, 2016. (DOI).
  2. Women in computing in Saudi Arabia. Fayiq Alghamdi. I Proc. 3rd ACM-W Europe Celebration of Women in Computing, pp 1-3, 2016. (fulltext:print).
  3. Semantic Web Queries over Scientific Data. Andrej Andrejev. Doktorsavhandling, Uppsala Dissertations from the Faculty of Science and Technology nr 121, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  4. Global Constraint Catalog: Volume II, time-series constraints. Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson och Helmut Simonis. Computing Research Repository nr 1609.08925, 2016. (Extern länk).
  5. Systematic derivation of bounds and glue constraints for time-series constraints. Ekaterina Arafailova, Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson och Helmut Simonis. I Principles and Practice of Constraint Programming: CP 2016, volym 9892 av Lecture Notes in Computer Science, pp 13-29, Springer, 2016. (DOI).
  6. Time-series constraints: Improvements and application in CP and MIP contexts. Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson och Helmut Simonis. I Integration of AI and OR Techniques in Constraint Programming, volym 9676 av Lecture Notes in Computer Science, pp 18-34, Springer, 2016. (DOI).
  7. Multi-domain alias matching using machine learning. Michael Ashcroft, Fredrik Johansson, Lisa Kaati och Amendra Shrestha. I Proc. 3rd European Network Intelligence Conference, pp 77-84, IEEE, 2016. (DOI, fulltext:postprint).
  8. Multilayer Analysis of Online Illicit Marketplaces. Michael Ashcroft, Matteo Magnani, Davide Vega, Danilo Montesi och Luca Rossi. I 2016 European Intelligence And Security Informatics Conference (EISIC), European Intelligence and Security Informatics Conference, pp 199-199, IEEE, 2016. (DOI).
  9. Framework for real-time clustering over sliding windows. Sobhan Badiozamany, Kjell Orsborn och Tore Risch. I Proc. 28th International Conference on Scientific and Statistical Database Management, pp 1-13, ACM Press, New York, 2016. (DOI).
  10. Real-time data stream clustering over sliding windows. Sobhan Badiozamany. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1431, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  11. Preface. Massimo Bartoletti, Ludovic Henrio, Sophia Knight, Hugo Torres Vieira, Alexandra Silva, Youssef Arbach, David S. Karcher, Kirstin Peters och Uwe Nestmann. I Electronic Proceedings in Theoretical Computer Science, nummer 223, OPEN PUBL ASSOC, 2016.
  12. Proc. 9th Interaction and Concurrency Experience. Massimo Bartoletti, Ludovic Henrio, Sophia Knight och Hugo Torres Vieira (red). Volym 223 av Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2016. (DOI, Fulltext).
  13. Psi-Calculi in Isabelle. Jesper Bengtson, Joachim Parrow och Tjark Weber. I Journal of automated reasoning, volym 56, nummer 1, pp 1-47, 2016. (DOI).
  14. Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing. Johan Blom, Bengt Jonsson och Sven-Olof Nyström. I , 2016. (DOI).
  15. A Lambda-Calculus Foundation for Universal Probabilistic Programming. Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon och Marcin Szymczak. I SIGPLAN notices, volym 51, nummer 9, pp 33-46, 2016. (DOI, fulltext:postprint).
  16. A Sorted Semantic Framework for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor och Johannes Åman Pohjola. I Logical Methods in Computer Science, volym 12, nummer 1, pp 1-49, 2016. (DOI, Fulltext, fulltext:postprint).
  17. Fabular: Regression formulas as probabilistic programming. Johannes Borgström, Andrew D. Gordon, Long Ouyang, Claudio Russo, Adam Scibior och Marcin Szymczak. I Proc. 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volym 51(1) av ACM SIGPLAN Notices, pp 271-283, ACM Press, New York, 2016. (DOI, fulltext:postprint).
  18. A formal model of service-oriented dynamic object groups. Einar Broch Johnsen, Olaf Owe, Dave Clarke och Joakim Bjørk. I Science of Computer Programming, volym 115–116, pp 3-22, 2016. (DOI).
  19. Extended versions of papers presented at WS-FM 2014 and Beat 2014. Marco Carbone, Thomas Hildebrandt, Joachim Parrow och Matthias Weidlich. I Formal Aspects of Computing, volym 28, nummer 4, pp 529-530, 2016. (DOI).
  20. Active learning for extended finite state machines. Sofia Cassel, Falk Howar, Bengt Jonsson och Bernhard Steffen. I Formal Aspects of Computing, volym 28, nummer 2, pp 233-263, 2016. (DOI).
  21. Determining progress in writing competency by assessing students’ argumentation. Sofia Cassel och Aletta Nylén. I Proc. 46th ASEE/IEEE Frontiers in Education Conference, IEEE Press, Piscataway, NJ, 2016. (DOI).
  22. Kappa: Insights, Current Status and Future Work. Elias Castegren och Tobias Wrigstad. I , 2016. (Extended abstract, fulltext:postprint).
  23. LOLCAT: Relaxed Linear References for Lock-free Programming. Elias Castegren och Tobias Wrigstad. Technical report / Department of Information Technology, Uppsala University nr 2016-013, 2016. (fulltext).
  24. Reference Capabilities for Concurrency Control. Elias Castegren och Tobias Wrigstad. I ECOOP 2016 — Object-Oriented Programming, 2016. (fulltext:postprint).
  25. Reference Capabilities for Trait Based Reuse and Concurrency Control. Elias Castegren och Tobias Wrigstad. Technical report / Department of Information Technology, Uppsala University nr 2016-007, 2016. (fulltext).
  26. Types for CAS: Relaxed Linearity with Ownership Transfer. Elias Castegren och Tobias Wrigstad. I , 2016. (fulltext:postprint).
  27. Vats: A safe, reactive storage abstraction. Dave Clarke och Tobias Wrigstad. I Theory and Practice of Formal Methods: Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday, volym 9660 av Lecture Notes in Computer Science, pp 140-154, Springer, 2016. (DOI).
  28. Multilayer Social Networks. Mark E. Dickison, Matteo Magnani och Luca Rossi. Cambridge University Press, 2016.
  29. ParT: An asynchronous parallel abstraction for speculative pipeline computations. Kiko Fernandez-Reyes, Dave Clarke och Daniel S. McCain. I Coordination Models and Languages, volym 9686 av Lecture Notes in Computer Science, pp 101-120, Springer, 2016. (DOI).
  30. Towards Enabling Low-Level Memory Optimisations at the High-Level with Ownership Annotations. Juliana Franco, Tobias Wrigstad och Sophia Drossopoulou. I , 2016. (Fulltext, fulltext:postprint).
  31. Kleene Algebras with Domain. Victor B. F. Gomes, Walter Guttmann, Peter Höfner, Georg Struth och Tjark Weber. I Archive of Formal Proofs, 2016. (Extern länk).
  32. Languages, Logics, Types and Tools for Concurrent System Modelling. Ram?nas Gutkovas. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1392, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext).
  33. Cloud-assisted data fusion and sensor selection for Internet of Things. Farshid Hassani Bijarbooneh, Wei Du, Edith C.-H. Ngai, Xiaoming Fu och Jiangchuan Liu. I IEEE Internet of Things Journal, volym 3, nummer 3, pp 257-268, 2016. (DOI).
  34. Writing to learn programming?: A single case pilot study. Ville Isomöttönen, Aletta Nylén och Ville Tirronen. I Proc. 16th International Conference on Computing Education Research: Koli Calling, pp 140-144, ACM Press, New York, 2016. (DOI).
  35. A procedure for splitting data-aware processes and its application to coordination. Sung-Shik T. Q. Jongmans, Dave Clarke och José Proença. I Science of Computer Programming, volym 115–116, pp 47-78, 2016. (DOI).
  36. Implementing a secure abstract machine. Adriaan Larmuseau, Marco Patrignani och Dave Clarke. I Proc. 31st ACM Symposium on Applied Computing, pp 2041-2048, ACM Press, New York, 2016. (DOI).
  37. Protecting Functional Programs From Low-Level Attackers. Adriaan Larmuseau. Doktorsavhandling, Uppsala Dissertations from the Faculty of Science and Technology nr 124, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  38. UrbanSense: An Urban-Scale Sensing Platform for the Internet of Things. Yunior Luis, Pedro M. Santos, Tiago Lourenco, Carlos Pérez-Penichet, Tania Calcada och Ana Aguiar. I IEEE Second International Smart Cities Conference (ISC2 2016), pp 763-768, 2016.
  39. The Nifty way to call hell from heaven. Andreas Löscher och Konstantinos Sagonas. I Proc. 15th International Workshop on Erlang, pp 1-11, ACM Press, New York, 2016. (DOI).
  40. Using indirect blockmodeling for monitoring students roles in collaborative learning networks. Esunly Medina, Davide Vega, Roc Meseguer, Humberto Medina, Sergio F. Ochoa och Matteo Magnani. I 2016 IEEE 20th International Conference on Computer Supported Cooperative Work in Design (CSCWD), International Conference on Computer Supported Cooperative Work in Design, pp 164-169, 2016.
  41. Integrating Visual Data Flow Programming with Data Stream Management. Lars Melander. Doktorsavhandling, Uppsala Dissertations from the Faculty of Science and Technology nr 128, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  42. A parametric propagator for pairs of SUM constraints with a discrete convexity property. Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener och Justin Pearson. I Artificial Intelligence, volym 241, pp 170-190, 2016. (DOI).
  43. Feature Nets: Behavioural modelling of software product lines. Radu Muschevici, José Proença och Dave Clarke. I Software and Systems Modeling, volym 15, nummer 4, pp 1181-1206, 2016. (DOI).
  44. Social Network Analysis in Applications. Katarzyna Musial, Piotr Brodka och Matteo Magnani. I AI Communications, volym 29, nummer 1, pp 55-56, 2016. (DOI).
  45. Personalized Mobile-Assisted Smart Transportation. Edith C.-H. Ngai, Stephan Brandauer, Amendra Shrestha och Konstantinos Vandikas. I 2016 Digital Media Industry And Academic Forum (DMIAF), pp 158-160, 2016.
  46. General conditions for full abstraction. Joachim Parrow. I Mathematical Structures in Computer Science, volym 26, nummer 4, pp 655-657, 2016. (DOI).
  47. The largest respectful function. Joachim Parrow och Tjark Weber. I Logical Methods in Computer Science, volym 12, nummer 2, 2016. (DOI, Fulltext, fulltext:print).
  48. A critical analysis of trends in student-centric engineering education and their implications for learning. Arnold Pears, Aletta Nylén och Mats Daniels. I Proc. 46th ASEE/IEEE Frontiers in Education Conference, Frontiers in Education Conference, IEEE Press, Piscataway, NJ, 2016. (DOI).
  49. Typed Connector Families. Jose Proenca och Dave Clarke. I Formal Aspects Of Component Software, volym 9539 av Lecture Notes in Computer Science, pp 294-311, Springer, 2016. (DOI).
  50. Proceedings från 5:e utvecklingskonferensen för Sveriges ingenjörsutbildningar. Stefan Pålsson och Björn Victor (red). Volym 2016-002 av Technical report / Department of Information Technology, Uppsala University, 2016. (Extern länk).
  51. Predictive analysis at Krononfogden: Classifying first-time debtors with an uplift model. Måns Rantzer. Examensarbete, handledare: Mårten Janerud, examinator: Elísabet Andrésdóttir, Michael Ashcroft, UPTEC STS nr 16036, 2016. (fulltext).
  52. Other Things Besides Number: Abstraction, Constraint Propagation, and String Variable Types. Joseph Scott. Doktorsavhandling, Uppsala Dissertations from the Faculty of Science and Technology nr 120, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  53. Effects of missing data in multilayer networks. Rajesh Sharma, Matteo Magnani och Danilo Montesi. I Social Network Analysis and Mining, volym 6, nummer 1, 2016. (DOI).
  54. Scalable long-term preservation of relational data through SPARQL queries. Silvia Stefanova och Tore Risch. I Semantic Web, volym 7, nummer 2, pp 117-137, 2016. (DOI).
  55. Main-Memory Query Processing Utilizing External Indexes. Thanh Truong. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1352, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  56. Efficient filtering for the unary resource with family-based transition times. Sascha Van Cauwelaert, Cyrille Dejemeppe, Jean-Noël Monette och Pierre Schaus. I Principles and Practice of Constraint Programming: CP 2016, volym 9892 av Lecture Notes in Computer Science, pp 520-535, Springer, 2016. (DOI).
  57. A new approach to role and position detection in networks. Davide Vega, Matteo Magnani, Danilo Montesi, Roc Meseguer och Felix Freitag. I SOCIAL NETWORK ANALYSIS AND MINING, volym 6, nummer 1, 2016. (DOI).
  58. Modelling of patterns between operational data, diagnostic trouble codes and workshop history using big data and machine learning. Linda Virkkala och Johanna Haglund. Examensarbete, handledare: Jonas Bitéus, examinator: Elisabet Andrésdóttir, Michael Ashcroft, UPTEC STS nr 16002, 2016. (fulltext).
  59. Modal Logics for Nominal Transition Systems. Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes Borgström och Ram?nas Gutkovas. I Archive of Formal Proofs, 2016. (Extern länk).
  60. Scrambling and descrambling SMT-LIB benchmarks. Tjark Weber. I Satisfiability Modulo Theories: SMT 2016, volym 1617 av CEUR Workshop Proceedings, pp 31-40, RWTH Aachen University, 2016. (Fulltext).
  61. The 2014 SMT Competition. Tjark Weber, David R. Cok och David Deharbe. I Journal on Satisfiability, Boolean Modeling and Computation, 2016.
  62. Scalable Validation of Data Streams. Cheng Xu. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1384, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  63. Scalable Queries over Log Database Collections. Minpeng Zhu. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1343, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  64. Bisimulation up-to techniques for psi-calculi. Johannes Åman Pohjola och Joachim Parrow. I Proc. 5th ACM SIGPLAN Conference on Certified Programs and Proofs, pp 142-153, ACM Press, New York, 2016. (DOI).
  65. Culling Concurrency Theory: Reusable and trustworthy meta-theory, proof techniques and separation results. Johannes Åman Pohjola. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1397, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
  66. The Expressive Power of Monotonic Parallel Composition. Johannes Åman Pohjola och Joachim Parrow. I Programming Languages and Systems, volym 9632 av Lecture Notes in Computer Science, pp 780-803, Springer, Berlin, 2016. (DOI).
  67. Language Constructs for Safe Parallel Programming on Multi-Cores. Johan Östlund. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1319, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).

2015

  1. Stateless model checking for TSO and PSO. Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson och Konstantinos Sagonas. I Tools and Algorithms for the Construction and Analysis of Systems: TACAS 2015, volym 9035 av Lecture Notes in Computer Science, pp 353-367, Springer Berlin/Heidelberg, 2015. (DOI).
  2. Physical stability of drugs after storage above and below the glass transition temperature: Relationship to glass-forming ability. Amjad Alhalaweh, Ahmad Alzghoul, Denny Mahlin och Christel A. S. Bergström. I International Journal of Pharmaceutics, volym 495, nummer 1, pp 312-317, 2015. (DOI, fulltext:print).
  3. Addressing concept drift to improve system availability by updating one-class data-driven models. Ahmad Alzghoul och Magnus Löfstrand. I Evolving Systems, volym 6, nummer 3, pp 187-198, 2015. (DOI).
  4. Spatio-Temporal Gridded Data Processing on the Semantic Web. Andrej Andrejev, Dimitar Misev, Peter Baumann och Tore Risch. I 2015 IEEE International Conference On Data Science And Data Intensive Systems, pp 38-45, 2015. (DOI).
  5. A step towards detecting online grooming: Identifying adults pretending to be children. Michael Ashcroft, Lisa Kaati och Maxime Meyer. I Proc. 5th European Intelligence and Security Informatics Conference, pp 98-104, IEEE Computer Society, 2015. (DOI).
  6. Are You Really a Child?: A Machine Learning Approach To Protect Children from Online Grooming. Michael Ashcroft, Lisa Kaati och Maxime Meyer. I Proc. National Symposium on Technology and Methodology for Security and Crisis Management: TAMSEC 2015, 2015.
  7. Detecting jihadist messages on twitter. Michael Ashcroft, Ali Fisher, Lisa Kaati, Enghin Omer och Nico Prucha. I Proc. 5th European Intelligence and Security Informatics Conference, pp 161-164, IEEE Computer Society, 2015. (DOI).
  8. A modelling pearl with sortedness constraints. Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Xavier Lorca, Justin Pearson, Thierry Petit och Charles Prud'homme. I Global Conference on Artificial Intelligence: GCAI 2015, volym 36 av EasyChair Proceedings in Computing, pp 27-41, Cool Press, Manchester, UK, 2015. (Abstract).
  9. On the Reification of Global Constraints (Abstract). Nicolas Beldiceanu, Mats Carlsson, Pierre Flener och Justin Pearson. I Principles and practice of constraint programming, CP 2015, volym 9255 av Lecture Notes in Computer Science, pp 733-733, SPRINGER-VERLAG BERLIN, 2015.
  10. Teaching and Learning Computer Science at Al Baha University, Saudi Arabia: Insights from a staff development course. Anders Berglund, Arnold Pears, Aletta Nylén, Farooq Ahmad, Bader Alghamdi, Khalid Alghamdi, Ahmed Alhabish, Abdullah Aljoufi, Eidah Alzahrani, Rami Alzahrani, Ismat Aldmour, Areej Athama, Hamada Shihad AlSadoon, Rahmat Budiarto, Abdul Hafeez, Nadeem Hassan Daupota, Dhafer Faiz, Lubna Abdel Kareim Gabralla, Mohammad Gamar, Abdul Hannan, Bedine Kerim, F. A. Mazarbhuiya, Ahmed Rabea, Muhammad Qaiser Saleem, Nimir Saleh och Mohamed Shenify. I Proc. 3rd International Conference on Learning and Teaching in Computing and Engineering, pp 1-6, IEEE Computer Society, Los Alamitos, CA, 2015. (DOI, fulltext:preprint).
  11. A constraint-based local search backend for MiniZinc. Gustav Björdal, Jean-Noël Monette, Pierre Flener och Justin Pearson. I Constraints, volym 20, nummer 3, pp 325-345, 2015. (DOI).
  12. Anomaly detection with Machine learning: Quality assurance of statistical data in the Aid community. Hanna Blomquist och Johanna Möller. Examensarbete, handledare: Franck Rasmussen, examinator: Elisabet Andrésdóttir, Michael Ashcroft, UPTEC STS nr 15014, 2015. (fulltext).
  13. Broadcast psi-calculi with an application to wireless protocols. Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola och Joachim Parrow. I Software and Systems Modeling, volym 14, nummer 1, pp 201-216, Springer, 2015. (DOI, fulltext:postprint).
  14. The Psi-Calculi Workbench: A Generic Tool for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe och Björn Victor. I ACM Transactions on Embedded Computing Systems, volym 14, nummer 1, 2015. (DOI, fulltext:postprint).
  15. Clustering attributed graphs: models, measures and methods. Cecile Bothorel, Juan David Cruz, Matteo Magnani och Barbora Micenkova. I Network Science, volym 3, nummer 3, pp 408-444, 2015. (DOI, fulltext:postprint).
  16. Disjointness Domains for Fine-Grained Aliasing. Stephan Brandauer, Dave Clarke och Tobias Wrigstad. I , ACM SIGPLAN NOTICES, pp 989-916, 2015. (DOI).
  17. 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 och Albert Mingkun Yang. I Formal Methods for Multicore Programming, volym 9104 av Lecture Notes in Computer Science, pp 1-56, 2015. (DOI).
  18. Modelling and analysing a WSN secure aggregation protocol: A comparison of languages and tool support. Volkan Cambazoglu, Ramunas Gutkovas, Johannes Åman Pohjola och Björn Victor. Technical report / Department of Information Technology, Uppsala University nr 2015-033, 2015. (Extern länk).
  19. A structured approach to training open-ended problem solving. Sofia Cassel och Björn Victor. I Proc. 45th ASEE/IEEE Frontiers in Education Conference, Frontiers in Education Conference, pp 417-420, IEEE Press, Piscataway, NJ, 2015. (DOI).
  20. Refined Ownership: Fine-grained controlled internal sharing. Elias Castegren, Johan Östlund och Tobias Wrigstad. I Formal Methods for Multicore Programming, volym 9104 av Lecture Notes in Computer Science, pp 179-210, 2015. (DOI).
  21. Abstract Delta Modelling. Dave Clarke, Michiel Helvensteijn och Ina Schaefer. I Mathematical Structures in Computer Science, volym 25, nummer 3, pp 482-527, Cambridge University Press, 2015.
  22. The 2013 Evaluation of SMT-COMP and SMT-LIB. David R. Cok, Aaron Stump och Tjark Weber. I Journal of automated reasoning, volym 55, nummer 1, pp 61-90, 2015. (DOI).
  23. Competencies for paradigm shift "survival". Mats Daniels, Åsa Cajander, Anna Eckerdal, Mats Lind, Aletta Nylén, Tony Clear och Roger McDermott. I Proc. 45th ASEE/IEEE Frontiers in Education Conference, pp 1424-1429, IEEE Press, Piscataway, NJ, 2015. (DOI).
  24. Refraction: Low-cost management of reflective meta-data in pervasive component-based applications. Wilfried Daniels, José Proença, Dave Clarke, Wouter Joosen och Danny Hughes. I Proc. 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering, pp 27-36, ACM Press, New York, 2015. (DOI).
  25. Enabling design of performance-controlled sensor network applications through task allocation and reallocation. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson och Konstantinos Sagonas. I Proc. 11th International Conference on Distributed Computing in Sensor Systems, pp 248-253, IEEE Computer Society, 2015. (DOI, fulltext:postprint).
  26. Optimal Task Allocation in Sensor and Actuator Networks. Atis Elsts. I Proc. 11th Swedish National Computer Networking Workshop, 2015.
  27. 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 och Konstantinos Sagonas. I Proc. Poster/Demo Session: 12th European Conference on Wireless Sensor Networks, pp 19-20, 2015.
  28. ProFuN TG: A tool for programming and managing performance-aware sensor network applications. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson och Konstantinos Sagonas. I IEEE 40th Local Computer Networks Conference Workshops (LCN Workshops), pp 751-759, IEEE Computer Society, 2015. (DOI, fulltext:preprint).
  29. ProFuN TG: Programming Sensornets with Task Graphs for Increased Reliability and Energy-Efficiency. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson och Konstantinos Sagonas. I , IEEE Computer Society, 2015. (Extern länk, fulltext:postprint).
  30. Automatic irony- and sarcasm detection in Social media. Erik Forslid och Niklas Wikén. Examensarbete, handledare: Magnus Sahlgren, examinator: Tomas Nyberg, Michael Ashcroft, UPTEC F nr 15045, 2015. (fulltext).
  31. Implied constraints for AUTOMATON constraints. María Andreína Francisco Rodríguez, Pierre Flener och Justin Pearson. I Global Conference on Artificial Intelligence: GCAI 2015, volym 36 av EasyChair Proceedings in Computing, pp 113-126, Cool Press, Manchester, UK, 2015. (Abstract).
  32. Concolic Testing for Functional Languages. Aggelos Giantsios, Nikolaos Papaspyrou och Konstantinos Sagonas. I Proceedings of the 17th international symposium on principles and practice of declarative programming (PPDP 2015), pp 137-148, Association for Computing Machinery (ACM), 2015. (DOI).
  33. Probabilistic programs as spreadsheet queries. Andrew D. Gordon, Claudio Russo, Marcin Szymczak, Johannes Borgström, Nicolas Rolland, Thore Graepel och Daniel Tarlow. I Programming Languages and Systems, volym 9032 av Lecture Notes in Computer Science, pp 1-25, Springer Berlin/Heidelberg, 2015. (DOI, fulltext:postprint).
  34. Motivation and Grade Gap Related to Gender in a Programming Course. Virginia Grande och Joachim Parrow. I , 2015. (DOI).
  35. A constraint optimisation model for analysis of telecommunication protocol logs. Olga Grinchtein, Mats Carlsson och Justin Pearson. I Tests and Proofs: TAP 2015, volym 9154 av Lecture Notes in Computer Science, pp 137-154, Springer, 2015. (DOI).
  36. Testing of a telecommunication protocol using constraint programming. Olga Grinchtein, Mats Carlsson och Justin Pearson. I 2015 IEEE Eighth International Conference On Software Testing, Verification And Validation Workshops (ICSTW), IEEE International Conference on Software Testing Verification and Validation Workshops, 2015.
  37. Constraint Programming for Wireless Sensor Networks. Farshid Hassani Bijarbooneh. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1219, Acta Universitatis Upsaliensis, Uppsala, 2015. (fulltext, preview image).
  38. A Quadratic Extended Edge-Finding Filtering Algorithm for Cumulative Resource Constraints. Roger Kameugne, Laure Pauline Fotso och Joseph Scott. I Principles and practice of constraint programming, CP 2015, volym 9255 av Lecture Notes in Computer Science, pp 738-739, SPRINGER-VERLAG BERLIN, 2015.
  39. A high-level model for an assembly language attacker by means of reflection. Adriaan Larmuseau, Marco Patrignani och Dave Clarke. I Dependable Software Engineering: Theories, Tools, and Applications, volym 9409 av Lecture Notes in Computer Science, pp 168-182, Springer, 2015. (DOI, fulltext:preprint).
  40. A secure compiler for ML modules. Adriaan Larmuseau, Marco Patrignani och Dave Clarke. I Programming Languages and Systems: APLAS 2015, volym 9458 av Lecture Notes in Computer Science, pp 29-48, Springer, 2015. (DOI).
  41. Formalizing a secure foreign function interface. Adriaan Larmuseau och Dave Clarke. I Software Engineering and Formal Methods, volym 9276 av Lecture Notes in Computer Science, pp 215-230, Springer, 2015. (DOI, fulltext:postprint).
  42. Defining 'Functional Products' through their constituents. John Lindström, Daria Sas, Håkan Lideskog, Magnus Löfstrand och Lennart Karlsson. I International Journal of Product Development, volym 20, nummer 1, pp 1-24, 2015. (DOI).
  43. Property-Based Testing of Sensor Networks. Andreas Löscher, Konstantinos Sagonas och Thiemo Voigt. I Proc. 12th International Conference on Sensing, Communication, and Networking, pp 100-108, IEEE Communications Society, 2015.
  44. NoSQL approach to large scale analysis of persisted streams. Khalid Mahmood, Thanh Truong och Tore Risch. I Data Science, volym 9147 av Lecture Notes in Computer Science, pp 152-156, Springer, 2015. (DOI).
  45. Utilizing a NoSQL Data Store for Scalable Log Analysis. Khalid Mahmood, Tore Risch och Minpeng Zhu. I , pp 49-55, 2015. (DOI).
  46. Automated auxiliary variable elimination through on-the-fly propagator generation. Jean-Noël Monette, Pierre Flener och Justin Pearson. I Principles and Practice of Constraint Programming: CP 2015, volym 9255 av Lecture Notes in Computer Science, pp 313-329, Springer, 2015. (DOI).
  47. Efficient caching for constrained skyline queries. Michael Mortensen, Sean Chester, Ira Assent och Matteo Magnani. I Extending Database Technology (EDBT), 2015.
  48. Multidimensional analysis of creative coding MOOC forums: a methodological discussion. Aletta Nylén, Neena Thota, Anna Eckerdal, Päivi Kinnunen, Matthew Butler och Michael Morgan. I Proc. 15th International Conference on Computing Education Research: Koli Calling, pp 137-141, ACM Press, New York, 2015. (DOI).
  49. Proc. 1st Al Baha University and Uppsala University Symposium on Quality in Computing Education. Aletta Nylén och Mohamed Shenify (red). Volym 2015-007 av Technical report / Department of Information Technology, Uppsala University, 2015. (Abstract).
  50. Forecasting Lock Contention Before Adopting Another Lock Algorithm. Xiaoyue Pan, David Klaftenegger och Bengt Jonsson. 2015. (fulltext).
  51. Modal Logics for Nominal Transition Systems. Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas och Tjark Weber. I 26th International Conference on Concurrency Theory: CONCUR 2015, volym 42 av Leibniz International Proceedings in Informatics (LIPIcs), pp 198-211, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015. (DOI, Fulltext).
  52. Fully abstract trace semantics for protected module architectures. Marco Patrignani och Dave Clarke. I Computer languages, systems & structures, volym 42, pp 22-45, 2015. (DOI).
  53. Secure compilation to protected module architectures. Marco Patrignani, Pieter Agten, Raoul Strackx, Bart Jacobs, Dave Clarke och Frank Piessens. I ACM Transactions on Programming Languages and Systems, volym 37, nummer 2, 2015. (DOI).
  54. Implications of anonymous assessment. Arnold Pears och Aletta Nylén. I Proc. 45th ASEE/IEEE Frontiers in Education Conference, Frontiers in Education Conference, pp 1404-1408, IEEE Press, Piscataway, NJ, 2015. (DOI).
  55. Diffusion of Innovations over Multiplex Social Networks. Rasoul Ramezanian, Mostafa Salehi, Matteo Magnani och Danilo Montesi. I International Symposium on Artificial Intelligence and Signal Processing (AISP), pp 1-5, 2015. (DOI, ArXiv).
  56. Towards effective visual analytics on multiplex and multilayer networks. Luca Rossi och Matteo Magnani. I Chaos, Solitons & Fractals, volym 72, pp 68-76, 2015. (DOI, fulltext:postprint).
  57. Contention adapting search trees. Konstantinos Sagonas och Kjell Winblad. I Proc. 14th International Symposium on Parallel and Distributed Computing, pp 215-224, IEEE conference proceedings, 2015. (DOI).
  58. Multidimensional epidemic thresholds in diffusion processes over interdependent networks. Mostafa Salehi, Payam Siyari, Matteo Magnani och Danilo Montesi. I Chaos, Solitons & Fractals, volym 72, pp 59-67, 2015. (DOI).
  59. Spreading processes in Multilayer Networks. Mostafa Salehi, Rajesh Sharma, Moreno Marzolla, Matteo Magnani, Payam Siyari och Danilo Montesi. I IEEE Transactions on Network Science and Engineering, volym 2, nummer 2, pp 65-83, IEEE Computer Society, 2015. (DOI, Fulltext, fulltext:postprint).
  60. Contextual Healing: Privacy through Interpretation Management. Rula Sayaf, Soren Preibusch och Dave Clarke. I 2015 Ieee International Conference On Smart City/Socialcom/Sustaincom (Smartcity), pp 360-365, IEEE, 2015. (DOI).
  61. The Other Side of Privacy: Surveillance in Data Control. Rula Sayaf, Dave Clarke och James B. Rule. I British HCI 2015, pp 184-192, 2015. (DOI).
  62. Constraint solving on bounded string variables. Joseph D. Scott, Pierre Flener och Justin Pearson. I Integration of AI and OR Techniques in Constraint Programming, volym 9075 av Lecture Notes in Computer Science, pp 375-392, Springer, 2015. (DOI).
  63. Investigating the types and effects of missing data in multilayer networks. Rajesh Sharma, Matteo Magnani och Danilo Montesi. I International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp 392-399, 2015.
  64. Understanding community patterns in large attributed social networks. Rajesh Sharma, Matteo Magnani och Danilo Montesi. I Proceedings Of The 2015 IEEE/ACM International Conference On Advances In Social Networks Analysis And Mining (Asonam 2015), pp 1503-1508, 2015. (DOI).
  65. System components of a general theory of software engineering. Anca-Juliana Stoica, Kristiaan Pelckmans och William Rowe. I Science of Computer Programming, volym 101, pp 42-65, 2015. (DOI).
  66. Transparent inclusion, utilization, and validation of main memory domain indexes. Thanh Truong och Tore Risch. I Proc. 27th International Conference on Scientific and Statistical Database Management, ACM Press, New York, 2015. (DOI).
  67. Role and position detection in networks: reloaded. Davide Vega, Roc Meseguer, Felix Freitag och Matteo Magnani. I International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp 320-325, 2015.
  68. Scalable queries over log database collections. Minpeng Zhu, Khalid Mahmood och Tore Risch. I Data Science, volym 9147 av Lecture Notes in Computer Science, pp 173-185, Springer, 2015. (DOI).
  69. Editorial preface for the JLAMP Special Issue on Formal Methods for Software Product Line Engineering. Maurice ter Beek, Dave Clarke och Ina Schafer. I The Journal of logical and algebraic methods in programming, volym 85, nummer 1, pp 123-124, 2015. (DOI).
  70. Measuring Polymorphism in Python Programs. Beatrice Åkerblom och Tobias Wrigstad. I DLS 2015: Proceedings of the 11th Symposium on Dynamic Languages, volym 51:2 2016 av ACM SIGPLAN Notices, pp 114-128, ACM Press, New York, 2015. (DOI).

2014

  1. Optimal dynamic partial order reduction. Parosh Abdulla, Stavros Aronis, Bengt Jonsson och Konstantinos Sagonas. I Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volym 49:1 av ACM SIGPLAN NOTICES, pp 373-384, ACM Press, New York, 2014. (DOI).
  2. Impact of cultural and language background on learning Computer Science concepts. Ismat Aldmour och Aletta Nylén. I Proc. 2nd International Conference on Learning and Teaching in Computing and Engineering, International Conference on Teaching and Learning in Computing and Engineering, pp 37-40, IEEE Computer Society, Los Alamitos, CA, 2014. (DOI).
  3. Computational predictions of glass-forming ability and crystallization tendency of drug molecules. Amjad Alhalaweh, Ahmad Alzghoul, Waseem Kaialy, Denny Mahlin och Christel A. S. Bergström. I Molecular Pharmaceutics, volym 11, nummer 9, pp 3123-3132, 2014. (DOI).
  4. Comparing a knowledge-based and a data-driven method in querying data streams for system fault detection: A hydraulic drive system application. Ahmad Alzghoul, Björn Backe, Magnus Löfstrand, Arne Byström och Bengt Liljedahl. I Computers in industry (Print), volym 65, nummer 8, pp 1126-1135, 2014. (DOI).
  5. Experimental and Computational Prediction of Glass Transition Temperature of Drugs. Ahmad Alzghoul, Amjad Alhalaweh, Denny Mahlin och Christel A. S. Bergström. I JOURNAL OF CHEMICAL INFORMATION AND MODELING, volym 54, nummer 12, pp 3396-3403, 2014. (DOI).
  6. Scientific data as RDF with arrays: Tight integration of SciSPARQL queries into MATLAB. Andrej Andrejev, Xueming He och Tore Risch. I Proc. ISWC 2014 Posters & Demonstrations Track, volym 1272 av CEUR Workshop Proceedings, pp 221-224, RWTH Aachen University, 2014. (Fulltext).
  7. Programming and automating mathematics in the Tarski-Kleene hierarchy. Alasdair Armstrong, Georg Struth och Tjark Weber. I Journal of Logical and Algebraic Methods in Programming, volym 83, nummer 2, pp 87-102, 2014. (DOI).
  8. Distributed multi-query optimization of continuous clustering queries. Sobhan Badiozamany. I Proc. VLDB 2014 PhD Workshop, 2014. (fulltext:print).
  9. Model-based protocol log generation for testing a telecommunication test harness using CLP. Kenneth Balck, Olga Grinchtein och Justin Pearson. I Proc. 17th Conference on Design, Automation and Test in Europe, IEEE, Piscataway, NJ, 2014. (DOI).
  10. Model-based protocol log generation for testing a telecommunication test harness using CLP. Kenneth Balck, Olga Grinchtein och Justin Pearson. I 2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE), Design Automation and Test in Europe Conference and Expo, 2014.
  11. Linking prefixes and suffixes for constraints encoded using automata with accumulators. Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez och Justin Pearson. I Principles and Practice of Constraint Programming: CP 2014, volym 8656 av Lecture Notes in Computer Science, pp 142-157, Springer, 2014. (DOI).
  12. Propagating regular counting constraints. Nicolas Beldiceanu, Pierre Flener, Justin Pearson och Pascal Van Hentenryck. I Proc. 28th AAAI Conference on Artificial Intelligence: Volume 4, pp 2616-2622, AAAI Press, Palo Alto, CA, 2014. (Extern länk).
  13. Toward sustainable development in constraint programming. Nicolas Beldiceanu, Pierre Flener, Jean-Noël Monette, Justin Pearson och Helmut Simonis. I Constraints, volym 19, nummer 2, pp 139-149, 2014. (DOI).
  14. A Sorted Semantic Framework for Applied Process Calculi (extended abstract). Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor och Johannes Åman Pohjola. I Trustworthy Global Computing: TGC 2013, volym 8358 av Lecture Notes in Computer Science, pp 103-118, Springer Berlin/Heidelberg, 2014. (DOI).
  15. Proc. Combined 21st International Workshop on Expressiveness in Concurrency (EXPRESS 2014) and 11th Workshop on Structural Operational Semantics (SOS 2014). Johannes Borgström och Silvia Crafa (red). Volym 160 av Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2014. (DOI).
  16. Protocol log analysis with constraint programming: Work in progress. Mats Carlsson, Olga Grinchtein och Justin Pearson. I Satisfiability Modulo Theories: SMT 2014, volym 1163 av CEUR Workshop Proceedings, pp 17-26, RWTH Aachen University, 2014. (Fulltext).
  17. Enhanced learning by promoting engineering competencies. Sofia Cassel, Aletta Nylén och Björn Victor. I Proc. 44th ASEE/IEEE Frontiers in Education Conference, pp 2044-2049, IEEE Press, Piscataway, NJ, 2014. (DOI, Proceedings).
  18. Teaching and learning with MOOCs: Computing academics' perspectives and engagement. Anna Eckerdal, Päivi Kinnunen, Neena Thota, Aletta Nylén, Judy Sheard och Lauri Malmi. I Proc. 19th Conference on Innovation and Technology in Computer Science Education, pp 9-14, ACM Press, New York, 2014. (DOI).
  19. A Case for Node-Local Runtime Parameter Adaptation in Wireless Sensor Networks. Atis Elsts och Edith C.-H. Ngai. I Proc. 10th Swedish National Computer Networking Workshop, 2014.
  20. Propagators and violation functions for geometric and workload constraints arising in airspace sectorisation. Pierre Flener och Justin Pearson. Computing Research Repository nr 1401.7463, 2014. (Extern länk).
  21. Static safety guarantees for a low-level multithreaded language with regions. Prodromos Gerakios, Nikolaos Papaspyrou och Konstantinos Sagonas. I Science of Computer Programming, volym 80, nummer Part B, pp 223-263, 2014. (DOI).
  22. Tabular: a schema-driven probabilistic programming language. Andrew D. Gordon, Thore Graepel, Nicolas Rolland, Claudio Russo, Johannes Borgström och John Guiver. I Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volym 49:1 av ACM SIGPLAN NOTICES, pp 321-334, ACM Press, New York, 2014. (DOI, fulltext:print).
  23. Advancing concurrent system verification: Type based approach and tools. Ramunas Gutkovas. Licentiatavhandling, IT licentiate theses / Uppsala University, Department of Information Technology nr 2014-007, Uppsala University, 2014. (fulltext).
  24. A constraint programming approach for managing end-to-end requirements in sensor network macroprogramming. Farshid Hassani Bijarbooneh, Animesh Pathak, Justin Pearson, Valérie Issarny och Bengt Jonsson. I Proc. 3rd International Conference on Sensor Networks, pp 28-40, SciTePress, Setúbal, Portugal, 2014. (DOI).
  25. Energy-efficient sensor selection for data quality and load balancing in wireless sensor networks. Farshid Hassani Bijarbooneh, Wei Du, Edith Ngai och Xiaoming Fu. I Proc. 22nd International Symposium on Quality of Service, pp 338-343, IEEE Communications Society, 2014. (DOI).
  26. Dynamic and speculative polyhedral parallelization using compiler-generated skeletons. Alexandra Jimborean, Philippe Clauss, Jean-François Dollinger, Vincent Loechner och Juan Manuel Martinez Caamaño. I International journal of parallel programming, volym 42, nummer 4, pp 529-545, 2014. (DOI).
  27. 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 och Stefanos Kaxiras. I Proc. 12th International Symposium on Code Generation and Optimization, pp 262-272, ACM Press, New York, 2014. (URL, fulltext:postprint).
  28. A quadratic edge-finding filtering algorithm for cumulative resource constraints. Roger Kameugne, Laure Pauline Fotso, Joseph Scott och Youcheu Ngo-Kateu. I Constraints, volym 19, nummer 3, pp 243-269, 2014. (DOI).
  29. Brief announcement: queue delegation locking. David Klaftenegger, Konstantinos Sagonas och Kjell Winblad. I Proc. 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp 70-72, ACM Press, New York, 2014. (DOI, fulltext:print).
  30. Delegation locking libraries for improved performance of multithreaded programs. David Klaftenegger, Konstantinos Sagonas och Kjell Winblad. I Euro-Par 2014: Parallel Processing, volym 8632 av Lecture Notes in Computer Science, pp 572-583, Springer Berlin/Heidelberg, 2014. (DOI).
  31. Session types for broadcasting. Dimitrios Kouzapas, Ramunas Gutkovas och Simon J. Gay. I Proc. 7th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, volym 155 av Electronic Proceedings in Theoretical Computer Science, pp 25-31, 2014. (DOI, fulltext:print).
  32. Large-Scale Social Network Analysis. Mattia Lambertini, Matteo Magnani, Moreno Marzolla, Danilo Montesi och Carmine Paolino. I Large-Scale Data Analytics, pp 155-187, Springer, 2014. (DOI).
  33. Operational Semantics for Secure Interoperation. Adriaan Larmuseau, Marco Patrignani och Dave Clarke. I Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, 2014.
  34. Use of cloud services in functional products: Availability implications. John Lindström, Magnus Löfstrand, Sean Reed och Ahmad Alzghoul. I Procedia CIRP, volym 16, pp 368-372, 2014. (DOI).
  35. Evaluating availability of functional products through simulation. Magnus Löfstrand, Petter Kyösti, Sean Reed och Björn Backe. I Simulation Modelling Practice and Theory, volym 47, pp 196-209, 2014. (DOI).
  36. Efficient and Flexible Sensornet Checkpointing. Andreas Löscher, Nicolas Tsiftes, Thiemo Voigt och Vlado Handziski. I Wireless Sensor Networks, volume 8354, pp -65, 2014. (DOI, Conference website).
  37. Multiple social networks, data models and measures for. Matteo Magnani och Luca Rossi. I Encyclopedia of Social Network Analysis and Mining, Springer, Berlin, 2014.
  38. Path-based and Whole Network Measures. Matteo Magnani och Moreno Marzolla. I Encyclopedia of Social Network Analysis and Mining, Springer, Berlin, 2014.
  39. Taking the Big Picture: Representative Skylines based on Significance and Diversity. Matteo Magnani, Ira Assent och Michael L. Mortensen. I The VLDB journal, volym 23, nummer 5, pp 795-815, Springer Berlin/Heidelberg, 2014. (DOI).
  40. A propagator design framework for constraints over sequences. Jean-Noël Monette, Pierre Flener och Justin Pearson. I Proc. 28th AAAI Conference on Artificial Intelligence: Volume 4, pp 2710-2716, AAAI Press, Palo Alto, CA, 2014. (Extern länk).
  41. Higher-order psi-calculi. Joachim Parrow, Johannes Borgström, Palle Raabjerg och Johannes Åman Pohjola. I Mathematical Structures in Computer Science, volym 24, nummer 2, Cambridge University Press, 2014. (DOI, fulltext:postprint).
  42. Fully abstract trace semantics for low-level isolation mechanisms. Marco Patrignani och Dave Clarke. I Symposium on Applied Computing, SAC 2014., pp 1562-1569, ACM Press, 2014. (DOI).
  43. AccAB – Processes and Roles for Accreditation of Computing Degrees at Al Baha University in Saudi Arabia. Arnold Pears, Anders Berglund, Aletta Nylén, Nimir Saleh och Mohammed Gamar. I Proc. World Engineering Education Forum, pp 969-970, 2014.
  44. More scalable ordered set for ETS using adaptation. Konstantinos Sagonas och Kjell Winblad. I Proc. 13th ACM SIGPLAN Workshop on Erlang, pp 3-11, ACM Press, New York, 2014. (DOI).
  45. CPS2: a Contextual Privacy Framework for Social Software. Rula Sayaf, Dave Clarke och Richard Harper. I 10th International Conference on Security and Privacy in Communication Networks (SECURECOMM2014), Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering, pp 25-32, 2014. (DOI).
  46. Missing data in multiplex networks: a preliminary study. Rajesh Sharma, Matteo Magnani och Danilo Montesi. I , IEEE Computer Society, 2014.
  47. MOOCs and their impact on academics. Judy Sheard, Anna Eckerdal, Päivi Kinnunen, Lauri Malmi, Aletta Nylén och Neena Thota. I Proc. 14th International Conference on Computing Education Research: Koli Calling, pp 137-145, ACM Press, New York, 2014. (DOI).
  48. Scalable Numerical Queries by Algebraic Inequality Transformations. Thanh Truong och Tore Risch. I Database Systems for Advanced Applications, Dasfaa 2014, PT I, volym 8421 av Lecture Notes in Computer Science, pp 95-109, 2014.
  49. Scaling Future Software: The Manycore Challenge. Frank de Boer, Einar Broch Johnsen, Dave Clarke, Sophia Drossopoulou, Nobuko Yoshida och Tobias Wrigstad. 2014. (Extern länk).
  50. Priorities Without Priorities: Representing Preemption in Psi-Calculi. Johannes Åman Pohjola och Joachim Parrow. I Proc. 21st International Workshop on Expressiveness in Concurrency, and 11th Workshop on Structural Operational Semantics, volym 160 av Electronic Proceedings in Theoretical Computer Science, pp 2-15, 2014. (DOI).

2013

  1. Scientific analysis by queries in extended SPARQL over a scalable e-Science data store. Andrej Andrejev, Salman Toor, Andreas Hellander, Sverker Holmgren och Tore Risch. I Proc. 9th International Conference on e-Science, pp 98-106, IEEE Computer Society, Los Alamitos, CA, 2013. (DOI).
  2. Kleene Algebra. Alasdair Armstrong, Georg Struth och Tjark Weber. I Archive of Formal Proofs, 2013. (Extern länk).
  3. Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL. Alasdair Armstrong, Georg Struth och Tjark Weber. I Interactive Theorem Proving: ITP 2013, volym 7998 av Lecture Notes in Computer Science, pp 197-212, Springer Berlin/Heidelberg, 2013. (DOI, fulltext:postprint).
  4. On using Erlang for parallelization: Experience from parallelizing Dialyzer. Stavros Aronis och Konstantinos Sagonas. I Trends in Functional Programming, volym 7829 av Lecture Notes in Computer Science, pp 295-310, Springer Berlin/Heidelberg, 2013. (DOI).
  5. Performing Decision-Theoretic Inference in Bayesian Network Ensemble Models. Michael Ashcroft. I Twelfth Scandinavian Conference on Artificial Intelligence, volym 257 av Frontiers in Artificial Intelligence and Applications, pp 25-34, 2013. (DOI).
  6. Grand challenge: Implementation by frequently emitting parallel windows and user-defined aggregate functions. Sobhan Badiozamany, Lars Melander, Thanh Truong, Cheng Xu och Tore Risch. I Proc. 7th ACM International Conference on Distributed Event-Based Systems, pp 325-330, ACM Press, New York, 2013. (DOI).
  7. On matrices, automata, and double counting in constraint programming. Nicolas Beldiceanu, Mats Carlsson, Pierre Flener och Justin Pearson. I Constraints, volym 18, nummer 1, pp 108-140, 2013. (DOI).
  8. On the reification of global constraints. Nicolas Beldiceanu, Mats Carlsson, Pierre Flener och Justin Pearson. I Constraints, volym 18, nummer 1, pp 1-6, 2013. (DOI).
  9. Deriving Probability Density Functions from Probabilistic Functional Programs. Sooraj Bhat, Johannes Borgström, Andrew D. Gordon och Claudio Russo. I 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, volym 7795 av Lecture Notes in Computer Science, pp 508-522, Springer Berlin/Heidelberg, Berlin/Heidelberg, 2013. (DOI, fulltext:postprint).
  10. A Parametric Tool for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe och Björn Victor. I 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. (DOI).
  11. Measure transformer semantics for Bayesian machine learning. Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson och Jurgen van Gael. I Logical Methods in Computer Science, volym 9, nummer 3, p 11, 2013. (DOI, arXiv page).
  12. Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics. Johannes Borgström och Bas Luttik (red). Volym 120 av Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2013. (DOI, Fulltext).
  13. 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 och Ulf Wiger. I Trends in Functional Programming, volym 7829 av Lecture Notes in Computer Science, pp 263-278, Springer Berlin/Heidelberg, 2013. (DOI).
  14. Efficient GPU-based skyline computation. Kenneth S Bøgh, Ira Assent och Matteo Magnani. I Proceedings of the Ninth International Workshop on Data Management on New Hardware (DaMoN @ SIGMOD), 2013. (DOI, Extern länk).
  15. Fördjupat lärande genom aktiverande examination. Sofia Cassel och Björn Victor. I 4:e Utvecklingskonferensen för Sveriges ingenjörsutbildningar, pp 51-54, 2013.
  16. Systematic testing for detecting concurrency errors in Erlang programs. Maria Christakis, Alkis Gotovos och Konstantinos Sagonas. I Proc. 6th International Conference on Software Testing, Verification and Validation, pp 154-163, IEEE Computer Society, 2013. (DOI).
  17. Bayesian Inference Using Data Flow Analysis. Guillaume Claret, Sriram Rajamani, Aditya Nori, Andrew D. Gordon och Johannes Borgström. I 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. (DOI).
  18. Beyond the Geneva Convention on the Treatment of Object Aliasing. Dave Clarke, James Noble och Tobias Wrigstad. I Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volym 7850 av Lecture Notes in Computer Science, pp 1-6, Springer Berlin/Heidelberg, 2013. (DOI).
  19. Ownership Types: A Survey. Dave Clarke, Johan Östlund, Ilya Sergey och Tobias Wrigstad. I Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volym 7850 av Lecture Notes in Computer Science, pp 15-58, Springer Berlin/Heidelberg, 2013. (DOI).
  20. Spatio-Temporal Keyword Queries in Social Networks. Vittoria Cozza, Antonio Messina, Danilo Montesi, Luca Arietta och Matteo Magnani. I 17th East-European Conference on Advances in Databases and Information Systems (ADBIS), pp 70-83, 2013. (DOI, Extern länk).
  21. Automatic airspace sectorisation: A survey. Pierre Flener och Justin Pearson. Computing Research Repository nr 1311.0653, 2013. (Extern länk).
  22. Generation of implied constraints for automaton-induced decompositions. María Andreína Francisco Rodríguez, Pierre Flener och Justin Pearson. I Proc. 25th International Conference on Tools with Artificial Intelligence, pp 1076-1083, IEEE Computer Society, 2013. (DOI).
  23. A Model-Learner Pattern for Bayesian Reasoning. Andrew D. Gordon, Mihhail Aizatulin, Johannes Borgström, Guillaume Claret, Thore Graepel, Aditya Nori, Sriram Rajamani och Claudio Russo. I Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, volym 48 av ACM SIGPLAN NOTICES, pp 403-416, Association for Computing Machinery (ACM), New York, NY, 2013. (DOI).
  24. Optimising quality of information in data collection for mobile sensor networks. Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai och Justin Pearson. I Proc. 21st International Symposium on Quality of Service, pp 163-172, IEEE Communications Society, 2013. (DOI, Fulltext).
  25. Constraints for Membership in Formal Languages under Systematic Search and Stochastic Local Search. Jun He. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1027, Acta Universitatis Upsaliensis, Uppsala, 2013. (fulltext).
  26. Solving string constraints: The case for constraint programming. Jun He, Pierre Flener, Justin Pearson och Wei Ming Zhang. I Principles and Practice of Constraint Programming: CP 2013, volym 8124 av Lecture Notes in Computer Science, pp 381-397, Springer Berlin/Heidelberg, 2013. (DOI).
  27. Underestimating the cost of a soft constraint is dangerous: Revisiting the edit-distance based soft regular constraint. Jun He, Pierre Flener och Justin Pearson. I Journal of Heuristics, volym 19, nummer 5, pp 729-756, 2013. (DOI).
  28. Dynamic and speculative polyhedral parallelization of loop nests using binary code patterns. Alexandra Jimborean, Philippe Clauss, Jean-François Dollinger, Vincent Loechner och Juan Manuel Martinez Caamaño. I ICCS 2013, volym 18 av Procedia Computer Science, pp 2575-2578, 2013. (DOI, fulltext:postprint).
  29. Online dynamic dependence analysis for speculative polyhedral parallelization. Alexandra Jimborean, Philippe Clauss, Juan Manuel Martinez Caamaño och Aravind Sukumaran-Rajam. I Euro-Par 2013 Parallel Processing, volym 8097 av Lecture Notes in Computer Science, pp 191-202, Springer Berlin/Heidelberg, 2013. (DOI, fulltext:postprint).
  30. Airspace sectorisation using constraint-based local search. Peter Jägare, Pierre Flener och Justin Pearson. I Proc. 10th USA/Europe Air Traffic Management Research and Development Seminar, Federal Aviation Administration, 2013. (fulltext:postprint).
  31. A quadratic extended edge-finding filtering algorithm for cumulative resource constraints. Roger Kameugne, Laure Pauline Fotso och Joseph Scott. I International Journal of Planning and Scheduling, volym 1, nummer 4, pp 264-284, 2013. (DOI).
  32. On the scalability of the Erlang term storage. David Klaftenegger, Konstantinos Sagonas och Kjell Winblad. I Proc. 12th ACM SIGPLAN Workshop on Erlang, pp 15-26, ACM Press, New York, 2013. (DOI).
  33. Network-Wide Sensornet Checkpointing Made Practical. Andreas Löscher, Nicolas Tsiftes, Thiemo Voigt och Vlado Handziski. I 10th European Conference on Wireless Sensor Networks, 2013.
  34. Factors Enabling Information Propagation in a Social Network Site. Matteo Magnani, Danilo Montesi och Luca Rossi. I The Influence of Technology on Social Network Analysis and Mining, pp 411-426, Springer Vienna, 2013. (DOI, Extern länk).
  35. Formation of multiple networks. Matteo Magnani och Luca Rossi. I Social Computing, Behavioral-Cultural Modeling and Prediction, pp 257-264, Springer Berlin Heidelberg, 2013. (DOI, Extern länk).
  36. From stars to galaxies: skyline queries on aggregate data. Matteo Magnani och Ira Assent. I Proceedings of the 16th International Conference on Extending Database Technology, pp 477-488, 2013. (DOI, Extern länk).
  37. On multidimensional network measures. Matteo Magnani, Anna Monreale, Giulio Rossetti och Fosca Giannotti. I Italian Conference on Sistemi Evoluti per le Basi di Dati (SEBD), 2013.
  38. Pareto Distance for Multi-layer Network Analysis. Matteo Magnani och Luca Rossi. I Social Computing, Behavioral-Cultural Modeling and Prediction, volym 7812 av Lecture Notes in Computer Science, pp 249-256, 2013. (DOI, Extern länk).
  39. SkyView: a user evaluation of the skyline operator. Matteo Magnani, Ira Assent, Kasper Hornbæ k, Mikkel R. Jakobsen och Ken Friis Larsen. I Proceedings of the ACM Conference on Information and Knowledge Management (CIKM), pp 2249-2254, 2013. (DOI, Extern länk).
  40. A parametric propagator for discretely convex pairs of sum constraints. Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener och Justin Pearson. I Principles and Practice of Constraint Programming: CP 2013, volym 8124 av Lecture Notes in Computer Science, pp 529-544, Springer Berlin/Heidelberg, 2013. (DOI).
  41. Des propagateurs indépendants des solveurs. Jean-Noël Monette, Pierre Flener och Justin Pearson. I Actes des Neuvièmes Journées Francophones de Programmation par Contraintes, pp 227-236, Aix-Marseille Université, France, 2013.
  42. Executable modelling of dynamic software product lines in the ABS language. Radu Muschevici, Dave Clarke och José Proenca. I Proc. 5th International Workshop on Feature-Oriented Software Development, pp 17-24, ACM Press, New York, 2013. (DOI, fulltext:postprint).
  43. On providing location privacy for mobile sinks in wireless sensor networks. Edith C.-H. Ngai och Ioana Rodhe. I Wireless networks, volym 19, nummer 1, pp 115-130, 2013. (DOI).
  44. Novice students' perception of learning in small groups. Aletta Nylén och Karl Marklund. I Enhancement and Innovation in Higher Education conference: 11 - 13 June 2013: conference materials, pp 123-131, 2013. (Post-conference publication).
  45. Professional communication skills for engineering professionals. Aletta Nylén och Arnold Pears. I Proc. 43rd ASEE/IEEE Frontiers in Education Conference, pp 257-263, IEEE, Piscataway, NJ, 2013. (DOI).
  46. Using Competencies to Structure Scientific Writing Education. Aletta Nylén och Christina Dörge. I HDI 2012 – Informatik für eine nachhaltige Zukunft, volym 5 av Commentarii informaticae didacticae (CID), pp 33-44, Universitätsverlag Potsdam, Potsdam, 2013. (Extern länk).
  47. Secure compilation of Object-Oriented components to protected module architectures. Marco Patrignani, Dave Clarke och Frank Piessens. I Programming Languages and Systems, volym 8301 av Lecture Notes in Computer Science, pp 176-191, Springer Berlin/Heidelberg, 2013. (fulltext:postprint).
  48. Service support system modelling language for simulation-driven development of functional products. Sean Reed, Magnus Löfstrand, Lennart Karlsson och John Andrews. I Procedia CIRP, volym 11, pp 420-424, 2013. (DOI).
  49. Precise explanation of success typing errors. Konstantinos Sagonas, Josep Silva och Salvador Tamarit. I Proc. ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, pp 33-42, ACM Press, New York, 2013. (DOI).
  50. Can users control their data in social software?: An ethical analysis of control systems. Rula Sayaf, James B. Rule och Dave Clarke. I Proc. Security and Privacy Workshops 2013, IEEE Computer Society, 2013. (DOI).
  51. Bounded strings for constraint programming. Joseph D. Scott, Pierre Flener och Justin Pearson. I Proc. 25th International Conference on Tools with Artificial Intelligence, pp 1036-1043, IEEE Computer Society, 2013. (DOI).
  52. Scalable Preservation, Reconstruction, and Querying of Databases in terms of Semantic Web Representations. Silvia Stefanova. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1052, Acta Universitatis Upsaliensis, Uppsala, 2013. (fulltext).
  53. Scalable reconstruction of RDF-archived relational databases. Silvia Stefanova och Tore Risch. I Proc. 5th International Workshop on Semantic Web Information Management, pp 5:1-4, ACM Press, New York, 2013. (DOI).
  54. Integrative educational approach oriented towards software and system development. Anca-Juliana Stoica och Shareeful Islam. I International Journal of Engineering Pedagogy, volym 3, nummer 1, pp 36-43, 2013.
  55. Teaching information and software security courses in regular and distance learning programs: Education theory and practice, framework, and examples. Anca-Juliana Stoica och Shareeful Islam. I Proc. 4th Global Engineering Education Conference, pp 44-49, IEEE, Piscataway, NJ, 2013. (DOI).
  56. Structured Aliasing. Tobias Wrigstad. I Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volym 7850 av Lecture Notes in Computer Science, pp 512-513, Springer Berlin/Heidelberg, 2013. (DOI).
  57. Model-based validation of streaming data. Cheng Xu, Daniel Wedlund, Martin Helgoson och Tore Risch. I Proc. 7th ACM International Conference on Distributed Event-Based Systems, pp 107-113, ACM Press, New York, 2013. (DOI).
  58. Bells and Whistles: Advanced language features in psi-calculi. Johannes Åman Pohjola. Licentiatavhandling, IT licentiate theses / Uppsala University, Department of Information Technology nr 2013-004, Uppsala University, 2013. (fulltext).
  59. Negative premises in applied process calculi. Johannes Åman Pohjola, Johannes Borgström, Joachim Parrow, Palle Raabjerg och Ioana Rodhe. Technical report / Department of Information Technology, Uppsala University nr 2013-014, 2013. (Extern länk).

2012

  1. Constraint programming for air traffic management: a survey. Cyril Allignol, Nicolas Barnier, Pierre Flener och Justin Pearson. I Knowledge engineering review (Print), volym 27, nummer 3, pp 361-392, 2012. (DOI).
  2. Scientific SPARQL: Semantic web queries over scientific data. Andrej Andrejev och Tore Risch. I Proc. 28th International Conference on Data Engineering Workshops, pp 5-10, IEEE Computer Society, 2012. (DOI).
  3. A scalability benchmark suite for Erlang/OTP. Stavros Aronis, Nikolaos Papaspyrou, Katerina Roukounaki, Konstantinos Sagonas, Yiannis Tsiouris och Ioannis E. Venetis. I Proc. 11th ACM SIGPLAN Workshop on Erlang, pp 33-42, ACM Press, New York, 2012. (DOI).
  4. An Introduction To Bayesian Networks in Systems and Control. Michael Ashcroft. 2012 18th International Conference on Automation and Computing (ICAC), 2012.
  5. Bayesian Networks in Business Analytics. Michael Ashcroft. I 2012 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), pp 955-961, 2012.
  6. Using Bayesian networks in business analytics: Overview and short case study. Michael Ashcroft. I Business Informatics, volym 3, nummer 25, 2012.
  7. Scalable ordered indexing of streaming data. Sobhan Badiozamany och Tore Risch. I 3rd International Workshop on Accelerating Data Management Systems using Modern Processor and Storage Architectures, p 11, 2012. (Fulltext).
  8. Professionella kompetenser i projektkurser. Åsa Cajander, Mats Daniels, Helena Bernáld och Björn Victor. I Proc. 3:e Utvecklingskonferensen för Sveriges ingenjörsutbildningar, volym 75 av Linköping Electronic Conference Proceedings, pp 123-128, Linköping University Electronic Press, 2012. (Extern länk).
  9. The impact of trace and adversary models on location privacy provided by K-anonymity. Volkan Cambazoglu, Christian Rohner och Björn Victor. I Proc. 1st Workshop on Measurement, Privacy, and Mobility, ACM Press, New York, 2012. (DOI).
  10. Privacy preserving data publishing for recommender system. Xiaoqiang Chen och Vincent Huang. I Proc. 36th International Computer Software and Applications Conference Workshops, pp 128-133, IEEE Computer Society, 2012. (DOI).
  11. Constraint Programming for Air Traffic Management: Preface. Pierre Flener, Justin Pearson och Marc Bourgois. I Knowledge engineering review (Print), volym 27, nummer 3, pp 287-289, 2012. (DOI).
  12. An optimisation-based approach for wireless sensor deployment in mobile sensing environments. Farshid Hassani Bijarbooneh, Pierre Flener, Edith C.-H. Ngai och Justin Pearson. I Proc. Wireless Communications and Networking Conference 2012, pp 2108-2112, IEEE Communications Society, 2012. (DOI).
  13. Macroprogramming of Wireless Sensor Networks using Task Graphs and Constraint Solving. Farshid Hassani Bijarbooneh och Martin Jacobsson. 8th Swedish National Computer Networking Workshop (SNCNW), 7-8 June, 2012, Stockholm, Sweden, 2012.
  14. Solution neighbourhoods for constraint-directed local search. Jun He, Pierre Flener och Justin Pearson. I Proc. 27th ACM Symposium on Applied Computing, pp 74-79, ACM Press, New York, 2012. (DOI).
  15. Software risk management modeling using goal-driven approach from early requirements engineering. Shareeful Islam och Anca-Juliana Stoica. I Risk Assessment and Management, pp 385-401, Publishing Services LLC, Cheyenne, WY, 2012. (Extern länk).
  16. Computing Strong and Weak Bisimulations for Psi-Calculi. Magnus Johansson, Björn Victor och Joachim Parrow. I Journal of Logic and Algebraic Programming, volym 81, nummer 3, pp 162-180, Elsevier, 2012. (DOI).
  17. Combinatorial problem solving over relational databases: View synthesis through constraint-based local search. Toni Mancini, Pierre Flener och Justin K. Pearson. I Proc. 27th ACM Symposium on Applied Computing, pp 80-87, ACM Press, New York, 2012. (DOI).
  18. Towards solver-independent propagators. Jean-Noël Monette, Pierre Flener och Justin Pearson. I Principles and Practice of Constraint Programming: CP 2012, volym 7514 av Lecture Notes in Computer Science, pp 544-560, Springer Berlin/Heidelberg, 2012. (DOI, fulltext:postprint).
  19. Progression i skrivfärdigheter hos studenter i datavetenskap. Aletta Nylén. I Proc. NU 2012: Gränslöst lärande, Chalmers University of Technology, Göteborg, Sweden, 2012. (Abstract).
  20. On preserving term sharing in the Erlang virtual machine. Nikolaos Papaspyrou och Konstantinos Sagonas. I Proc. 11th ACM SIGPLAN Workshop on Erlang, pp 11-20, ACM Press, New York, 2012. (DOI).
  21. Proof Exchange for Theorem Proving: PxTP 2012. David Pichardie och Tjark Weber (red). Volym 878 av CEUR Workshop Proceedings, 2012. (Proceedings).
  22. Extending psi-calculi and their formal proofs. Palle Raabjerg. Licentiatavhandling, IT licentiate theses / Uppsala University, Department of Information Technology nr 2012-008, Uppsala University, 2012. (fulltext).
  23. Adaptive Parallelization of Queries to Data Providing Web Service Operations. Manivasakan Sabesan och Tore Risch. I Transactions on Large-Scale Data- and Knowledge-Centered Systems V, volym 7100 av Lecture Notes in Computer Science, pp 49-69, Springer, 2012. (DOI).
  24. ErLLVM: An LLVM backend for Erlang. Konstantinos Sagonas, Chris Stavrakakis och Yiannis Tsiouris. I Proc. 11th ACM SIGPLAN Workshop on Erlang, pp 21-32, ACM Press, New York, 2012. (DOI).
  25. Logics and Algorithms for Verification of Concurrent Systems. Rafa? Somla. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 964, Acta Universitatis Upsaliensis, Uppsala, 2012. (fulltext).
  26. Concurrent view modeling for software risk management at early development stage. Anca-Juliana Stoica och Shareeful Islam. I Proc. 1st International Conference on Theory and Practice in Modern Computing, pp 35-44, IADIS Press, 2012.
  27. Educational methods for software and systems development. Anca-Juliana Stoica och Shareeful Islam. I Proc. 15th International Conference on Interactive Collaborative Learning, p 8, IEEE, Piscataway, NJ, 2012. (DOI).
  28. Contingency plans for air traffic flow and capacity management using constraint programming. Karl Sundequist Blomdahl, Pierre Flener och Justin Pearson. I Journal of Aerospace Operations, volym 1, pp 249-266, 2012. (DOI).
  29. On the use of underspecified data-type semantics for type safety in low-level code. Hendrik Tews, Marcus Völp och Tjark Weber. I Proc. 7th Conference on Systems Software Verification: SSV 2012, volym 102 av Electronic Proceedings in Theoretical Computer Science, pp 73-87, 2012. (DOI).
  30. Structured Aliasing. Tobias Wrigstad. I ECOOP 2012 – Object-Oriented Programming, volym 7313 av Lecture Notes in Computer Science, pp 232-232, Springer Berlin/Heidelberg, 2012. (DOI).
  31. Multiple Aggregate Entry Points for Ownership Types. Johan Östlund och Tobias Wrigstad. I ECOOP 2012 – Object-Oriented Programming, volym 7313 av Lecture Notes in Computer Science, pp 156-180, Springer Berlin/Heidelberg, 2012. (DOI).
  32. The Joelle Programming Language: Evolving Java Programs Along Two Axes of Parallel Eval. Johan Östlund, Stephan Brandauer och Tobias Wrigstad. 2012 International Workshop on Languages for the Multi-core Era, 2012.

2011

  1. Maintaining Database Integrity with Refinement Types. Ioannis G. Baltopoulos, Johannes Borgström och Andrew D. Gordon. I ECOOP 2011 – Object-Oriented Programming, volym 6813 av Lecture Notes in Computer Science, pp 484-509, Springer-Verlag, Berlin, 2011. (DOI).
  2. Psi-calculi: a framework for mobile processes with nominal data and logic. Jesper Bengtson, Magnus Johansson, Joachim Parrow och Björn Victor. I Logical Methods in Computer Science, volym 7, nummer 1, p 11, 2011. (DOI).
  3. Refinement types for secure implementations. Jesper Bengtson, Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon och Sergio Maffeis. I ACM Transactions on Programming Languages and Systems, volym 33, nummer 2, pp 8:1-45, 2011. (DOI).
  4. Broadcast Psi-calculi with an Application to Wireless Protocols. Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola och Joachim Parrow. I Software Engineering and Formal Methods: SEFM 2011, volym 7041 av Lecture Notes in Computer Science, pp 74-89, Springer Berlin/Heidelberg, 2011. (DOI, fulltext:postprint).
  5. Verified Stateful Programs with Substructural State and Hoare Types. Johannes Borgström, Juan Chen och Nikhil Swamy. I Proc. 5th ACM Workshop on Programming Languages Meets Program Verification, pp 15-26, ACM Press, New York, 2011. (DOI).
  6. Detection of asynchronous message passing errors using static analysis. Maria Christakis och Konstantinos Sagonas. I Practical Aspects of Declarative Languages, volym 6539 av Lecture Notes in Computer Science, pp 5-18, Springer Berlin/Heidelberg, 2011. (DOI).
  7. Consistency of constraint networks induced by automaton-based constraint specifications. María Andreína Francisco Rodríguez, Pierre Flener och Justin Pearson. I Proc. 10th International Workshop on Constraint Modelling and Reformulation, pp 117-131, Department of Mathematics and Informatics, University of Perugia, Italy, 2011. (Proceedings).
  8. A type and effect system for deadlock avoidance in low-level languages. Prodromos Gerakios, Nikolaos Papaspyrou och Konstantinos Sagonas. I Proc. 6th International Workshop on Types in Language Design and Implementation, pp 15-28, ACM Press, New York, 2011. (DOI).
  9. Energy-efficient task mapping for data-driven sensor network macroprogramming using constraint programming. Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai och Justin Pearson. I Operations Research, Computing, and Homeland Defense, pp 199-209, Institute for Operations Research and the Management Sciences, Hanover, MD, 2011. (DOI).
  10. An <em>automaton</em> constraint for local search. Jun He, Pierre Flener och Justin Pearson. I Fundamenta Informaticae, volym 107, pp 223-248, 2011. (DOI).
  11. A quadratic edge-finding filtering algorithm for cumulative resource constraints. Roger Kameugne, Laure Pauline Fotso, Joseph Scott och Youcheu Ngo-Kateu. I Principles and Practice of Constraint Programming – CP 2011, volym 6876 av Lecture Notes in Computer Science, pp 478-492, Springer-Verlag, Berlin, 2011. (DOI).
  12. Framtidsoptimerad livscykeloch hantering av versioner: för Scanias Fleet ManagementavdelningOptimizing Scanias Fleet Management softwarelifecycle and version management for the future. Markus Karlsson och David Åhman. Examensarbete, handledare: Mats Axelsson, examinator: Elísabet Andrésdóttir, Roland Bol, UPTEC STS nr 11040, 2011. (fulltext).
  13. Adaptive parallelization of queries calling dependent data providing web services. Manivasakan Sabesan och Tore Risch. I New Frontiers in Information and Software as Services: Service and Application Design Challenges in the Cloud, volym 74 av Lecture Notes in Business Information Processing, pp 132-154, Springer-Verlag, Berlin, 2011. (DOI).
  14. Optimizing Unbound-property Queries to RDF Views of RelationalDatabases. Silvia Stefanova och Tore Risch. I , pp 43-58, Bonn, Germany, 2011. (Extern länk).
  15. Demonstrating early value in software system projects using software and system cost models. Anca-Juliana Stoica. I Proc. 26th International Forum on Systems/Software Cost Modeling, University of Southern California, Los Angeles, CA, 2011.
  16. Quantitative framework for managing software life cycle. Anca-Juliana Stoica, Prabhu Babu och Peter Stoica. I The Open Software Engineering Journal, volym 5, pp 1-18, 2011. (DOI).
  17. Lower trees with fixed degrees: a recipe for efficient secure hierarchical aggregation in WSNs. Davor Sutic, Ioana Rodhe, Christian Rohner och Björn Victor. I 2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), pp 659-664, IEEE Computer Society, 2011. (DOI).
  18. A scalable architecture for e-Science data management. Salman Toor, Manivasakan Sabesan, Sverker Holmgren och Tore Risch. I Proc. 7th International Conference on e-Science, pp 210-217, IEEE Computer Society, Los Alamitos, CA, 2011. (DOI).
  19. Is the World Ready for Ownership Types? Is Ownership Types Ready for the World?. Tobias Wrigstad och Dave Clarke. International Workshop on Aliasing, Confinement and Ownership in object-oriented programming: IWACO at ECOOP (Vetenskapsrådet), 2011.
  20. Owners as Ombudsmen: Multiple Aggregate Entry Points for Ownership Types. Tobias Wrigstad och Johan Östlund. International Workshop on Aliasing, Confinement and Ownership in object-oriented programming: IWACO at ECOOP (Vetenskapsrådet), 2011.
  21. Massive scale-out of expensive continuous queries. Erik Zeitler och Tore Risch. I 36th International Conference on Very Large Data Bases: VLDB 2010, 2011.
  22. Scalable Parallelization of Expensive Continuous Queries over Massive Data Streams. Erik Zeitler. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 836, Acta Universitatis Upsaliensis, Uppsala, 2011. (fulltext).
  23. Regions as Owners: A Discussion on Ownership-based Effects in Practice. Johan Östlund och Tobias Wrigstad. International Workshop on Aliasing, Confinement and Ownership in object-oriented programming: IWACO at ECOOP, 2011.

2010

  1. On matrices, automata, and double counting. Nicolas Beldiceanu, Mats Carlsson, Pierre Flener och Justin Pearson. I Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volym 6140 av Lecture Notes in Computer Science, pp 10-24, Springer-Verlag, Berlin, 2010. (DOI).
  2. Tribal ownership. Nicholas Cameron, James Noble och Tobias Wrigstad. I Proc. 1st International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, volym 45:10 av ACM SIGPLAN Notices, pp 618-633, ACM Press, New York, 2010. (DOI).
  3. Static detection of race conditions in Erlang. Maria Christakis och Konstantinos Sagonas. I Practical Aspects of Declarative Languages: PADL 2010, volym 5937 av Lecture Notes in Computer Science, pp 119-133, Springer-Verlag, Berlin, 2010. (DOI).
  4. Inductive programming. Pierre Flener och Ute Schmid. I Encyclopedia of Machine Learning, pp 537-544, Springer, New York, 2010. (DOI).
  5. Proc. 10th International Workshop on Symmetry in Constraint Satisfaction Problems. Pierre Flener och Justin Pearson (red). Department of Information Technology, Uppsala University, Uppsala, Sweden, 2010. (Proceedings).
  6. Programming by demonstration. Pierre Flener och Ute Schmid. I Encyclopedia of Machine Learning, pp 805-805, Springer, New York, 2010. (DOI).
  7. Trace-based programming. Pierre Flener och Ute Schmid. I Encyclopedia of Machine Learning, pp 989-989, Springer, New York, 2010. (DOI).
  8. A concurrent language with a uniform treatment of regions and locks. Prodromos Gerakios, Nikolaos Papaspyrou och Konstantinos Sagonas. I Proc. 2nd Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software: PLACES 2009, volym 17 av Electronic Proceedings in Theoretical Computer Science, pp 79-93, 2010. (DOI).
  9. Race-free and memory-safe multithreading: Design and implementation in Cyclone. Prodromos Gerakios, Nikolaos Papaspyrou och Konstantinos Sagonas. I Proc. 5th International Workshop on Types in Language Design and Implementation, pp 15-26, ACM Press, New York, 2010. (DOI).
  10. Energy-efficient task-mapping for data-driven sensor network macroprogramming using constraint programming. Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai och Justin Pearson. I Proc. 9th International Workshop on Constraint Modelling and Reformulation, p 13, Department of Information Technology, Uppsala University, Uppsala, Sweden, 2010. (fulltext).
  11. A Fully Abstract Symbolic Semantics for Psi-Calculi. Magnus Johansson, Björn Victor och Joachim Parrow. I Proc. 6th Workshop on Structural Operational Semantics: SOS 2009, volym 18 av Electronic Proceedings in Theoretical Computer Science, pp 17-31, 2010. (DOI).
  12. Weak Equivalences in Psi-calculi. Magnus Johansson, Jesper Bengtson, Joachim Parrow och Björn Victor. I Proc. 25th Symposium on Logic in Computer Science: LICS 2010, pp 322-331, IEEE, Piscataway, NJ, 2010. (DOI).
  13. Local search over relational databases. Toni Mancini, Pierre Flener och Justin Pearson. I Proc. 7th International Workshop on Local Search Techniques in Constraint Satisfaction, p 15, Department of Computing Science and Engineering, Université catholique de Louvain, Belgium, 2010. (Fulltext).
  14. Automated Web Service Query Service. Manivasakan Sabesan, Tore Risch och Feng Luan. I International Journal of Web and Grid Services (IJWGS), volym 6, nummer 4, pp 400-423, 2010. (DOI).
  15. Querying Data Providing Web Services. Manivasakan Sabesan. Doktorsavhandling, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 755, Acta Universitatis Upsaliensis, Uppsala, 2010. (fulltext).
  16. Using static analysis to detect type errors and concurrency defects in Erlang programs. Konstantinos Sagonas. I Functional and Logic Programming: FLOPS 2010, volym 6009 av Lecture Notes in Computer Science, pp 13-18, Springer-Verlag, Berlin, 2010. (DOI).
  17. SPARQL queries to RDFS views of Topic Maps. Silvia Stefanova och Tore Risch. I International Journal of Metadata, Semantics and Ontologies (IJMSO), volym 5, nummer 1, pp 1-16, Inderscience, 2010. (DOI).
  18. Agile software development and ISO-IEC software quality standards: Measuring economic benefits and calculating quantitative yields. Anca-Juliana Stoica och Margus Nael. I Proc. 25th International Forum on Systems/Software Cost Modeling, University of Southern California, Los Angeles, CA, 2010.
  19. Contingency plans for air traffic flow and capacity management. Karl Sundequist Blomdahl, Pierre Flener och Justin Pearson. I Proc. 9th Innovative Research Workshop and Exhibition, pp 119-126, EUROCONTROL Experimental Centre, Brétigny sur Orge, France, 2010. (fulltext).
  20. Contingency plans for air traffic management. Karl Sundequist Blomdahl, Pierre Flener och Justin Pearson. I Principles and Practice of Constraint Programming – CP 2010, volym 6308 av Lecture Notes in Computer Science, pp 643-657, Springer-Verlag, Berlin, 2010. (DOI).
  21. Scalable Splitting of Massive Data Streams. Erik Zeitler och Tore Risch. I Database Systems for Advanced Applications: Part II, volym 5982 av Lecture Notes in Computer Science, pp 184-198, Springer-Verlag, Berlin, 2010. (DOI, fulltext).
  22. Welterweight Java. Johan Östlund och Tobias Wrigstad. I Objects, Models, Components, Patterns, volym 6141 av Lecture Notes in Computer Science, pp 97-116, Springer-Verlag, Berlin, 2010. (DOI).

Uppdaterad  2021-01-06 18:28:26 av Pierre Flener.