Department of Information Technology

Publications

Div. of Computing Science

2015

  1. Stateless model checking for TSO and PSO. Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, and Konstantinos Sagonas. In Tools and Algorithms for the Construction and Analysis of Systems: TACAS 2015, volume 9035 of Lecture Notes in Computer Science, pp 353-367, Springer Berlin/Heidelberg, 2015. (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, and Christel A. S. Bergström. In International Journal of Pharmaceutics, volume 495, number 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 and Magnus Löfstrand. In Evolving Systems, volume 6, number 3, pp 187-198, 2015. (DOI).
  4. Spatio-Temporal Gridded Data Processing on the Semantic Web. Andrej Andrejev, Dimitar Misev, Peter Baumann, and Tore Risch. In 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, and Maxime Meyer. In 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, and Maxime Meyer. In 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, and Nico Prucha. In 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, and Charles Prud'homme. In Global Conference on Artificial Intelligence: GCAI 2015, volume 36 of EasyChair Proceedings in Computing, pp 27-41, Cool Press, Manchester, UK, 2015. (Abstract).
  9. 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, and Mohamed Shenify. In 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).
  10. A constraint-based local search backend for MiniZinc. Gustav Björdal, Jean-Noël Monette, Pierre Flener, and Justin Pearson. In Constraints, volume 20, number 3, pp 325-345, 2015. (DOI).
  11. Anomaly detection with Machine learning: Quality assurance of statistical data in the Aid community. Hanna Blomquist and Johanna Möller. Student thesis, supervisor: Franck Rasmussen, examiner: Elisabet Andrésdóttir, Michael Ashcroft, UPTEC STS nr 15014, 2015. (fulltext).
  12. Broadcast psi-calculi with an application to wireless protocols. Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, and Joachim Parrow. In Software and Systems Modeling, volume 14, number 1, pp 201-216, Springer, 2015. (DOI, fulltext:postprint).
  13. The Psi-Calculi Workbench: A Generic Tool for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, and Björn Victor. In ACM Transactions on Embedded Computing Systems, volume 14, number 1, 2015. (DOI, fulltext:postprint).
  14. Clustering attributed graphs: models, measures and methods. Cecile Bothorel, Juan David Cruz, Matteo Magnani, and Barbora Micenkova. In Network Science, volume 3, number 3, pp 408-444, 2015. (DOI, fulltext:postprint).
  15. Disjointness Domains for Fine-Grained Aliasing. Stephan Brandauer, Dave Clarke, and Tobias Wrigstad. In , ACM SIGPLAN NOTICES, pp 989-916, 2015. (DOI).
  16. Parallel Objects for Multicores: A Glimpse at the Parallel Language ENCORE. Stephan Brandauer, Elias Castegren, Dave Clarke, Kiko Fernandez-Reyes, Einar Broch Johnsen, Ka I. Pun, S. Lizeth Tapia Tarifa, Tobias Wrigstad, and Albert Mingkun Yang. In Formal Methods for Multicore Programming, volume 9104 of Lecture Notes in Computer Science, pp 1-56, 2015. (DOI).
  17. Modelling and analysing a WSN secure aggregation protocol: A comparison of languages and tool support. Volkan Cambazoglu, Ramunas Gutkovas, Johannes Åman Pohjola, and Björn Victor. Technical report / Department of Information Technology, Uppsala University nr 2015-033, 2015. (External link).
  18. A structured approach to training open-ended problem solving. Sofia Cassel and Björn Victor. In Proc. 45th ASEE/IEEE Frontiers in Education Conference, Frontiers in Education Conference, pp 417-420, IEEE Press, Piscataway, NJ, 2015. (DOI).
  19. Refined Ownership: Fine-grained controlled internal sharing. Elias Castegren, Johan Östlund, and Tobias Wrigstad. In Formal Methods for Multicore Programming, volume 9104 of Lecture Notes in Computer Science, pp 179-210, 2015. (DOI).
  20. Abstract Delta Modelling. Dave Clarke, Michiel Helvensteijn, and Ina Schaefer. In Mathematical Structures in Computer Science, volume 25, number 3, pp 482-527, Cambridge University Press, 2015.
  21. The 2013 Evaluation of SMT-COMP and SMT-LIB. David R. Cok, Aaron Stump, and Tjark Weber. In Journal of automated reasoning, volume 55, number 1, pp 61-90, 2015. (DOI).
  22. Competencies for paradigm shift "survival". Mats Daniels, Åsa Cajander, Anna Eckerdal, Mats Lind, Aletta Nylén, Tony Clear, and Roger McDermott. In Proc. 45th ASEE/IEEE Frontiers in Education Conference, pp 1424-1429, IEEE Press, Piscataway, NJ, 2015. (DOI).
  23. Refraction: Low-cost management of reflective meta-data in pervasive component-based applications. Wilfried Daniels, José Proença, Dave Clarke, Wouter Joosen, and Danny Hughes. In Proc. 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering, pp 27-36, ACM Press, New York, 2015. (DOI).
  24. Enabling design of performance-controlled sensor network applications through task allocation and reallocation. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson, and Konstantinos Sagonas. In Proc. 11th International Conference on Distributed Computing in Sensor Systems, pp 248-253, IEEE Computer Society, 2015. (DOI, fulltext:postprint).
  25. Optimal Task Allocation in Sensor and Actuator Networks. Atis Elsts. In Proc. 11th Swedish National Computer Networking Workshop, 2015.
  26. ProFuN TG: A Tool Using Abstract Task Graphs to Facilitate the Development, Deployment and Maintenance of Wireless Sensor Network Applications. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson, and Konstantinos Sagonas. In Proc. Poster/Demo Session: 12th European Conference on Wireless Sensor Networks, pp 19-20, 2015.
  27. ProFuN TG: A tool for programming and managing performance-aware sensor network applications. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson, and Konstantinos Sagonas. In IEEE 40th Local Computer Networks Conference Workshops (LCN Workshops), pp 751-759, IEEE Computer Society, 2015. (DOI, fulltext:preprint).
  28. ProFuN TG: Programming Sensornets with Task Graphs for Increased Reliability and Energy-Efficiency. Atis Elsts, Farshid Hassani Bijarbooneh, Martin Jacobsson, and Konstantinos Sagonas. In , IEEE Computer Society, 2015. (External link, fulltext:postprint).
  29. Automatic irony- and sarcasm detection in Social media. Erik Forslid and Niklas Wikén. Student thesis, supervisor: Magnus Sahlgren, examiner: Tomas Nyberg, Michael Ashcroft, UPTEC F nr 15045, 2015. (fulltext).
  30. Implied constraints for AUTOMATON constraints. María Andreína Francisco Rodríguez, Pierre Flener, and Justin Pearson. In Global Conference on Artificial Intelligence: GCAI 2015, volume 36 of EasyChair Proceedings in Computing, pp 113-126, Cool Press, Manchester, UK, 2015. (Abstract).
  31. Probabilistic programs as spreadsheet queries. Andrew D. Gordon, Claudio Russo, Marcin Szymczak, Johannes Borgström, Nicolas Rolland, Thore Graepel, and Daniel Tarlow. In Programming Languages and Systems, volume 9032 of Lecture Notes in Computer Science, pp 1-25, Springer Berlin/Heidelberg, 2015. (DOI, fulltext:postprint).
  32. Motivation and Grade Gap Related to Gender in a Programming Course. Virginia Grande and Joachim Parrow. In , 2015. (DOI).
  33. A constraint optimisation model for analysis of telecommunication protocol logs. Olga Grinchtein, Mats Carlsson, and Justin Pearson. In Tests and Proofs: TAP 2015, volume 9154 of Lecture Notes in Computer Science, pp 137-154, Springer, 2015. (DOI).
  34. Testing of a telecommunication protocol using constraint programming. Olga Grinchtein, Mats Carlsson, and Justin Pearson. In 2015 IEEE Eighth International Conference On Software Testing, Verification And Validation Workshops (ICSTW), IEEE International Conference on Software Testing Verification and Validation Workshops, 2015.
  35. Constraint Programming for Wireless Sensor Networks. Farshid Hassani Bijarbooneh. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1219, Acta Universitatis Upsaliensis, Uppsala, 2015. (fulltext, preview image).
  36. A high-level model for an assembly language attacker by means of reflection. Adriaan Larmuseau, Marco Patrignani, and Dave Clarke. In Dependable Software Engineering: Theories, Tools, and Applications, volume 9409 of Lecture Notes in Computer Science, pp 168-182, Springer, 2015. (DOI, fulltext:preprint).
  37. A secure compiler for ML modules. Adriaan Larmuseau, Marco Patrignani, and Dave Clarke. In Programming Languages and Systems: APLAS 2015, volume 9458 of Lecture Notes in Computer Science, pp 29-48, Springer, 2015. (DOI).
  38. Formalizing a secure foreign function interface. Adriaan Larmuseau and Dave Clarke. In Software Engineering and Formal Methods, volume 9276 of Lecture Notes in Computer Science, pp 215-230, Springer, 2015. (DOI, fulltext:postprint).
  39. Defining 'Functional Products' through their constituents. John Lindström, Daria Sas, Håkan Lideskog, Magnus Löfstrand, and Lennart Karlsson. In International Journal of Product Development, volume 20, number 1, pp 1-24, 2015. (DOI).
  40. Property-Based Testing of Sensor Networks. Andreas Löscher, Konstantinos Sagonas, and Thiemo Voigt. In Proc. 12th International Conference on Sensing, Communication, and Networking, pp 100-108, IEEE Communications Society, 2015.
  41. NoSQL approach to large scale analysis of persisted streams. Khalid Mahmood, Thanh Truong, and Tore Risch. In Data Science, volume 9147 of Lecture Notes in Computer Science, pp 152-156, Springer, 2015. (DOI).
  42. Automated auxiliary variable elimination through on-the-fly propagator generation. Jean-Noël Monette, Pierre Flener, and Justin Pearson. In Principles and Practice of Constraint Programming: CP 2015, volume 9255 of Lecture Notes in Computer Science, pp 313-329, Springer, 2015. (DOI).
  43. Efficient caching for constrained skyline queries. Michael Mortensen, Sean Chester, Ira Assent, and Matteo Magnani. In Extending Database Technology (EDBT), 2015.
  44. Multidimensional analysis of creative coding MOOC forums: a methodological discussion. Aletta Nylén, Neena Thota, Anna Eckerdal, Päivi Kinnunen, Matthew Butler, and Michael Morgan. In Proc. 15th International Conference on Computing Education Research: Koli Calling, pp 137-141, ACM Press, New York, 2015. (DOI).
  45. Proc. 1st Al Baha University and Uppsala University Symposium on Quality in Computing Education. Aletta Nylén and Mohamed Shenify (eds). Volume 2015-007 of Technical report / Department of Information Technology, Uppsala University, 2015. (Abstract).
  46. Forecasting Lock Contention Before Adopting Another Lock Algorithm. Xiaoyue Pan, David Klaftenegger, and Bengt Jonsson. 2015. (fulltext).
  47. Modal Logics for Nominal Transition Systems. Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Gutkovas, and Tjark Weber. In 26th International Conference on Concurrency Theory: CONCUR 2015, volume 42 of Leibniz International Proceedings in Informatics (LIPIcs), pp 198-211, Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2015. (DOI, Fulltext).
  48. Fully abstract trace semantics for protected module architectures. Marco Patrignani and Dave Clarke. In Computer languages, systems & structures, volume 42, pp 22-45, 2015. (DOI).
  49. Secure compilation to protected module architectures. Marco Patrignani, Pieter Agten, Raoul Strackx, Bart Jacobs, Dave Clarke, and Frank Piessens. In ACM Transactions on Programming Languages and Systems, volume 37, number 2, 2015. (DOI).
  50. Implications of anonymous assessment. Arnold Pears and Aletta Nylén. In Proc. 45th ASEE/IEEE Frontiers in Education Conference, Frontiers in Education Conference, pp 1404-1408, IEEE Press, Piscataway, NJ, 2015. (DOI).
  51. Diffusion of Innovations over Multiplex Social Networks. Rasoul Ramezanian, Mostafa Salehi, Matteo Magnani, and Danilo Montesi. In International Symposium on Artificial Intelligence and Signal Processing (AISP), pp 1-5, 2015. (DOI, ArXiv).
  52. Towards effective visual analytics on multiplex and multilayer networks. Luca Rossi and Matteo Magnani. In Chaos, Solitons & Fractals, volume 72, pp 68-76, 2015. (DOI, fulltext:postprint).
  53. Contention adapting search trees. Konstantinos Sagonas and Kjell Winblad. In Proc. 14th International Symposium on Parallel and Distributed Computing, pp 215-224, IEEE conference proceedings, 2015. (DOI).
  54. Multidimensional epidemic thresholds in diffusion processes over interdependent networks. Mostafa Salehi, Payam Siyari, Matteo Magnani, and Danilo Montesi. In Chaos, Solitons & Fractals, volume 72, pp 59-67, 2015. (DOI).
  55. Spreading processes in Multilayer Networks. Mostafa Salehi, Rajesh Sharma, Moreno Marzolla, Matteo Magnani, Payam Siyari, and Danilo Montesi. In IEEE Transactions on Network Science and Engineering, volume 2, number 2, pp 65-83, IEEE Computer Society, 2015. (DOI, fulltext:postprint).
  56. The Other Side of Privacy: Surveillance in Data Control. Rula Sayaf, Dave Clarke, and James B. Rule. In British HCI 2015, pp 184-192, 2015. (DOI).
  57. Constraint solving on bounded string variables. Joseph D. Scott, Pierre Flener, and Justin Pearson. In Integration of AI and OR Techniques in Constraint Programming, volume 9075 of Lecture Notes in Computer Science, pp 375-392, Springer, 2015. (DOI).
  58. Investigating the types and effects of missing data in multilayer networks. Rajesh Sharma, Matteo Magnani, and Danilo Montesi. In International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp 392-399, 2015.
  59. Understanding community patterns in large attributed social networks. Rajesh Sharma, Matteo Magnani, and Danilo Montesi. In Proceedings Of The 2015 IEEE/ACM International Conference On Advances In Social Networks Analysis And Mining (Asonam 2015), pp 1503-1508, 2015. (DOI).
  60. System components of a general theory of software engineering. Anca-Juliana Stoica, Kristiaan Pelckmans, and William Rowe. In Science of Computer Programming, volume 101, pp 42-65, 2015. (DOI).
  61. Transparent inclusion, utilization, and validation of main memory domain indexes. Thanh Truong and Tore Risch. In Proc. 27th International Conference on Scientific and Statistical Database Management, ACM Press, New York, 2015. (DOI).
  62. Role and position detection in networks: reloaded. Davide Vega, Roc Meseguer, Felix Freitag, and Matteo Magnani. In International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp 320-325, 2015.
  63. Scalable queries over log database collections. Minpeng Zhu, Khalid Mahmood, and Tore Risch. In Data Science, volume 9147 of Lecture Notes in Computer Science, pp 173-185, Springer, 2015. (DOI).
  64. Editorial preface for the JLAMP Special Issue on Formal Methods for Software Product Line Engineering. Maurice ter Beek, Dave Clarke, and Ina Schafer. In The Journal of logical and algebraic methods in programming, volume 85, number 1, pp 123-124, 2015. (DOI).
  65. Measuring Polymorphism in Python Programs. Beatrice Åkerblom and Tobias Wrigstad. In Proc. 11th Symposium on Dynamic Languages, volume 51:2 2016 of 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, and Konstantinos Sagonas. In Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volume 49:1 of ACM SIGPLAN NOTICES, pp 373-384, ACM Press, New York, 2014. (DOI).
  2. Impact of cultural and language background on learning Computer Science concepts. Ismat Aldmour and Aletta Nylén. In 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, and Christel A. S. Bergström. In Molecular Pharmaceutics, volume 11, number 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, and Bengt Liljedahl. In Computers in industry (Print), volume 65, number 8, pp 1126-1135, 2014. (DOI).
  5. Experimental and Computational Prediction of Glass Transition Temperature of Drugs. Ahmad Alzghoul, Amjad Alhalaweh, Denny Mahlin, and Christel A. S. Bergström. In JOURNAL OF CHEMICAL INFORMATION AND MODELING, volume 54, number 12, pp 3396-3403, 2014. (DOI).
  6. Scientific data as RDF with arrays: Tight integration of SciSPARQL queries into MATLAB. Andrej Andrejev, Xueming He, and Tore Risch. In Proc. ISWC 2014 Posters & Demonstrations Track, volume 1272 of 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, and Tjark Weber. In Journal of Logical and Algebraic Methods in Programming, volume 83, number 2, pp 87-102, 2014. (DOI).
  8. Distributed multi-query optimization of continuous clustering queries. Sobhan Badiozamany. In 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, and Justin Pearson. In Proc. 17th Conference on Design, Automation and Test in Europe, IEEE, Piscataway, NJ, 2014. (DOI).
  10. Linking prefixes and suffixes for constraints encoded using automata with accumulators. Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, and Justin Pearson. In Principles and Practice of Constraint Programming: CP 2014, volume 8656 of Lecture Notes in Computer Science, pp 142-157, Springer, 2014. (DOI).
  11. Propagating regular counting constraints. Nicolas Beldiceanu, Pierre Flener, Justin Pearson, and Pascal Van Hentenryck. In Proc. 28th AAAI Conference on Artificial Intelligence: Volume 4, pp 2616-2622, AAAI Press, Palo Alto, CA, 2014. (External link).
  12. Toward sustainable development in constraint programming. Nicolas Beldiceanu, Pierre Flener, Jean-Noël Monette, Justin Pearson, and Helmut Simonis. In Constraints, volume 19, number 2, pp 139-149, 2014. (DOI).
  13. A Sorted Semantic Framework for Applied Process Calculi (extended abstract). Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, and Johannes Åman Pohjola. In Trustworthy Global Computing: TGC 2013, volume 8358 of Lecture Notes in Computer Science, pp 103-118, Springer Berlin/Heidelberg, 2014. (DOI).
  14. Proc. Combined 21st International Workshop on Expressiveness in Concurrency (EXPRESS 2014) and 11th Workshop on Structural Operational Semantics (SOS 2014). Johannes Borgström and Silvia Crafa (eds). Volume 160 of Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2014. (DOI).
  15. Protocol log analysis with constraint programming: Work in progress. Mats Carlsson, Olga Grinchtein, and Justin Pearson. In Satisfiability Modulo Theories: SMT 2014, volume 1163 of CEUR Workshop Proceedings, pp 17-26, RWTH Aachen University, 2014. (Fulltext).
  16. Enhanced learning by promoting engineering competencies. Sofia Cassel, Aletta Nylén, and Björn Victor. In Proc. 44th ASEE/IEEE Frontiers in Education Conference, pp 2044-2049, IEEE Press, Piscataway, NJ, 2014. (DOI, Proceedings).
  17. Teaching and learning with MOOCs: Computing academics' perspectives and engagement. Anna Eckerdal, Päivi Kinnunen, Neena Thota, Aletta Nylén, Judy Sheard, and Lauri Malmi. In Proc. 19th Conference on Innovation and Technology in Computer Science Education, pp 9-14, ACM Press, New York, 2014. (DOI).
  18. A Case for Node-Local Runtime Parameter Adaptation in Wireless Sensor Networks. Atis Elsts and Edith C.-H. Ngai. In Proc. 10th Swedish National Computer Networking Workshop, 2014.
  19. Propagators and violation functions for geometric and workload constraints arising in airspace sectorisation. Pierre Flener and Justin Pearson. Computing Research Repository nr 1401.7463, 2014. (External link).
  20. Static safety guarantees for a low-level multithreaded language with regions. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Science of Computer Programming, volume 80, number Part B, pp 223-263, 2014. (DOI).
  21. Tabular: a schema-driven probabilistic programming language. Andrew D. Gordon, Thore Graepel, Nicolas Rolland, Claudio Russo, Johannes Borgström, and John Guiver. In Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volume 49:1 of ACM SIGPLAN NOTICES, pp 321-334, ACM Press, New York, 2014. (DOI, fulltext:print).
  22. Advancing concurrent system verification: Type based approach and tools. Ramunas Gutkovas. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2014-007, Uppsala University, 2014. (fulltext).
  23. A constraint programming approach for managing end-to-end requirements in sensor network macroprogramming. Farshid Hassani Bijarbooneh, Animesh Pathak, Justin Pearson, Valérie Issarny, and Bengt Jonsson. In Proc. 3rd International Conference on Sensor Networks, pp 28-40, SciTePress, Setúbal, Portugal, 2014. (DOI).
  24. Energy-efficient sensor selection for data quality and load balancing in wireless sensor networks. Farshid Hassani Bijarbooneh, Wei Du, Edith Ngai, and Xiaoming Fu. In Proc. 22nd International Symposium on Quality of Service, pp 338-343, IEEE Communications Society, 2014. (DOI).
  25. Dynamic and speculative polyhedral parallelization using compiler-generated skeletons. Alexandra Jimborean, Philippe Clauss, Jean-François Dollinger, Vincent Loechner, and Juan Manuel Martinez Caamaño. In International journal of parallel programming, volume 42, number 4, pp 529-545, 2014. (DOI).
  26. Fix the code. Don't tweak the hardware: A new compiler approach to Voltage–Frequency scaling. Alexandra Jimborean, Konstantinos Koukos, Vasileios Spiliopoulos, David Black-Schaffer, and Stefanos Kaxiras. In Proc. 12th International Symposium on Code Generation and Optimization, pp 262-272, ACM Press, New York, 2014. (URL, fulltext:postprint).
  27. A quadratic edge-finding filtering algorithm for cumulative resource constraints. Roger Kameugne, Laure Pauline Fotso, Joseph Scott, and Youcheu Ngo-Kateu. In Constraints, volume 19, number 3, pp 243-269, 2014. (DOI).
  28. Brief announcement: queue delegation locking. David Klaftenegger, Konstantinos Sagonas, and Kjell Winblad. In Proc. 26th ACM Symposium on Parallelism in Algorithms and Architectures, pp 70-72, ACM Press, New York, 2014. (DOI, fulltext:print).
  29. Delegation locking libraries for improved performance of multithreaded programs. David Klaftenegger, Konstantinos Sagonas, and Kjell Winblad. In Euro-Par 2014: Parallel Processing, volume 8632 of Lecture Notes in Computer Science, pp 572-583, Springer Berlin/Heidelberg, 2014. (DOI).
  30. Session types for broadcasting. Dimitrios Kouzapas, Ramunas Gutkovas, and Simon J. Gay. In Proc. 7th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, volume 155 of Electronic Proceedings in Theoretical Computer Science, pp 25-31, 2014. (DOI, fulltext:print).
  31. Large-Scale Social Network Analysis. Mattia Lambertini, Matteo Magnani, Moreno Marzolla, Danilo Montesi, and Carmine Paolino. In Large-Scale Data Analytics, pp 155-187, Springer, 2014. (DOI).
  32. Operational Semantics for Secure Interoperation. Adriaan Larmuseau, Marco Patrignani, and Dave Clarke. In Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, 2014.
  33. Use of cloud services in functional products: Availability implications. John Lindström, Magnus Löfstrand, Sean Reed, and Ahmad Alzghoul. In Procedia CIRP, volume 16, pp 368-372, 2014. (DOI).
  34. Evaluating availability of functional products through simulation. Magnus Löfstrand, Petter Kyösti, Sean Reed, and Björn Backe. In Simulation Modelling Practice and Theory, volume 47, pp 196-209, 2014. (DOI).
  35. Efficient and Flexible Sensornet Checkpointing. Andreas Löscher, Nicolas Tsiftes, Thiemo Voigt, and Vlado Handziski. In Wireless Sensor Networks, volume 8354, pp -65, 2014. (DOI, Conference website).
  36. Multiple social networks, data models and measures for. Matteo Magnani and Luca Rossi. In Encyclopedia of Social Network Analysis and Mining, Springer, Berlin, 2014.
  37. Path-based and Whole Network Measures. Matteo Magnani and Moreno Marzolla. In Encyclopedia of Social Network Analysis and Mining, Springer, Berlin, 2014.
  38. Taking the Big Picture: Representative Skylines based on Significance and Diversity. Matteo Magnani, Ira Assent, and Michael L. Mortensen. In The VLDB journal, volume 23, number 5, pp 795-815, Springer Berlin/Heidelberg, 2014. (DOI).
  39. A propagator design framework for constraints over sequences. Jean-Noël Monette, Pierre Flener, and Justin Pearson. In Proc. 28th AAAI Conference on Artificial Intelligence: Volume 4, pp 2710-2716, AAAI Press, Palo Alto, CA, 2014. (External link).
  40. Higher-order psi-calculi. Joachim Parrow, Johannes Borgström, Palle Raabjerg, and Johannes Åman Pohjola. In Mathematical Structures in Computer Science, volume 24, number 2, Cambridge University Press, 2014. (DOI, fulltext:postprint).
  41. Fully abstract trace semantics for low-level isolation mechanisms. Marco Patrignani and Dave Clarke. In Symposium on Applied Computing, SAC 2014., pp 1562-1569, ACM Press, 2014. (DOI).
  42. 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, and Mohammed Gamar. In Proc. World Engineering Education Forum, pp 969-970, 2014.
  43. More scalable ordered set for ETS using adaptation. Konstantinos Sagonas and Kjell Winblad. In Proc. 13th ACM SIGPLAN Workshop on Erlang, pp 3-11, ACM Press, New York, 2014. (DOI).
  44. CPS2: a Contextual Privacy Framework for Social Software. Rula Sayaf, Dave Clarke, and Richard Harper. In 10th International Conference on Security and Privacy in Communication Networks (SECURECOMM2014), Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering, pp 25-32, 2014. (DOI).
  45. Missing data in multiplex networks: a preliminary study. Rajesh Sharma, Matteo Magnani, and Danilo Montesi. In , IEEE Computer Society, 2014.
  46. MOOCs and their impact on academics. Judy Sheard, Anna Eckerdal, Päivi Kinnunen, Lauri Malmi, Aletta Nylén, and Neena Thota. In Proc. 14th International Conference on Computing Education Research: Koli Calling, pp 137-145, ACM Press, New York, 2014. (DOI).
  47. Scalable Numerical Queries by Algebraic Inequality Transformations. Thanh Truong and Tore Risch. In Database Systems for Advanced Applications, Dasfaa 2014, PT I, volume 8421 of Lecture Notes in Computer Science, pp 95-109, 2014.
  48. Scaling Future Software: The Manycore Challenge. Frank de Boer, Einar Broch Johnsen, Dave Clarke, Sophia Drossopoulou, Nobuko Yoshida, and Tobias Wrigstad. 2014. (External link).
  49. Priorities Without Priorities: Representing Preemption in Psi-Calculi. Johannes Åman Pohjola and Joachim Parrow. In Proc. 21st International Workshop on Expressiveness in Concurrency, and 11th Workshop on Structural Operational Semantics, volume 160 of Electronic Proceedings in Theoretical Computer Science, pp 2-15, 2014. (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, and Tore Risch. In 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, and Tjark Weber. In Archive of Formal Proofs, 2013. (External link).
  3. Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL. Alasdair Armstrong, Georg Struth, and Tjark Weber. In Interactive Theorem Proving: ITP 2013, volume 7998 of 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 and Konstantinos Sagonas. In Trends in Functional Programming, volume 7829 of 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. In Twelfth Scandinavian Conference on Artificial Intelligence, volume 257 of 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, and Tore Risch. In 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, and Justin Pearson. In Constraints, volume 18, number 1, pp 108-140, 2013. (DOI).
  8. On the reification of global constraints. Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, and Justin Pearson. In Constraints, volume 18, number 1, pp 1-6, 2013. (DOI).
  9. Deriving Probability Density Functions from Probabilistic Functional Programs. Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, and Claudio Russo. In Tools and Algorithms for the Construction and Analysis of Systems: 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, volume 7795 of Lecture Notes in Computer Science, pp 508-522, Springer Berlin/Heidelberg, Berlin/Heidelberg, 2013. (DOI, fulltext:postprint).
  10. A Parametric Tool for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Ioana Rodhe, and Björn Victor. In 13th International Conference on Application of Concurrency to System Design (ACSD 2013), International Conference on Application of Concurrency to System Design, pp 180-185, IEEE Computer Society, 2013. (DOI).
  11. Measure transformer semantics for Bayesian machine learning. Johannes Borgström, Andrew D. Gordon, Michael Greenberg, James Margetson, and Jurgen van Gael. In Logical Methods in Computer Science, volume 9, number 3, p 11, 2013. (DOI, arXiv page).
  12. Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics. Johannes Borgström and Bas Luttik (eds). Volume 120 of Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2013. (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, and Ulf Wiger. In Trends in Functional Programming, volume 7829 of 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, and Matteo Magnani. In Proceedings of the Ninth International Workshop on Data Management on New Hardware (DaMoN @ SIGMOD), 2013. (DOI, External link).
  15. Fördjupat lärande genom aktiverande examination. Sofia Cassel and Björn Victor. In 4:e Utvecklingskonferensen för Sveriges ingenjörsutbildningar, pp 51-54, 2013.
  16. Systematic testing for detecting concurrency errors in Erlang programs. Maria Christakis, Alkis Gotovos, and Konstantinos Sagonas. In Proc. 6th International Conference on Software Testing, Verification and Validation, pp 154-163, IEEE Computer Society, 2013. (DOI).
  17. Bayesian Inference Using Data Flow Analysis. Guillaume Claret, Sriram Rajamani, Aditya Nori, Andrew D. Gordon, and Johannes Borgström. In ESEC/FSE '13: Proceedings of the 9th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, pp 92-102, ACM Press, New York, NY, USA, 2013. (DOI).
  18. Beyond the Geneva Convention on the Treatment of Object Aliasing. Dave Clarke, James Noble, and Tobias Wrigstad. In Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volume 7850 of Lecture Notes in Computer Science, pp 1-6, Springer Berlin/Heidelberg, 2013. (DOI).
  19. Ownership Types: A Survey. Dave Clarke, Johan Östlund, Ilya Sergey, and Tobias Wrigstad. In Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volume 7850 of Lecture Notes in Computer Science, pp 15-58, Springer Berlin/Heidelberg, 2013. (DOI).
  20. Spatio-Temporal Keyword Queries in Social Networks. Vittoria Cozza, Antonio Messina, Danilo Montesi, Luca Arietta, and Matteo Magnani. In 17th East-European Conference on Advances in Databases and Information Systems (ADBIS), pp 70-83, 2013. (DOI, External link).
  21. Automatic airspace sectorisation: A survey. Pierre Flener and Justin Pearson. Computing Research Repository nr 1311.0653, 2013. (External link).
  22. Generation of implied constraints for automaton-induced decompositions. María Andreína Francisco Rodríguez, Pierre Flener, and Justin Pearson. In 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, and Claudio Russo. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, volume 48 of ACM SIGPLAN NOTICES, pp 403-416, Association for Computing Machinery (ACM), New York, NY, 2013. (DOI).
  24. Optimising quality of information in data collection for mobile sensor networks. Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai, and Justin Pearson. In 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. Ph.D. thesis, 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, and Wei Ming Zhang. In Principles and Practice of Constraint Programming: CP 2013, volume 8124 of 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, and Justin Pearson. In Journal of Heuristics, volume 19, number 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, and Juan Manuel Martinez Caamaño. In ICCS 2013, volume 18 of 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, and Aravind Sukumaran-Rajam. In Euro-Par 2013 Parallel Processing, volume 8097 of Lecture Notes in Computer Science, pp 191-202, Springer Berlin/Heidelberg, 2013. (DOI, fulltext:postprint).
  30. Airspace sectorisation using constraint-based local search. Peter Jägare, Pierre Flener, and Justin Pearson. In 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, and Joseph Scott. In International Journal of Planning and Scheduling, volume 1, number 4, pp 264-284, 2013. (DOI).
  32. On the scalability of the Erlang term storage. David Klaftenegger, Konstantinos Sagonas, and Kjell Winblad. In Proc. 12th ACM SIGPLAN Workshop on Erlang, pp 15-26, ACM Press, New York, 2013. (DOI).
  33. Network-Wide Sensornet Checkpointing Made Practical. Andreas Löscher, Nicolas Tsiftes, Thiemo Voigt, and Vlado Handziski. In 10th European Conference on Wireless Sensor Networks, 2013.
  34. Factors Enabling Information Propagation in a Social Network Site. Matteo Magnani, Danilo Montesi, and Luca Rossi. In The Influence of Technology on Social Network Analysis and Mining, pp 411-426, Springer Vienna, 2013. (DOI, External link).
  35. Formation of multiple networks. Matteo Magnani and Luca Rossi. In Social Computing, Behavioral-Cultural Modeling and Prediction, pp 257-264, Springer Berlin Heidelberg, 2013. (DOI, External link).
  36. From stars to galaxies: skyline queries on aggregate data. Matteo Magnani and Ira Assent. In Proceedings of the 16th International Conference on Extending Database Technology, pp 477-488, 2013. (DOI, External link).
  37. On multidimensional network measures. Matteo Magnani, Anna Monreale, Giulio Rossetti, and Fosca Giannotti. In Italian Conference on Sistemi Evoluti per le Basi di Dati (SEBD), 2013.
  38. Pareto Distance for Multi-layer Network Analysis. Matteo Magnani and Luca Rossi. In Social Computing, Behavioral-Cultural Modeling and Prediction, volume 7812 of Lecture Notes in Computer Science, pp 249-256, 2013. (DOI, External link).
  39. SkyView: a user evaluation of the skyline operator. Matteo Magnani, Ira Assent, Kasper Hornbæ k, Mikkel R. Jakobsen, and Ken Friis Larsen. In Proceedings of the ACM Conference on Information and Knowledge Management (CIKM), pp 2249-2254, 2013. (DOI, External link).
  40. A parametric propagator for discretely convex pairs of sum constraints. Jean-Noël Monette, Nicolas Beldiceanu, Pierre Flener, and Justin Pearson. In Principles and Practice of Constraint Programming: CP 2013, volume 8124 of 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, and Justin Pearson. In 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, and José Proenca. In 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 and Ioana Rodhe. In Wireless networks, volume 19, number 1, pp 115-130, 2013. (DOI).
  44. Novice students' perception of learning in small groups. Aletta Nylén and Karl Marklund. In 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 and Arnold Pears. In 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 and Christina Dörge. In HDI 2012 – Informatik für eine nachhaltige Zukunft, volume 5 of Commentarii informaticae didacticae (CID), pp 33-44, Universitätsverlag Potsdam, Potsdam, 2013. (External link).
  47. Secure compilation of Object-Oriented components to protected module architectures. Marco Patrignani, Dave Clarke, and Frank Piessens. In Programming Languages and Systems, volume 8301 of 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, and John Andrews. In Procedia CIRP, volume 11, pp 420-424, 2013. (DOI).
  49. Precise explanation of success typing errors. Konstantinos Sagonas, Josep Silva, and Salvador Tamarit. In Proc. ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, pp 33-42, ACM Press, New York, 2013. (DOI).
  50. Can users control their data in social software?: An ethical analysis of control systems. Rula Sayaf, James B. Rule, and Dave Clarke. In Proc. Security and Privacy Workshops 2013, IEEE Computer Society, 2013. (DOI).
  51. Bounded strings for constraint programming. Joseph D. Scott, Pierre Flener, and Justin Pearson. In 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. Ph.D. thesis, 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 and Tore Risch. In 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 and Shareeful Islam. In International Journal of Engineering Pedagogy, volume 3, number 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 and Shareeful Islam. In Proc. 4th Global Engineering Education Conference, pp 44-49, IEEE, Piscataway, NJ, 2013. (DOI).
  56. Structured Aliasing. Tobias Wrigstad. In Aliasing in Object-Oriented Programming: Types, Analysis, and Verification, volume 7850 of Lecture Notes in Computer Science, pp 512-513, Springer Berlin/Heidelberg, 2013. (DOI).
  57. Model-based validation of streaming data. Cheng Xu, Daniel Wedlund, Martin Helgoson, and Tore Risch. In 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. Licentiate thesis, 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, and Ioana Rodhe. Technical report / Department of Information Technology, Uppsala University nr 2013-014, 2013. (External link).

2012

  1. Constraint programming for air traffic management: a survey. Cyril Allignol, Nicolas Barnier, Pierre Flener, and Justin Pearson. In Knowledge engineering review (Print), volume 27, number 3, pp 361-392, 2012. (DOI).
  2. Scientific SPARQL: Semantic web queries over scientific data. Andrej Andrejev and Tore Risch. In 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, and Ioannis E. Venetis. In 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. In 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. In Business Informatics, volume 3, number 25, 2012.
  7. Scalable ordered indexing of streaming data. Sobhan Badiozamany and Tore Risch. In 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, and Björn Victor. In Proc. 3:e Utvecklingskonferensen för Sveriges ingenjörsutbildningar, volume 75 of Linköping Electronic Conference Proceedings, pp 123-128, Linköping University Electronic Press, 2012. (External link).
  9. The impact of trace and adversary models on location privacy provided by K-anonymity. Volkan Cambazoglu, Christian Rohner, and Björn Victor. In Proc. 1st Workshop on Measurement, Privacy, and Mobility, ACM Press, New York, 2012. (DOI).
  10. Privacy preserving data publishing for recommender system. Xiaoqiang Chen and Vincent Huang. In 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, and Marc Bourgois. In Knowledge engineering review (Print), volume 27, number 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, and Justin Pearson. In 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 and 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, and Justin Pearson. In 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 and Anca-Juliana Stoica. In Risk Assessment and Management, pp 385-401, Publishing Services LLC, Cheyenne, WY, 2012. (External link).
  16. Computing Strong and Weak Bisimulations for Psi-Calculi. Magnus Johansson, Björn Victor, and Joachim Parrow. In Journal of Logic and Algebraic Programming, volume 81, number 3, pp 162-180, Elsevier, 2012. (DOI).
  17. Combinatorial problem solving over relational databases: View synthesis through constraint-based local search. Toni Mancini, Pierre Flener, and Justin K. Pearson. In 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, and Justin Pearson. In Principles and Practice of Constraint Programming: CP 2012, volume 7514 of 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. In 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 and Konstantinos Sagonas. In 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 and Tjark Weber (eds). Volume 878 of CEUR Workshop Proceedings, 2012. (Proceedings).
  22. Extending psi-calculi and their formal proofs. Palle Raabjerg. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2012-008, Uppsala University, 2012. (fulltext).
  23. Adaptive Parallelization of Queries to Data Providing Web Service Operations. Manivasakan Sabesan and Tore Risch. In Transactions on Large-Scale Data- and Knowledge-Centered Systems V, volume 7100 of Lecture Notes in Computer Science, pp 49-69, Springer, 2012. (DOI).
  24. ErLLVM: An LLVM backend for Erlang. Konstantinos Sagonas, Chris Stavrakakis, and Yiannis Tsiouris. In Proc. 11th ACM SIGPLAN Workshop on Erlang, pp 21-32, ACM Press, New York, 2012. (DOI).
  25. Logics and Algorithms for Verification of Concurrent Systems. Rafa? Somla. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 964, Acta Universitatis Upsaliensis, Uppsala, 2012. (fulltext).
  26. Concurrent view modeling for software risk management at early development stage. Anca-Juliana Stoica and Shareeful Islam. In 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 and Shareeful Islam. In 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, and Justin Pearson. In Journal of Aerospace Operations, volume 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, and Tjark Weber. In Proc. 7th Conference on Systems Software Verification: SSV 2012, volume 102 of Electronic Proceedings in Theoretical Computer Science, pp 73-87, 2012. (DOI).
  30. Structured Aliasing. Tobias Wrigstad. In ECOOP 2012 – Object-Oriented Programming, volume 7313 of Lecture Notes in Computer Science, pp 232-232, Springer Berlin/Heidelberg, 2012. (DOI).
  31. Multiple Aggregate Entry Points for Ownership Types. Johan Östlund and Tobias Wrigstad. In ECOOP 2012 – Object-Oriented Programming, volume 7313 of Lecture Notes in Computer Science, pp 156-180, Springer Berlin/Heidelberg, 2012. (DOI).
  32. The Joelle Programming Language: Evolving Java Programs Along Two Axes of Parallel Eval. Johan Östlund, Stephan Brandauer, and Tobias Wrigstad. 2012 International Workshop on Languages for the Multi-core Era, 2012.

2011

  1. Maintaining Database Integrity with Refinement Types. Ioannis G. Baltopoulos, Johannes Borgström, and Andrew D. Gordon. In ECOOP 2011 – Object-Oriented Programming, volume 6813 of Lecture Notes in Computer Science, pp 484-509, Springer-Verlag, Berlin, 2011. (DOI).
  2. Psi-calculi: a framework for mobile processes with nominal data and logic. Jesper Bengtson, Magnus Johansson, Joachim Parrow, and Björn Victor. In Logical Methods in Computer Science, volume 7, number 1, p 11, 2011. (DOI).
  3. Refinement types for secure implementations. Jesper Bengtson, Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon, and Sergio Maffeis. In ACM Transactions on Programming Languages and Systems, volume 33, number 2, pp 8:1-45, 2011. (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, and Joachim Parrow. In Software Engineering and Formal Methods: SEFM 2011, volume 7041 of Lecture Notes in Computer Science, pp 74-89, Springer Berlin/Heidelberg, 2011. (DOI, fulltext:postprint).
  5. Verified Stateful Programs with Substructural State and Hoare Types. Johannes Borgström, Juan Chen, and Nikhil Swamy. In Proc. 5th ACM Workshop on Programming Languages Meets Program Verification, pp 15-26, ACM Press, New York, 2011. (DOI).
  6. Detection of asynchronous message passing errors using static analysis. Maria Christakis and Konstantinos Sagonas. In Practical Aspects of Declarative Languages, volume 6539 of Lecture Notes in Computer Science, pp 5-18, Springer Berlin/Heidelberg, 2011. (DOI).
  7. Consistency of constraint networks induced by automaton-based constraint specifications. María Andreína Francisco Rodríguez, Pierre Flener, and Justin Pearson. In 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, and Konstantinos Sagonas. In 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, and Justin Pearson. In 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, and Justin Pearson. In Fundamenta Informaticae, volume 107, pp 223-248, 2011. (DOI).
  11. A quadratic edge-finding filtering algorithm for cumulative resource constraints. Roger Kameugne, Laure Pauline Fotso, Joseph Scott, and Youcheu Ngo-Kateu. In Principles and Practice of Constraint Programming – CP 2011, volume 6876 of 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 and David Åhman. Student thesis, supervisor: Mats Axelsson, examiner: 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 and Tore Risch. In New Frontiers in Information and Software as Services: Service and Application Design Challenges in the Cloud, volume 74 of 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 and Tore Risch. In , pp 43-58, Bonn, Germany, 2011. (External link).
  15. Demonstrating early value in software system projects using software and system cost models. Anca-Juliana Stoica. In 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, and Peter Stoica. In The Open Software Engineering Journal, volume 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, and Björn Victor. In 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, and Tore Risch. In 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 and 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 and 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 and Tore Risch. In 36th International Conference on Very Large Data Bases: VLDB 2010, 2011.
  22. Scalable Parallelization of Expensive Continuous Queries over Massive Data Streams. Erik Zeitler. Ph.D. thesis, 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 and 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, and Justin Pearson. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 6140 of Lecture Notes in Computer Science, pp 10-24, Springer-Verlag, Berlin, 2010. (DOI).
  2. Tribal ownership. Nicholas Cameron, James Noble, and Tobias Wrigstad. In Proc. 1st International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, volume 45:10 of ACM SIGPLAN Notices, pp 618-633, ACM Press, New York, 2010. (DOI).
  3. Static detection of race conditions in Erlang. Maria Christakis and Konstantinos Sagonas. In Practical Aspects of Declarative Languages: PADL 2010, volume 5937 of Lecture Notes in Computer Science, pp 119-133, Springer-Verlag, Berlin, 2010. (DOI).
  4. Inductive programming. Pierre Flener and Ute Schmid. In 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 and Justin Pearson (eds). Department of Information Technology, Uppsala University, Uppsala, Sweden, 2010. (Proceedings).
  6. Programming by demonstration. Pierre Flener and Ute Schmid. In Encyclopedia of Machine Learning, pp 805-805, Springer, New York, 2010. (DOI).
  7. Trace-based programming. Pierre Flener and Ute Schmid. In 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, and Konstantinos Sagonas. In Proc. 2nd Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software: PLACES 2009, volume 17 of Electronic Proceedings in Theoretical Computer Science, pp 79-93, 2010. (DOI).
  9. Race-free and memory-safe multithreading: Design and implementation in Cyclone. Prodromos Gerakios, Nikolaos Papaspyrou, and Konstantinos Sagonas. In Proc. 5th International Workshop on Types in Language Design and Implementation, pp 15-26, ACM Press, New York, 2010. (DOI).
  10. Energy-efficient task-mapping for data-driven sensor network macroprogramming using constraint programming. Farshid Hassani Bijarbooneh, Pierre Flener, Edith Ngai, and Justin Pearson. In 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, and Joachim Parrow. In Proc. 6th Workshop on Structural Operational Semantics: SOS 2009, volume 18 of Electronic Proceedings in Theoretical Computer Science, pp 17-31, 2010. (DOI).
  12. Weak Equivalences in Psi-calculi. Magnus Johansson, Jesper Bengtson, Joachim Parrow, and Björn Victor. In Proc. 25th Symposium on Logic in Computer Science: LICS 2010, pp 322-331, IEEE, Piscataway, NJ, 2010. (DOI).
  13. Local search over relational databases. Toni Mancini, Pierre Flener, and Justin Pearson. In 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, and Feng Luan. In International Journal of Web and Grid Services (IJWGS), volume 6, number 4, pp 400-423, 2010. (DOI).
  15. Querying Data Providing Web Services. Manivasakan Sabesan. Ph.D. thesis, 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. In Functional and Logic Programming: FLOPS 2010, volume 6009 of Lecture Notes in Computer Science, pp 13-18, Springer-Verlag, Berlin, 2010. (DOI).
  17. SPARQL queries to RDFS views of Topic Maps. Silvia Stefanova and Tore Risch. In International Journal of Metadata, Semantics and Ontologies (IJMSO), volume 5, number 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 and Margus Nael. In 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, and Justin Pearson. In 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, and Justin Pearson. In Principles and Practice of Constraint Programming – CP 2010, volume 6308 of Lecture Notes in Computer Science, pp 643-657, Springer-Verlag, Berlin, 2010. (DOI).
  21. Scalable Splitting of Massive Data Streams. Erik Zeitler and Tore Risch. In Database Systems for Advanced Applications: Part II, volume 5982 of Lecture Notes in Computer Science, pp 184-198, Springer-Verlag, Berlin, 2010. (DOI, fulltext).
  22. Welterweight Java. Johan Östlund and Tobias Wrigstad. In Objects, Models, Components, Patterns, volume 6141 of Lecture Notes in Computer Science, pp 97-116, Springer-Verlag, Berlin, 2010. (DOI).

Updated  2015-06-09 12:38:41 by Anneli Folkesson.