| 2024 | CAV | Parsimonious Optimal Dynamic Partial Order Reduction. | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas |
| 2024 | ISSTA | SMBugFinder: An Automated Framework for Testing Protocol Implementations for State Machine Bugs. | Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tquist |
| 2024 | TACAS | Scalable Tree-based Register Automata Learning. | Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tquist |
| 2023 | ATVA | Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs. | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bnneland, Sarbojit Das, Bengt Jonsson, Magnus Lng, Konstantinos Sagonas |
| 2023 | CONCUR | CONCUR Test-Of-Time Award 2023 (Invited Paper). | Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz |
| 2023 | NDSS | Automata-Based Automated Detection of State Machine Bugs in Protocol Implementations. | Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tquist |
| 2023 | SEFM | An Active Learning Approach to Synthesizing Program Contracts. | Sandip Ghosal, Bengt Jonsson, Philipp Rmmer |
| 2022 | FMCAD | Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. | Bengt Jonsson, Magnus Lng, Konstantinos Sagonas |
| 2022 | ICST | Applying Symbolic Execution to Test Implementations of a Network Protocol Against its Specification. | Hooman Asadian, Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas |
| 2022 | ICST | DTLS-Fuzzer: A DTLS Protocol State Fuzzer. | Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tquist |
| 2018 | ESOP | Fragment Abstraction for Concurrent Shape Analysis. | Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh |
| 2018 | PADS | Fine-Grained Local Dynamic Load Balancing in PDES. | Jonatan Lindn, Pavol Bauer, Stefan Engblom, Bengt Jonsson |
| 2018 | SPAA | Lock-free Contention Adapting Search Trees. | Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson |
| 2018 | TACAS | Optimal Dynamic Partial Order Reduction with Observers. | Stavros Aronis, Bengt Jonsson, Magnus Lng, Konstantinos Sagonas |
| 2017 | PADS | Exposing Inter-Process Information for Efficient Parallel Discrete Event Simulation of Spatial Stochastic Systems. | Jonatan Lindn, Pavol Bauer, Stefan Engblom, Bengt Jonsson |
| 2016 | CAV | Stateless Model Checking for POWER. | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson |
| 2016 | ICST | Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing. | Johan Blom, Bengt Jonsson, Sven-Olof Nystrm |
| 2016 | SAS | Automated Verification of Linearization Policies. | Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh |
| 2015 | ISPASS | A modeling framework for reuse distance-based estimation of cache performance. | Xiaoyue Pan, Bengt Jonsson |
| 2015 | PADS | Efficient Inter-Process Synchronization for Parallel Discrete Event Simulation on Multicores. | Pavol Bauer, Jonatan Lindn, Stefan Engblom, Bengt Jonsson |
| 2015 | TACAS | Stateless Model Checking for TSO and PSO. | Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas |
| 2014 | ISPASS | Modeling cache coherence misses on multicores. | Xiaoyue Pan, Bengt Jonsson |
| 2014 | POPL | Optimal dynamic partial order reduction. | Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas |
| 2014 | SEFM | Learning Extended Finite State Machines. | Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen |
| 2013 | ATVA | Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. | Parosh Aziz Abdulla, Luks Holk, Bengt Jonsson, Ondrej Lengl, Cong Quy Trinh, Toms Vojnar |
| 2013 | OPODIS | A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. | Jonatan Lindn, Bengt Jonsson |
| 2013 | SEFM | Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning. | Amel Bennaceur, Chris Chilton, Malte Isberner, Bengt Jonsson |
| 2013 | TACAS | An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. | Parosh Aziz Abdulla, Frdric Haziza, Luks Holk, Bengt Jonsson, Ahmed Rezine |
| 2012 | ATVA | A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. | Sofia Cassel, Bengt Jonsson, Falk Howar, Bernhard Steffen |
| 2012 | ESOP | A Compositional Specification Theory for Component Behaviours. | Taolue Chen, Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska |
| 2012 | ISoLA | Inferring Semantic Interfaces of Data Structures. | Falk Howar, Malte Isberner, Bernhard Steffen, Oliver Bauer, Bengt Jonsson |
| 2012 | TACAS | Demonstrating Learning of Register Automata. | Maik Merten, Falk Howar, Bernhard Steffen, Sofia Cassel, Bengt Jonsson |
| 2012 | VMCAI | Inferring Canonical Register Automata. | Falk Howar, Bernhard Steffen, Bengt Jonsson, Sofia Cassel |
| 2011 | ATVA | A Succinct Canonical Register Automaton Model. | Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen |
| 2010 | ISoLA | Inferring Compact Models of Communication Protocol Entities. | Therese Bohlin, Bengt Jonsson, Siavash Soleimanifard |
| 2010 | ISoLA | On Handling Data in Automata Learning - Considerations from the CONNECT Perspective. | Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen, Sofia Cassel |
| 2009 | ICECCS | CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. | Valrie Issarny, Bernhard Steffen, Bengt Jonsson, Gordon S. Blair, Paul Grace, Marta Z. Kwiatkowska, Radu Calinescu, Paola Inverardi, Massimo Tivoli, Antonia Bertolino, Antonino Sabetta |
| 2008 | EMSOFT | Cyclic dependencies in modular performance analysis. | Bengt Jonsson, Simon Perathoner, Lothar Thiele, Wang Yi |
| 2008 | FASE | Regular Inference for State Machines Using Domains with Equality Tests. | Therese Berg, Bengt Jonsson, Harald Raffelt |
| 2008 | TACAS | Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. | Mayank Saksena, Oskar Wibling, Bengt Jonsson |
| 2007 | CAV | Systematic Acceleration in Regular Model Checking. | Bengt Jonsson, Mayank Saksena |
| 2006 | CONCUR | Proving Liveness by Backwards Reachability. | Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena |
| 2006 | CONCUR | Inference of Event-Recording Automata Using Timed Decision Trees. | Olga Grinchtein, Bengt Jonsson, Paul Pettersson |
| 2006 | FASE | Regular Inference for State Machines with Parameters. | Therese Berg, Bengt Jonsson, Harald Raffelt |
| 2005 | FASE | On the Correspondence Between Conformance Testing and Regular Inference. | Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, Bernhard Steffen |
| 2004 | CAV | Regular Model Checking for LTL(MSO). | Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena |
| 2004 | CONCUR | A Survey of Regular Model Checking. | Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena |
| 2003 | CAV | Algorithmic Improvements in Regular Model Checking. | Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso |
| 2002 | CAV | Regular Tree Model Checking. | Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso |
| 2002 | CONCUR | Regular Model Checking Made Simple and Efficient. | Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso |
| 2002 | EMSOFT | Processor Pipelines and Their Properties for Static WCET Analysis. | Jakob Engblom, Bengt Jonsson |
| 2001 | CONCUR | Channel Representations in Protocol Verification. | Parosh Aziz Abdulla, Bengt Jonsson |
| 2000 | CAV | Invited Tutorial: Verification of Infinite-State and Parameterized Systems. | Parosh Aziz Abdulla, Bengt Jonsson |
| 2000 | CAV | Regular Model Checking. | Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili |
| 2000 | CONCUR | Reasoning about Probabilistic Lossy Channel Systems. | Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson |
| 2000 | TACAS | Transitive Closures of Regular Relations for Verifying Infinite-State Systems. | Bengt Jonsson, Marcus Nilsson |
| 1999 | CAV | Handling Global Conditions in Parameterized System Verification. | Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson |
| 1998 | CAV | On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. | Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson |
| 1998 | CAV | A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract). | Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, Doron A. Peled |
| 1998 | CONCUR | Partial Order Reductions for Timed Systems. | Johan Bengtsson, Bengt Jonsson, Johan Lilius, Wang Yi |
| 1998 | TACAS | Verifying Networks of Timed Processes (Extended Abstract). | Parosh Aziz Abdulla, Bengt Jonsson |
| 1996 | LICS | General Decidability Theorems for Infinite-State Systems. | Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay |
| 1995 | CAV | Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms. | Bengt Jonsson, Lars Kempe |
| 1995 | LICS | Compositional Testing Preorders for Probabilistic Processes | Bengt Jonsson, Wang Yi |
| 1994 | ICALP | Undecidable Verification Problems for Programs with Unreliable Channels. | Parosh Aziz Abdulla, Bengt Jonsson |
| 1993 | FORTE | Validating Simulations Between Large Nondeterministic Specifications. | Ricardo Civalero, Bengt Jonsson, Joakim Nilsson |
| 1993 | LICS | Verifying Programs with Unreliable Channels | Parosh Aziz Abdulla, Bengt Jonsson |
| 1991 | CONCUR | Simulations Between Specifications of Distributed Systems. | Bengt Jonsson |
| 1991 | FORTE | Specification and Validation of a Simple Overtaking Protokol using LOTOS. | Patrik Ernberg, Lars-ke Fredlund, Bengt Jonsson |
| 1991 | LICS | Specification and Refinement of Probabilistic Processes | Bengt Jonsson, Kim Guldstrand Larsen |
| 1990 | CONCUR | An Implementation of a Translational Semantics for an Imperative Language. | Lars-ke Fredlund, Bengt Jonsson, Joachim Parrow |
| 1990 | MFCS | A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract). | Bengt Jonsson |
| 1990 | RTSS | A Calculus for Communicating Systems with Time and Probabitilies. | Hans Hansson, Bengt Jonsson |
| 1989 | FORTE | Specification for Verification. | Hans Hansson, Bengt Jonsson, Fredrik Orava, Bjrn Pehrson |
| 1989 | POPL | A Fully Abstract Trace Model for Dataflow Networks. | Bengt Jonsson |
| 1989 | STACS | Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. | Bengt Jonsson, Joachim Parrow |
| 1989 | RTSS | A Framework for Reasoning about Time and Reliability. | Hans Hansson, Bengt Jonsson |
| 1987 | PODC | Modular Verification of Asynchronous Networks. | Bengt Jonsson |
| 1986 | LICS | Towards Deductive Synthesis of Dataflow Networks | Bengt Jonsson, Zohar Manna, Richard J. Waldinger |
| 1985 | PODC | A Model and Proof System for Asynchronous Networks. | Bengt Jonsson |