Some publications by Concurrency theory people
-
Hammering Floating-Point Arithmetic
. 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
. 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
. 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
. 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
. 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
. 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
. In Communications Biology, volume 4, Springer Nature, 2021. (DOI
, Fulltext
, fulltext:print
).
-
A Mechanised Semantics for HOL with Ad-hoc Overloading
. In , EPiC Series in Computing, pp 498-515, 2020. (DOI
, Fulltext
, External link
).
-
Proof-theoretic Conservativity for HOL with Ad-hoc Overloading
. 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
. 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
. 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
. In Logical Methods in Computer Science, volume 13, number 2, 2017. (DOI
, Fulltext
).
-
Weak Nominal Modal Logic
. 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
. In SIGPLAN notices, volume 51, number 9, pp 33-46, 2016. (DOI
, fulltext:postprint
).
-
A Sorted Semantic Framework for Applied Process Calculi
. 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
. 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
. 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
. In Formal Aspects of Computing, volume 28, number 4, pp 529-530, 2016. (DOI
).
-
Fabular: Regression formulas as probabilistic programming
. 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
. In Mathematical Structures in Computer Science, volume 26, number 4, pp 655-657, 2016. (DOI
).
-
Kleene Algebras with Domain
. In Archive of Formal Proofs, 2016. (External link
).
-
Languages, Logics, Types and Tools for Concurrent System Modelling
. 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
. In Archive of Formal Proofs, 2016. (External link
).
-
Proceedings från 5:e utvecklingskonferensen för Sveriges ingenjörsutbildningar
. Volume 2016-002 of Technical report / Department of Information Technology, Uppsala University, 2016. (External link
).
-
Psi-Calculi in Isabelle
. In Journal of automated reasoning, volume 56, number 1, pp 1-47, 2016. (DOI
).
-
Scrambling and descrambling SMT-LIB benchmarks
. In Satisfiability Modulo Theories: SMT 2016, volume 1617 of CEUR Workshop Proceedings, pp 31-40, RWTH Aachen University, 2016. (Fulltext
).
-
The 2014 SMT Competition
. In Journal on Satisfiability, Boolean Modeling and Computation, 2016.
-
The Expressive Power of Monotonic Parallel Composition
. In Programming Languages and Systems, volume 9632 of Lecture Notes in Computer Science, pp 780-803, Springer, Berlin, 2016. (DOI
).
-
The largest respectful function
. In Logical Methods in Computer Science, volume 12, number 2, 2016. (DOI
, Fulltext
, fulltext:print
).
-
A structured approach to training open-ended problem solving
. 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
. In Software and Systems Modeling, volume 14, number 1, pp 201-216, Springer, 2015. (DOI
, fulltext:postprint
).
-
Modal Logics for Nominal Transition Systems
. 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
. Technical report / Department of Information Technology, Uppsala University nr 2015-033, 2015. (fulltext
).
-
Motivation and Grade Gap Related to Gender in a Programming Course
. In , 2015. (DOI
).
-
Probabilistic programs as spreadsheet queries
. 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
. 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
. 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)
. 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
. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2014-007, Uppsala University, 2014. (fulltext
).
-
Enhanced learning by promoting engineering competencies
. In Proc. 44th ASEE/IEEE Frontiers in Education Conference, pp 2044-2049, IEEE Press, Piscataway, NJ, 2014. (DOI
, Proceedings
).
-
Higher-order psi-calculi
. 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
. 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)
. Volume 160 of Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2014. (DOI
).
-
Programming and automating mathematics in the Tarski-Kleene hierarchy
. In Journal of Logical and Algebraic Methods in Programming, volume 83, number 2, pp 87-102, 2014. (DOI
).
-
Session types for broadcasting
. 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
. 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
. 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
. 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
. 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
. 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
. 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
. In 4:e Utvecklingskonferensen för Sveriges ingenjörsutbildningar, pp 51-54, 2013.
-
Kleene Algebra
. In Archive of Formal Proofs, 2013. (External link
).
-
Measure transformer semantics for Bayesian machine learning
. In Logical Methods in Computer Science, volume 9, number 3, p 11, 2013. (DOI
, arXiv page
).
-
Negative premises in applied process calculi
. 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
. 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
. 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
. In Journal of Logic and Algebraic Programming, volume 81, number 3, pp 162-180, Elsevier, 2012. (DOI
).
-
Extending psi-calculi and their formal proofs
. 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
. 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
. 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
. Volume 878 of CEUR Workshop Proceedings, 2012. (Proceedings
).
-
The impact of trace and adversary models on location privacy provided by K-anonymity
. In Proc. 1st Workshop on Measurement, Privacy, and Mobility, ACM Press, New York, 2012. (DOI
).
-
Broadcast Psi-calculi with an Application to Wireless Protocols
. 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
. In 2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), pp 659-664, IEEE Computer Society, 2011. (DOI
).
-
Maintaining Database Integrity with Refinement Types
. 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
. In Logical Methods in Computer Science, volume 7, number 1, p 11, 2011. (DOI
).
-
Refinement types for secure implementations
. 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
. 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
. 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
. 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
. 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
. 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
. 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
. In Proc. 24th Annual IEEE Symposium on Logic in Computer Science, pp 39-48, IEEE, Piscataway, NJ, 2009. (DOI
).
-
Psi-calculi in Isabelle
. 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
. In Proceedings 5th Swedish National Computer Networking Workshop, 2008.
-
Creating Correct Network Protocols
. 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
. In Electronic Notes in Theoretical Computer Science, volume 209, pp 173-186, 2008. (DOI
).
-
Extended pi-Calculi
. 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
. 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
. 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
. IT Technical Reports nr 2007-016, 2007. (External link
).
-
A completeness proof for bisimulation in the pi-calculus using Isabelle
. 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
. 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
. 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)
. IT Technical Reports nr 2007-035, 2007. (External link
).
-
Testbed and Methodology for Experimental Evaluation of Opportunistic Networks
. In 7th Scandinavian Workshop on Wireless Ad-hoc Networks (ADHOC'07), 2007.
-
The GTO Toolset and Method
. In Electronic Notes in Theoretical Computer Science, volume 185, pp 77-91, 2007. (DOI
).
-
Timed calculus of cryptographic communication
. 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
. In 6th Scandinavian Workshop on Wireless Ad-hoc Networks (ADHOC'06), 2006.
-
On the Expressiveness of Linearity vs Persistence in the Asynchronous Pi-Calculus
. 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
. 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
. Technical report / Department of Information Technology, Uppsala University nr 2006-029, 2006. (fulltext
).
-
A Fully Abstract Encoding of the pi-Calculus with Data Terms
. 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
. 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
. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2005-004, Uppsala University, 2005. (fulltext
).
-
Modelling Fusion Calculus using HD-Automata
. Technical report / Department of Information Technology, Uppsala University nr 2005-038, 2005.
-
Modelling and Minimising the Fusion Calculus using HD-automata
. In Proceedings of CALCO 2005, 2005. (DOI
, External link
).
-
Verification and generation of geographical data using domain theory
. 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
. Research Report UDMI nr 15/2004/RR, Department of Mathematics and Computer Science, University of Udine, 2004.
-
Automatized Verification of Ad Hoc Routing Protocols
. 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
. In Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN'04), p 300, 2004.
-
Non-viability Deductions in Arc-Consistency Computation
. In Logic Programming: 20th International Conference, ICLP 2004, pp 343-355, 2004.
-
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
. 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
. 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
. 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
. 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
. Volume 63(1) of Journal of Logic and Algebraic Programming, Elsevier, 2004. (DOI
, External link
).
-
Spezifikation von Stellwerkslogik mit formalen Methoden
. In Signal + Draht, number 1+2, 2004.
-
Spi Calculus Translated to pi-Calculus Preserving May-Tests
. 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
. 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
. In Electronic Notes in Theoretical Computer Science, volume 105, pp 11-20, 2004.
-
Concurrency, Time, and Constraints
. In Logic Programming, 19th International Conference, pp 72-101, 2003.
-
Polyadic History-Dependent Automata for the Fusion Calculus
. Technical report / Department of Information Technology, Uppsala University nr 2003-062, 2003. (fulltext
).
-
Solos in Concert
. In Mathematical Structures in Computer Science, volume 13, number 5, pp 657-683, 2003. (DOI
).
-
Spi Calculus Translated to pi-Calculus Preserving May-Testing
. Technical report / Department of Information Technology, Uppsala University nr 2003-063, 2003. (fulltext
).
-
The difference between concurrent and sequential computation
. 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
. Volume 2391 of Lecture Notes in Computer Science, Springer-Verlag, Berlin Heidelberg, 2002.
-
An introduction to the pi-calculus
. In Handbook of Pocess Algebra, pp 479-543, Elsevier, 2001.
-
Solo diagrams
. In Proceedings of TACS 2001, pp 127-144, 2001. (External link
).
-
EXPRESS'00: 7th International Workshop on Expressiveness in Concurrency
. Volume 39 of Electronic Notes in Theoretical Computer Science, Elsevier, 2000. (DOI
, External link
).
-
Trios in Concert
. 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
. 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
. IT Technical Reports, Dept. of Information Technology, Uppsala university, 1999. (External link
).
-
Solos in Concert
. In Proceedings of ICALP'99, 1999. (External link
).
-
Calculi for Mobile Processes: Bibliography and Web Pages
. In Bulletin of the EATCS, volume 64, 1998.
-
Concurrent Constraints in the Fusion Calculus
. In Proceedings of ICALP'98, volume 1443 of Lectute notes in computer science, pp 455-469, Springer, Berlin, 1998. (DOI
).
-
Programmeraren som Schaman
. In Forskning och Framsteg, number 2, pp 14-19, 1998.
-
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
. Ph.D. thesis, DoCS nr 98, Department of Computer Systems, Uppsala University, 1998.
-
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
. 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
. In Proceedings of CONCUR'98, volume 1466 of Lecture notes in computer science, pp 99-114, Springer, Berlin, 1998. (DOI
).
-
The Update Calculus
. In Proceedings of AMAST'97, volume 1349 of Lecture notes in computer science, pp 409-423, Springer, Berlin, 1997. (DOI
).
-
Constraints as Processes
. 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
. In Computer Communications, volume 19, number 14, pp 1151-1160, 1996. (DOI
).
-
Algebraic Theories of Name-Passing Calculi
. In Information and Computation, volume 120, number 2, pp 174-197, 1995. (DOI
).
-
Interaction Diagrams
. In Nordic Journal of Computing, volume 2, number 4, pp 407-443, 1995.
-
The Complete Axiomatization of Cs-Congruence
. 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
. In Proceedings of CAV'94, pp 428-440, 1994. (DOI
).
-
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs
. In Information and Computation, volume 107, number 2, pp 272-302, 1993. (DOI
).
-
Modal Logics for Mobile Processes
. In Theoretical Computer Science, volume 114, number 1, pp 149-171, 1993. (DOI
).
-
Structural and Behavioural Equivalences of Networks
. 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
. In ACM Transactions on Programming Languages and Systems, volume 15, number 1, pp 36-72, 1993. (DOI
).
-
A Calculus of Mobile Processes - Part I
. In Information and Computation, volume 100, number 1, pp 1-40, 1992. (DOI
).
-
A Calculus of Mobile Processes - Part II
. In Information and Computation, volume 100, number 1, pp 41-77, 1992. (DOI
).
-
A finitary version of the calculus of partial inductive definitions
. 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
. In Formal Aspects of Computing, volume 4, number 6, pp 497-543, 1992. (DOI
).
-
Multiway Synchronization Verified with Coupled Simulation
. 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
. In Future Generation Computer Systems, volume 6, number 3, pp 271-285, 1990. (DOI
).
-
Submodule Construction as Equation Solving in CCS
. In Theoretical Computer Science, volume 68, number 2, pp 175-202, 1989. (DOI
).
-
Incorporating mutable arrays into logic programming
. 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
. In The journal of logic programming, volume 1, number 1, pp 3-18, North-Holland, 1984.