Some publications by Concurrency theory people

Hammering Floating-Point Arithmetic. Olle Torstensson and Tjark Weber. In FRONTIERS OF COMBINING SYSTEMS, FROCOS 2023, volume 14279 of Lecture Notes in Artificial Intelligence, pp 217-235, Springer Nature, 2023. (DOI, Fulltext, fulltext:print).
Supporting Shared Responsibility for Integrating Ethics into Science and Technology Education. Mikael Laaksoharju, Thomas Taro Lennerfors, Björn Victor, and Maja Elmgren. In 2022 IEEE Frontiers in Education Conference (FIE), IEEE Frontiers in Education Conference, Institute of Electrical and Electronics Engineers (IEEE), 2022. (DOI, fulltext:postprint).
Conservative Definitions for Higher-order Logic with Ad-hoc Overloading. Arve Gengelbach. Ph.D. thesis, 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).
Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages. Daniel Lunden, Johannes Borgström, and David Broman. In Programming Languages And Systems, ESOP 2021, Lecture Notes in Computer Science, pp 404-431, Springer Nature, 2021. (DOI, Fulltext, fulltext:print).
Mechanisation of Model-theoretic Conservative Extension for HOL with Ad-hoc Overloading. Arve Gengelbach, Johannes Åman Pohjola, and Tjark Weber. In Proceedings Fifteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, volume 332 of Electronic Proceedings in Theoretical Computer Science (EPTCS), pp 1-17, Open Publishing Association, 2021. (DOI, Fulltext, fulltext:print).
Modal Logics for Nominal Transition Systems. Joachim Parrow, Johannes Borgström, Lars-Henrik Eriksson, Ramunas Forsberg Gutkovas, and Tjark Weber. In Logical Methods in Computer Science, volume 17, number 1, 2021. (DOI, Fulltext, External link, External link, fulltext:preprint, fulltext:print).
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, and David Broman. In Communications Biology, volume 4, Springer Nature, 2021. (DOI, Fulltext, fulltext:print).
A Mechanised Semantics for HOL with Ad-hoc Overloading. Johannes Åman Pohjola and Arve Gengelbach. In , EPiC Series in Computing, pp 498-515, 2020. (DOI, Fulltext, External link).
Proof-theoretic Conservativity for HOL with Ad-hoc Overloading. Arve Gengelbach and Tjark Weber. In 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, External link).
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, and Akihisa Yamada. In Tools and Algorithms for the Construction and Analysis of Systems: 25 years of TACAS, Part III, volume 11429 of Lecture Notes in Computer Science, pp 3-24, Springer, 2019. (DOI, Fulltext, fulltext:print).
Model-theoretic Conservative Extension of Definitional Theories. Arve Gengelbach and Tjark Weber. In Electronic Notes in Theoretical Computer Science, volume 338, pp 133-145, 2018. (DOI, Fulltext, fulltext:print).
Deriving Probability Density Functions from Probabilistic Functional Programs. Sooraj Bhat, Johannes Borgström, Andrew D. Gordon, and Claudio Russo. In Logical Methods in Computer Science, volume 13, number 2, 2017. (DOI, Fulltext).
Weak Nominal Modal Logic. Joachim Parrow, Tjark Weber, Johannes Borgström, and Lars-Henrik Eriksson. In Formal Techniques for Distributed Objects, Components, and Systems, volume 10321 of Lecture Notes in Computer Science, pp 179-193, Springer, 2017. (DOI).
A Lambda-Calculus Foundation for Universal Probabilistic Programming. Johannes Borgström, Ugo Dal Lago, Andrew D. Gordon, and Marcin Szymczak. In SIGPLAN notices, volume 51, number 9, pp 33-46, 2016. (DOI, fulltext:postprint).
A Sorted Semantic Framework for Applied Process Calculi. Johannes Borgström, Ramunas Gutkovas, Joachim Parrow, Björn Victor, and Johannes Åman Pohjola. In Logical Methods in Computer Science, volume 12, number 1, pp 1-49, 2016. (DOI, Fulltext, fulltext:postprint).
Bisimulation up-to techniques for psi-calculi. Johannes Åman Pohjola and Joachim Parrow. In Proc. 5th ACM SIGPLAN Conference on Certified Programs and Proofs, pp 142-153, ACM Press, New York, 2016. (DOI).
Culling Concurrency Theory: Reusable and trustworthy meta-theory, proof techniques and separation results. Johannes Åman Pohjola. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1397, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext, preview image).
Extended versions of papers presented at WS-FM 2014 and Beat 2014. Marco Carbone, Thomas Hildebrandt, Joachim Parrow, and Matthias Weidlich. In Formal Aspects of Computing, volume 28, number 4, pp 529-530, 2016. (DOI).
Fabular: Regression formulas as probabilistic programming. Johannes Borgström, Andrew D. Gordon, Long Ouyang, Claudio Russo, Adam Scibior, and Marcin Szymczak. In Proc. 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, volume 51(1) of ACM SIGPLAN Notices, pp 271-283, ACM Press, New York, 2016. (DOI, fulltext:postprint).
General conditions for full abstraction. Joachim Parrow. In Mathematical Structures in Computer Science, volume 26, number 4, pp 655-657, 2016. (DOI).
Kleene Algebras with Domain. Victor B. F. Gomes, Walter Guttmann, Peter Höfner, Georg Struth, and Tjark Weber. In Archive of Formal Proofs, 2016. (External link).
Languages, Logics, Types and Tools for Concurrent System Modelling. Ram?nas Gutkovas. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 1392, Acta Universitatis Upsaliensis, Uppsala, 2016. (fulltext).
Modal Logics for Nominal Transition Systems. Tjark Weber, Lars-Henrik Eriksson, Joachim Parrow, Johannes Borgström, and Ram?nas Gutkovas. In Archive of Formal Proofs, 2016. (External link).
Proceedings från 5:e utvecklingskonferensen för Sveriges ingenjörsutbildningar. Stefan Pålsson and Björn Victor (eds). Volume 2016-002 of Technical report / Department of Information Technology, Uppsala University, 2016. (External link).
Psi-Calculi in Isabelle. Jesper Bengtson, Joachim Parrow, and Tjark Weber. In Journal of automated reasoning, volume 56, number 1, pp 1-47, 2016. (DOI).
Scrambling and descrambling SMT-LIB benchmarks. Tjark Weber. In Satisfiability Modulo Theories: SMT 2016, volume 1617 of CEUR Workshop Proceedings, pp 31-40, RWTH Aachen University, 2016. (Fulltext).
The 2014 SMT Competition. Tjark Weber, David R. Cok, and David Deharbe. In Journal on Satisfiability, Boolean Modeling and Computation, 2016.
The Expressive Power of Monotonic Parallel Composition. Johannes Åman Pohjola and Joachim Parrow. In Programming Languages and Systems, volume 9632 of Lecture Notes in Computer Science, pp 780-803, Springer, Berlin, 2016. (DOI).
The largest respectful function. Joachim Parrow and Tjark Weber. In Logical Methods in Computer Science, volume 12, number 2, 2016. (DOI, Fulltext, fulltext:print).
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).
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).
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).
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. (fulltext).
Motivation and Grade Gap Related to Gender in a Programming Course. Virginia Grande and Joachim Parrow. In , 2015. (DOI).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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).
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.
Kleene Algebra. Alasdair Armstrong, Georg Struth, and Tjark Weber. In Archive of Formal Proofs, 2013. (External link).
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).
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. (fulltext).
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).
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).
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).
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).
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).
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).
Proof Exchange for Theorem Proving: PxTP 2012. David Pichardie and Tjark Weber (eds). Volume 878 of CEUR Workshop Proceedings, 2012. (Proceedings).
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).
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).
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).
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).
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).
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).
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).
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).
Formalising process calculi. Jesper Bengtson. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 93, Acta Universitatis Upsaliensis, Uppsala, 2010.
Psi-calculi: a framework for mobile process calculi: Cook your own correct process calculus - just add data and logic. Magnus Johansson. Ph.D. thesis, Uppsala Dissertations from the Faculty of Science and Technology nr 94, Acta Universitatis Upsaliensis, Uppsala, 2010. (fulltext).
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).
Formalising the ?-calculus using nominal logic. Jesper Bengtson and Joachim Parrow. In Logical Methods in Computer Science, volume 5, number 2, pp 16:1-36, 2009. (DOI, fulltext).
Psi-calculi: Mobile processes, nominal data, and logic. Jesper Bengtson, Magnus Johansson, Joachim Parrow, and Björn Victor. In Proc. 24th Annual IEEE Symposium on Logic in Computer Science, pp 39-48, IEEE, Piscataway, NJ, 2009. (DOI).
Psi-calculi in Isabelle. Jesper Bengtson and Joachim Parrow. In Theorem Proving in Higher Order Logics, volume 5674 of Lecture Notes in Computer Science, pp 99-114, Springer-Verlag, Berlin, 2009. (DOI).
A Testbed for Evaluating Delay Tolerant Network Protocol Implementations. Fredrik Bjurefors and Oskar Wibling. In Proceedings 5th Swedish National Computer Networking Workshop, 2008.
Creating Correct Network Protocols. Oskar Wibling. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 571, Acta Universitatis Upsaliensis, Uppsala, 2008. (fulltext, errata).
Expressiveness of Process Algebras. Joachim Parrow. In Electronic Notes in Theoretical Computer Science, volume 209, pp 173-186, 2008. (DOI).
Extended pi-Calculi. Magnus Johansson, Joachim Parrow, Björn Victor, and Jesper Bengtson. In Automata, Languages and Programming, PT 2: Proceedings of ICALP 2008, volume 5126 of Lecture Notes in Computer Science, pp 87-98, 2008. (DOI).
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. Mayank Saksena, Oskar Wibling, and Bengt Jonsson. In Tools and Algorithms for the Construction and Analysis of Systems, volume 4963 of Lecture Notes in Computer Science, pp 18-32, Springer-Verlag, Berlin, 2008. (DOI).
Re?nement Types for Secure Implementations. Jesper Bengtson, Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon, and Sergio Maffeis. In Proc. 21st IEEE Computer Security Foundations Symposium, pp 17-32, IEEE, Piscataway, NJ, 2008. (DOI, fulltext).
A Cross-Environment Study of Routing Protocols for Wireless Multi-hop Networks. Erik Nordström, Per Gunningberg, Christian Rohner, and Oskar Wibling. IT Technical Reports nr 2007-016, 2007. (External link).
A completeness proof for bisimulation in the pi-calculus using Isabelle. Jesper Bengtson and Joachim Parrow. In Electronic Notes in Theoretical Computer Science, volume 192, number 1, pp 61-75, 2007. (DOI, External link).
Evaluating Wireless Multi-hop Networks Using a Combination of Simulation, Emulation, and Real World Experiments. Erik Nordström, Per Gunningberg, Christian Rohner, and Oskar Wibling. In Proceedings of the 1st international workshop on System evaluation for mobile platforms (MobiEval'07), pp 29-34, ACM Association for Computing Machinery, New York, 2007. (DOI).
Formalising the pi-calculus using nominal logic. Jesper Bengtson and Joachim Parrow. In FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, volume 4423 of LECTURE NOTES IN COMPUTER SCIENCE, pp 63-77, 2007. (External link).
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols: (Extended Version). Mayank Saksena, Oskar Wibling, and Bengt Jonsson. IT Technical Reports nr 2007-035, 2007. (External link).
Testbed and Methodology for Experimental Evaluation of Opportunistic Networks. Fredrik Bjurefors, Kaustubh Phanse, Oskar Wibling, and Christian Rohner. In 7th Scandinavian Workshop on Wireless Ad-hoc Networks (ADHOC'07), 2007.
The GTO Toolset and Method. Lars-Henrik Eriksson. In Electronic Notes in Theoretical Computer Science, volume 185, pp 77-91, 2007. (DOI).
Timed calculus of cryptographic communication. Johannes Borgström, Olga Grinchtein, and Simon Kramer. In Formal Aspects in Security and Trust, volume 4691 of Lecture Notes in Computer Science, pp 16-30, Springer-Verlag, Berlin, 2007. (DOI).
Comparing Simulation, Emulation, and Real-World Experimental Results in Mobile Ad hoc Networks. Erik Nordström, Per Gunningberg, Christian Rohner, and Oskar Wibling. In 6th Scandinavian Workshop on Wireless Ad-hoc Networks (ADHOC'06), 2006.
On the Expressiveness of Linearity vs Persistence in the Asynchronous Pi-Calculus. Catuscia Palamidessi, Vijay Saraswat, Frank D. Valencia, and Björn Victor. In Proc. 21st Symposium on Logic In Computer Science: LICS 2006, pp 59-68, IEEE, Piscataway, NJ, 2006. (DOI).
Relations in Models of Calculi and Logics with Names. Kidane Yemane. Ph.D. thesis, Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology nr 132, Acta Universitatis Upsaliensis, Uppsala, 2006. (fulltext, cover).
Use of Domain Theories in Applied Formal Methods. Lars-Henrik Eriksson. Technical report / Department of Information Technology, Uppsala University nr 2006-029, 2006. (fulltext).
A Fully Abstract Encoding of the pi-Calculus with Data Terms. Michael Baldamus, Joachim Parrow, and Björn Victor. In Proceedings of ICALP 2005, volume 3580 of Lecture notes in computer science, pp 1202-1213, Springer, Berlin, 2005. (DOI, External link).
Ad Hoc Routing Protocol Verification Through Broadcast Abstraction. Oskar Wibling, Joachim Parrow, and Arnold Pears. In Formal Techniques for Networked and Distributed Systems – FORTE 2005, volume 3731 of Lecture Notes in Computer Science, pp 128-142, Springer-Verlag, Berlin, 2005. (DOI).
Ad hoc routing protocol validation. Oskar Wibling. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2005-004, Uppsala University, 2005. (fulltext).
Modelling Fusion Calculus using HD-Automata. Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto, Björn Victor, and Kidane Yemane. Technical report / Department of Information Technology, Uppsala University nr 2005-038, 2005.
Modelling and Minimising the Fusion Calculus using HD-automata. Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto, Björn Victor, and Kidane Yemane. In Proceedings of CALCO 2005, 2005. (DOI, External link).
Verification and generation of geographical data using domain theory. Lars-Henrik Eriksson. In TRain Workshop at the 3rd IEEE International Conference on Software Engineering and Formal Methods (SEFM’05), 2005, 2005. (fulltext:postprint).
A unifying model of variables and names. Marino Miculan and Kidane Yemane. Research Report UDMI nr 15/2004/RR, Department of Mathematics and Computer Science, University of Udine, 2004.
Automatized Verification of Ad Hoc Routing Protocols. Oskar Wibling, Joachim Parrow, and Arnold Pears. In Formal Techniques for Networked and Distributed Systems – FORTE 2004, volume 3235 of Lecture Notes in Computer Science, pp 343-358, Springer-Verlag, Berlin, 2004. (DOI).
LUNAR - A Lightweight Underlay Network Ad-hoc Routing Protocol and Implementation. Christian Tschudin, Richard Gold, Olof Rensfelt, and Oskar Wibling. In Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN'04), p 300, 2004.
Non-viability Deductions in Arc-Consistency Computation. Camilo Rueda and Frank Valencia. In Logic Programming: 20th International Conference, ICLP 2004, pp 343-355, 2004.
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi. Pablo Giambiagi, Gerardo Schneider, and Frank Valencia. In Proceedings of the 7nd International Conference on Foundations of Software Science and Computation Structures (FOSSACS'04), pp 226-240, 2004.
On validity in modelization of musical problems by CCP. Camilo Rueda and Frank Valencia. In Soft Computing: A Fusion of Foundations, Methodologies and Applications, volume 8, number 9, pp 641-648, 2004.
Relationally Staged Computations in Calculi of Mobile Processes. Neil Ghani, Kidane Yemane, and Björn Victor. In Proc. 7th Workshop on Coalgebraic Methods in Computer Science, volume 106 of Electronic Notes in Theoretical Computer Science, pp 105-120, Elsevier, 2004. (DOI).
Relationally Staged Computations in Calculi of Mobile Processes. Neil Ghani, Kidane Yemane, and Björn Victor. Technical report / Department of Information Technology, Uppsala University nr 2004-010, Department of Information Technology, Uppsala University, 2004. (fulltext).
Special issue on the pi-calculus. Uwe Nestmann and Björn Victor (eds). Volume 63(1) of Journal of Logic and Algebraic Programming, Elsevier, 2004. (DOI, External link).
Spezifikation von Stellwerkslogik mit formalen Methoden. Carsten Trog and Lars-Henrik Eriksson. In Signal + Draht, number 1+2, 2004.
Spi Calculus Translated to pi-Calculus Preserving May-Tests. Michael Baldamus, Joachim Parrow, and Björn Victor. In Proceedings of LICS 2004: Logic in Computer Science, Proceedings / Symposium on Logic in Computer Science, pp 22-31, IEEE Computer Society, Los Alamitos, Calif, 2004. (DOI, External link).
Using Formal Methods in a Retrospective Safety Case. Lars-Henrik Eriksson. In Computer Safety, Reliability, and Security: 23rd International Conference, SAFECOMP 2004, Potsdam, Germany, September 21-24,2004, Proceedings, volume 3219 of Springer Lecture Notes in Computer Science, pp 31-44, Springer Berlin/Heidelberg, 2004. (Conference proceedings, fulltext:postprint).
Web Services as a New Approach to Distributing and Coordinating Semantics-Based Verification Toolkits. Michael Baldamus, Jesper Bengtson, GianLuigi Ferrari, and Roberto Raggi. In Electronic Notes in Theoretical Computer Science, volume 105, pp 11-20, 2004.
Concurrency, Time, and Constraints. Frank Valencia. In Logic Programming, 19th International Conference, pp 72-101, 2003.
Polyadic History-Dependent Automata for the Fusion Calculus. Emilio Tuosto, Björn Victor, and Kidane Yemane. Technical report / Department of Information Technology, Uppsala University nr 2003-062, 2003. (fulltext).
Solos in Concert. Cosimo Laneve and Björn Victor. In Mathematical Structures in Computer Science, volume 13, number 5, pp 657-683, 2003. (DOI).
Spi Calculus Translated to pi-Calculus Preserving May-Testing. Michael Baldamus, Joachim Parrow, and Björn Victor. Technical report / Department of Information Technology, Uppsala University nr 2003-063, 2003. (fulltext).
The difference between concurrent and sequential computation. Luca Aceto, Giuseppe Longo, and Björn Victor (eds). Volume 13(4-5) of Mathematical Structures in Computer Science, Cambridge University Press, 2003. (DOI).
FME 2002: Formal Methods - Getting IT Right : International Symposium of Formal Methods Europe, Copenhagen, Denmark, July 22-24, 2002. Proceedings. Lars-Henrik Eriksson and Peter Alexander Lindsay (eds). Volume 2391 of Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, 2002.
An introduction to the pi-calculus. Joachim Parrow. In Handbook of Pocess Algebra, pp 479-543, Elsevier, 2001.
Solo diagrams. Cosimo Laneve, Joachim Parrow, and Björn Victor. In Proceedings of TACS 2001, pp 127-144, 2001. (External link).
EXPRESS'00: 7th International Workshop on Expressiveness in Concurrency. Luca Aceto and Björn Victor (eds). Volume 39 of Electronic Notes in Theoretical Computer Science, Elsevier, 2000. (DOI, External link).
Trios in Concert. Joachim Parrow. In Proof, Language and Interaction, Essays in Honor of Robin Milner, pp 621-637, MIT Press, 2000.
EXPRESS'99: 6th International Workshop on Expressiveness in Concurrency. Ilaria Castellani and Björn Victor (eds). Volume 27 of Electronic Notes in Theoretical Computer Science, Elsevier Science BV, Amsterdam, 1999. (External link).
Proceedings of the 11th Nordic Workshop on Programming Theory. Björn Victor and Wang Yi (eds). IT Technical Reports, Dept. of Information Technology, Uppsala university, 1999. (External link).
Solos in Concert. Cosimo Laneve and Björn Victor. In Proceedings of ICALP'99, 1999. (External link).
Calculi for Mobile Processes: Bibliography and Web Pages. Uwe Nestmann and Björn Victor. In Bulletin of the EATCS, volume 64, 1998.
Concurrent Constraints in the Fusion Calculus. Björn Victor and Joachim Parrow. In Proceedings of ICALP'98, volume 1443 of Lectute notes in computer science, pp 455-469, Springer, Berlin, 1998. (DOI).
Programmeraren som Schaman. Joachim Parrow. In Forskning och Framsteg, number 2, pp 14-19, 1998.
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. Björn Victor. Ph.D. thesis, DoCS nr 98, Department of Computer Systems, Uppsala University, 1998.
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. Joachim Parrow and Björn Victor. In Proceedings of LICS'98, Proceedings / Symposium on Logic in Computer Science, pp 176-185, IEEE Computer Society, Los Alamitos, CA, 1998. (DOI).
The Tau-Laws of Fusion. Joachim Parrow and Björn Victor. In Proceedings of CONCUR'98, volume 1466 of Lecture notes in computer science, pp 99-114, Springer, Berlin, 1998. (DOI).
The Update Calculus. Joachim Parrow and Björn Victor. In Proceedings of AMAST'97, volume 1349 of Lecture notes in computer science, pp 409-423, Springer, Berlin, 1997. (DOI).
Constraints as Processes. Björn Victor and Joachim Parrow. In Proceedings of CONCUR'96, volume 1119 of Lecture notes in computer science, pp 389-405, Springer, Berlin, 1996. (DOI).
Designing a Multiway Synchronisation Protocol. Joachim Parrow and Peter Sjödin. In Computer Communications, volume 19, number 14, pp 1151-1160, 1996. (DOI).
Algebraic Theories of Name-Passing Calculi. Joachim Parrow and Davide Sangiorgi. In Information and Computation, volume 120, number 2, pp 174-197, 1995. (DOI).
Interaction Diagrams. Joachim Parrow. In Nordic Journal of Computing, volume 2, number 4, pp 407-443, 1995.
The Complete Axiomatization of Cs-Congruence. Joachim Parrow and Peter Sjödin. In Proceedings of STACS 94, volume 775 of Lecture notes in computer science, pp 557-568, Springer, Berlin, 1994. (DOI).
The Mobility Workbench: A Tool for the Pi-Calculus. Björn Victor and Faron Moller. In Proceedings of CAV'94, pp 428-440, 1994. (DOI).
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. Bengt Jonsson and Joachim Parrow. In Information and Computation, volume 107, number 2, pp 272-302, 1993. (DOI).
Modal Logics for Mobile Processes. Robin Milner, Joachim Parrow, and David Walker. In Theoretical Computer Science, volume 114, number 1, pp 149-171, 1993. (DOI).
Structural and Behavioural Equivalences of Networks. Joachim Parrow. In Information and Computation, volume 107, number 1, pp 58-90, 1993. (DOI).
The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems. Rance Cleaveland, Joachim Parrow, and Bernhard Steffen. In ACM Transactions on Programming Languages and Systems, volume 15, number 1, pp 36-72, 1993. (DOI).
A Calculus of Mobile Processes - Part I. Robin Milner, Joachim Parrow, and David Walker. In Information and Computation, volume 100, number 1, pp 1-40, 1992. (DOI).
A Calculus of Mobile Processes - Part II. Robin Milner, Joachim Parrow, and David Walker. In Information and Computation, volume 100, number 1, pp 41-77, 1992. (DOI).
A finitary version of the calculus of partial inductive definitions. Lars-Henrik Eriksson. In Extensions of Logic Programming, volume 596 of Lecture Notes in Computer Science, pp 89-134, Springer Berlin/Heidelberg, 1992.
An Algebraic Verification of a Mobile Network. Fredrik Orava and Joachim Parrow. In Formal Aspects of Computing, volume 4, number 6, pp 497-543, 1992. (DOI).
Multiway Synchronization Verified with Coupled Simulation. Joachim Parrow and Peter Sjödin. In Proceedings of CONCUR '92, volume 630 of Lecture notes in computer science, pp 518-533, Springer, Berlin, 1992. (DOI).
The Expressive Power of Parallelism. Joachim Parrow. In Future Generation Computer Systems, volume 6, number 3, pp 271-285, 1990. (DOI).
Submodule Construction as Equation Solving in CCS. Joachim Parrow. In Theoretical Computer Science, volume 68, number 2, pp 175-202, 1989. (DOI).
Incorporating mutable arrays into logic programming. Lars-Henrik Eriksson and Manny Rayner. In Proc. Second International Conference on Logic Programming, pp 76-82, Uppsala universitet, Uppsala, 1984.
Synthesis of a unification algorithm in a logic programming calculus. Lars-Henrik Eriksson. In The journal of logic programming, volume 1, number 1, pp 3-18, North-Holland, 1984.