A Model and Proof System for Asynchronous Networks. - Bengt Jonsson 001 (PODC, 1985)

Towards Deductive Synthesis of Dataflow Networks - Bengt Jonsson 001; Zohar Manna; Richard J. Waldinger (LICS, 1986)

Modular Verification of Asynchronous Networks. - Bengt Jonsson 001 (PODC, 1987)

Implementing a Model Checking Algorithm by Adapting Existing Automated Tools. - Bengt Jonsson 001; Ahmed Hussain Khan; Joachim Parrow (Automatic Verification Methods for Finite State Systems, 1989)

Specification for Verification. - Hans Hansson; Bengt Jonsson 001; Fredrik Orava; Björn Pehrson (FORTE, 1989)

Comparing Two Fully Abstract Dataflow Models. - Bengt Jonsson 001; Joost N. Kok (PARLE (2), 1989)

A Fully Abstract Trace Model for Dataflow Networks. - Bengt Jonsson 001 (POPL, 1989)

On Decomposing and Refining Specifications of Distributed Systems. - Bengt Jonsson 001 (REX Workshop, 1989)

A Framework for Reasoning about Time and Reliability. - Hans Hansson; Bengt Jonsson 001 (RTSS, 1989)

An Implementation of a Translational Semantics for an Imperative Language. - Lars-Åke Fredlund; Bengt Jonsson 001; Joachim Parrow (CONCUR, 1990)

A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract). - Bengt Jonsson 001 (MFCS, 1990)

A Calculus for Communicating Systems with Time and Probabitilies. - Hans Hansson; Bengt Jonsson 001 (RTSS, 1990)

Simulations Between Specifications of Distributed Systems. - Bengt Jonsson 001 (CONCUR, 1991)

Specification and Validation of a Simple Overtaking Protokol using LOTOS. - Patrik Ernberg; Lars-Åke Fredlund; Bengt Jonsson 001 (FORTE, 1991)

Specification and Refinement of Probabilistic Processes - Bengt Jonsson 001; Kim Guldstrand Larsen (LICS, 1991)

Towards a Complete Hierarchy of Compositional Dataflow Models. - Bengt Jonsson 001; Joost N. Kok (TACS, 1991)

Refining Interfaces of Communicating Systems. - Ed Brinksma; Bengt Jonsson 001; Fredrik Orava (TAPSOFT, Vol.2, 1991)

On the Complexity of Equation Solving in Process Algebra. - Bengt Jonsson 001; Kim Guldstrand Larsen (TAPSOFT, Vol.1, 1991)

Validating Simulations Between Large Nondeterministic Specifications. - Ricardo Civalero; Bengt Jonsson 001; Joakim Nilsson (FORTE, 1993)

Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations. - Sven-Olof Nyström; Bengt Jonsson 001 (ILPS, 1993)

Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs - Bengt Jonsson 001; Joachim Parrow (Inf. Comput., 1993)

Constraint Oriented Temporal Logic Specification. - Johan Blom; Bengt Jonsson 001 (Formal Systems Specification, 1994)

Using temporal logic for modular specification of telephone services. - Johan Blom; Bengt Jonsson 001; Lars Kempe (FIW, 1994)

Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes. - Wang Yi 001; Bengt Jonsson 001 (FSTTCS, 1994)

Testing and Refinement for Nondeterministic and Probabilistic Processes. - Bengt Jonsson 001; Chris Ho-Stuart; Wang Yi 001 (FTRTFT, 1994)

A Fully Abstract Trace Model for Dataflow and Asynchronous Networks. - Bengt Jonsson 001 (Distributed Comput., 1994)

A Logic for Reasoning about Time and Reliability. - Hans Hansson; Bengt Jonsson 001 (Formal Aspects Comput., 1994)

Compositional Specification and Verification of Distributed Systems. - Bengt Jonsson 001 (ACM Trans. Program. Lang. Syst., 1994)

Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms. - Bengt Jonsson 001; Lars Kempe (CAV, 1995)

Compositional Testing Preorders for Probabilistic Processes - Bengt Jonsson 001; Wang Yi 001 (LICS, 1995)

Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract). - Bengt Jonsson 001; Yih-Kuen Tsay (TAPSOFT, 1995)

Guest Editors Foreword. - Bengt Jonsson 001; Joachim Parrow (Nord. J. Comput., 1995)

General Decidability Theorems for Infinite-State Systems. - Parosh Aziz Abdulla; Karlis Cerans; Bengt Jonsson 001; Yih-Kuen Tsay (LICS, 1996)

Verifying Programs with Unreliable Channels. - Parosh Aziz Abdulla; Bengt Jonsson 001 (Inf. Comput., 1996)

Undecidable Verification Problems for Programs with Unreliable Channels. - Parosh Aziz Abdulla; Bengt Jonsson 001 (Inf. Comput., 1996)

Assumption/Guarantee Specifications in Linear-Time Temporal Logic. - Bengt Jonsson 001; Yih-Kuen Tsay (Theor. Comput. Sci., 1996)

On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels. - Parosh Aziz Abdulla; Ahmed Bouajjani; Bengt Jonsson 001 (CAV, 1998)

A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract). - Parosh Aziz Abdulla; Bengt Jonsson 001; Mats Kindahl; Doron A. Peled (CAV, 1998)

Partial Order Reductions for Timed Systems. - Johan Bengtsson; Bengt Jonsson 001; Johan Lilius; Wang Yi 001 (CONCUR, 1998)

Verifying Networks of Timed Processes (Extended Abstract). - Parosh Aziz Abdulla; Bengt Jonsson 001 (TACAS, 1998)

A Fully Abstract Semantics for Concurrent Constraint Programming. - Sven-Olof Nyström; Bengt Jonsson 001 (Inf. Comput., 1998)

Fully Abstract Characterization of Probabilistic May Testing. - Bengt Jonsson 001; Wang Yi 001 (ARTS, 1999)

On the Existence of Network Invariants for Verifying Parameterized Systems. - Parosh Aziz Abdulla; Bengt Jonsson 001 (Correct System Design, 1999)

Handling Global Conditions in Parameterized System Verification. - Parosh Aziz Abdulla; Ahmed Bouajjani; Bengt Jonsson 001; Marcus Nilsson (CAV, 1999)

Proving Refinement Using Transduction. - Bengt Jonsson 001; Amir Pnueli; Camilla Rump (Distributed Comput., 1999)

Invited Tutorial: Verification of Infinite-State and Parameterized Systems. - Parosh Aziz Abdulla; Bengt Jonsson 001 (CAV, 2000)

Regular Model Checking. - Ahmed Bouajjani; Bengt Jonsson 001; Marcus Nilsson; Tayssir Touili (CAV, 2000)

Reasoning about Probabilistic Lossy Channel Systems. - Parosh Aziz Abdulla; Christel Baier; S. Purushothaman Iyer; Bengt Jonsson 001 (CONCUR, 2000)

Abstraction of Communication Channels in Promela: A Case Study. - Elena Fersman; Bengt Jonsson 001 (SPIN, 2000)

Transitive Closures of Regular Relations for Verifying Infinite-State Systems. - Bengt Jonsson 001; Marcus Nilsson (TACAS, 2000)

Algorithmic Analysis of Programs with Well Quasi-ordered Domains. - Parosh Aziz Abdulla; Karlis Cerans; Bengt Jonsson 001; Yih-Kuen Tsay (Inf. Comput., 2000)

Probabilistic Extensions of Process Algebras. - Bengt Jonsson 001; Wang Yi 001; Kim G. Larsen (Handbook of Process Algebra, 2001)

Channel Representations in Protocol Verification. - Parosh Aziz Abdulla; Bengt Jonsson 001 (CONCUR, 2001)

An Execution Semantics for MSC-2000. - Bengt Jonsson 001; Gerardo Padilla (SDL Forum, 2001)

Incremental Requirement Specification for Evolving Systems. - Bengt Jonsson 001; Tiziana Margaria; Gustaf Naeser; Jan Nyström; Bernhard Steffen (Nord. J. Comput., 2001)

Ensuring completeness of symbolic verification methods for infinite-state systems. - Parosh Aziz Abdulla; Bengt Jonsson 001 (Theor. Comput. Sci., 2001)

Regular Tree Model Checking. - Parosh Aziz Abdulla; Bengt Jonsson 001; Pritha Mahata; Julien d'Orso (CAV, 2002)

Regular Model Checking Made Simple and Efficient. - Parosh Aziz Abdulla; Bengt Jonsson 001; Marcus Nilsson; Julien d'Orso (CONCUR, 2002)

Processor Pipelines and Their Properties for Static WCET Analysis. - Jakob Engblom; Bengt Jonsson 001 (EMSOFT, 2002)

Eliminating Queues from RT UML Model Representations. - Werner Damm; Bengt Jonsson 001 (FTRTFT, 2002)

Testing preorders for probabilistic processes can be characterized by simulations. - Bengt Jonsson 001; Wang Yi 001 (Theor. Comput. Sci., 2002)

Algorithmic Improvements in Regular Model Checking. - Parosh Aziz Abdulla; Bengt Jonsson 001; Marcus Nilsson; Julien d'Orso (CAV, 2003)

Automated test generation for industrial Erlang applications. - Johan Blom; Bengt Jonsson 001 (Erlang Workshop, 2003)

Insights to Angluin's Learning. - Therese Berg; Bengt Jonsson 001; Martin Leucker; Mayank Saksena (SVV@ICLP, 2003)

Generating online test oracles from temporal logic specifications. - John Håkansson; Bengt Jonsson 001; Ola Lundqvist (Int. J. Softw. Tools Technol. Transf., 2003)

Preface by the section editors. - Bengt Jonsson 001; Konstantinos Sagonas (Int. J. Softw. Tools Technol. Transf., 2003)

Model checking of systems with many identical timed processes. - Parosh Aziz Abdulla; Bengt Jonsson 001 (Theor. Comput. Sci., 2003)

A Survey of Regular Model Checking. - Parosh Aziz Abdulla; Bengt Jonsson 001; Marcus Nilsson; Mayank Saksena (CONCUR, 2004)

Finite State Machines. - Bengt Jonsson 001 (Model-Based Testing of Reactive Systems, 2004)

Specifying and Generating Test Cases Using Observer Automata. - Johan Blom; Anders Hessel; Bengt Jonsson 001; Paul Pettersson (FATES, 2004)

Inference of Timed Transition Systems. - Olga Grinchtein; Bengt Jonsson 001; Martin Leucker (INFINITY, 2004)

Using Forward Reachability Analysis for Verification of Lossy Channel Systems. - Parosh Aziz Abdulla; Aurore Collomb-Annichini; Ahmed Bouajjani; Bengt Jonsson 001 (Formal Methods Syst. Des., 2004)

On the Correspondence Between Conformance Testing and Regular Inference. - Therese Berg; Olga Grinchtein; Bengt Jonsson 001; Martin Leucker; Harald Raffelt; Bernhard Steffen (FASE, 2005)

Simulating perfect channels with probabilistic lossy channels. - Parosh Aziz Abdulla; Christel Baier; S. Purushothaman Iyer; Bengt Jonsson 001 (Inf. Comput., 2005)

Proving Liveness by Backwards Reachability. - Parosh Aziz Abdulla; Bengt Jonsson 001; Ahmed Rezine; Mayank Saksena (CONCUR, 2006)

Inference of Event-Recording Automata Using Timed Decision Trees. - Olga Grinchtein; Bengt Jonsson 001; Paul Pettersson (CONCUR, 2006)

Regular Inference for State Machines with Parameters. - Therese Berg; Bengt Jonsson 001; Harald Raffelt (FASE, 2006)

Systematic Acceleration in Regular Model Checking. - Bengt Jonsson 001; Mayank Saksena (CAV, 2007)

Cyclic dependencies in modular performance analysis. - Bengt Jonsson 001; Simon Perathoner; Lothar Thiele; Wang Yi 001 (EMSOFT, 2008)

Regular Inference for State Machines Using Domains with Equality Tests. - Therese Berg; Bengt Jonsson 001; Harald Raffelt (FASE, 2008)

Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. - Mayank Saksena; Oskar Wibling; Bengt Jonsson 001 (TACAS, 2008)

State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version). - Bengt Jonsson 001 (SIGARCH Comput. Archit. News, 2008)

CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. - Valérie Issarny; Bernhard Steffen; Bengt Jonsson 001; Gordon S. Blair; Paul Grace; Marta Z. Kwiatkowska; Radu Calinescu; Paola Inverardi; Massimo Tivoli; Antonia Bertolino; Antonino Sabetta (ICECCS, 2009)

10051 Abstracts Collection - Quantitative and Qualitative Analysis of Network Protocols. - Bengt Jonsson 001; Jörg Kreiker; Marta Z. Kwiatkowska (Quantitative and Qualitative Analysis of Network Protocols, 2010)

10051 Executive Summary - Quantitative and Qualitative Analysis of Network Protocols. - Bengt Jonsson 001; Jörg Kreiker; Marta Z. Kwiatkowska (Quantitative and Qualitative Analysis of Network Protocols, 2010)

Inferring Compact Models of Communication Protocol Entities. - Therese Bohlin; Bengt Jonsson 001; Siavash Soleimanifard (ISoLA (1), 2010)

On Handling Data in Automata Learning - Considerations from the CONNECT Perspective. - Falk Howar; Bengt Jonsson 001; Maik Merten; Bernhard Steffen; Sofia Cassel (ISoLA (2), 2010)

Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. - Fides Aarts; Bengt Jonsson 001; Johan Uijen (ICTSS, 2010)

Learning of event-recording automata. - Olga Grinchtein; Bengt Jonsson 001; Martin Leucker (Theor. Comput. Sci., 2010)

Learning of Automata Models Extended with Data. - Bengt Jonsson 001 (SFM, 2011)

A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. - Sofia Cassel; Bengt Jonsson 001; Falk Howar; Bernhard Steffen (ATVA, 2012)

A Compositional Specification Theory for Component Behaviours. - Taolue Chen 001; Chris Chilton; Bengt Jonsson 001; Marta Z. Kwiatkowska (ESOP, 2012)

Assume-Guarantee Reasoning for Safe Component Behaviours. - Chris Chilton; Bengt Jonsson 001; Marta Z. Kwiatkowska (FACS, 2012)

Inferring Semantic Interfaces of Data Structures. - Falk Howar; Malte Isberner; Bernhard Steffen; Oliver Bauer; Bengt Jonsson 001 (ISoLA (1), 2012)

Demonstrating Learning of Register Automata. - Maik Merten; Falk Howar; Bernhard Steffen; Sofia Cassel; Bengt Jonsson 001 (TACAS, 2012)

Inferring Canonical Register Automata. - Falk Howar; Bernhard Steffen; Bengt Jonsson 001; Sofia Cassel (VMCAI, 2012)

Using refinement calculus techniques to prove linearizability. - Bengt Jonsson 001 (Formal Aspects Comput., 2012)

Regular model checking for LTL(MSO). - Parosh Aziz Abdulla; Bengt Jonsson 001; Marcus Nilsson; Julien d'Orso; Mayank Saksena (Int. J. Softw. Tools Technol. Transf., 2012)

A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. - Jonatan Lindén; Bengt Jonsson 001 (OPODIS, 2013)

Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning. - Amel Bennaceur; Chris Chilton; Malte Isberner; Bengt Jonsson 001 (SEFM, 2013)

Modeling cache coherence misses on multicores. - Xiaoyue Pan; Bengt Jonsson 001 (ISPASS, 2014)

Optimal dynamic partial order reduction. - Parosh Aziz Abdulla; Stavros Aronis; Bengt Jonsson 001; Konstantinos Sagonas (POPL, 2014)

Learning Extended Finite State Machines. - Sofia Cassel; Falk Howar; Bengt Jonsson 001; Bernhard Steffen (SEFM, 2014)

A Constraint Programming Approach for Managing End-to-end Requirements in Sensor Network Macroprogramming. - Farshid Hassani Bijarbooneh; Animesh Pathak; Justin Pearson; Valérie Issarny; Bengt Jonsson 001 (SENSORNETS, 2014)

Compositional assume-guarantee reasoning for input/output component theories. - Chris Chilton; Bengt Jonsson 001; Marta Z. Kwiatkowska (Sci. Comput. Program., 2014)

An algebraic theory of interface automata. - Chris Chilton; Bengt Jonsson 001; Marta Z. Kwiatkowska (Theor. Comput. Sci., 2014)

Building timing predictable embedded systems. - Philip Axer; Rolf Ernst; Heiko Falk; Alain Girault; Daniel Grund; Nan Guan; Bengt Jonsson 001; Peter Marwedel; Jan Reineke 001; Christine Rochange; Maurice Sebastian; Reinhard von Hanxleden; et al. (ACM Trans. Embed. Comput. Syst., 2014)

Mediator Synthesis in a Component Algebra with Data. - Lukás Holík; Malte Isberner; Bengt Jonsson 001 (Correct System Design, 2015)

A modeling framework for reuse distance-based estimation of cache performance. - Xiaoyue Pan; Bengt Jonsson 001 (ISPASS, 2015)

Efficient Inter-Process Synchronization for Parallel Discrete Event Simulation on Multicores. - Pavol Bauer; Jonatan Lindén; Stefan Engblom; Bengt Jonsson 001 (SIGSIM-PADS, 2015)

Generating models of infinite-state communication protocols using regular inference with abstraction. - Fides Aarts; Bengt Jonsson 001; Johan Uijen; Frits W. Vaandrager (Formal Methods Syst. Des., 2015)

A succinct canonical register automaton model. - Sofia Cassel; Falk Howar; Bengt Jonsson 001; Maik Merten; Bernhard Steffen (J. Log. Algebraic Methods Program., 2015)

Stateless Model Checking for POWER. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Bengt Jonsson 001; Carl Leonardsson (CAV (2), 2016)

Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing. - Johan Blom; Bengt Jonsson 001; Sven-Olof Nyström (ICST Workshops, 2016)

Automated Verification of Linearization Policies. - Parosh Aziz Abdulla; Bengt Jonsson 001; Cong Quy Trinh (SAS, 2016)

Verification of heap manipulating programs with ordered data by extended forest automata. - Parosh Aziz Abdulla; Lukás Holík; Bengt Jonsson 001; Ondrej Lengál; Cong Quy Trinh; Tomás Vojnar (Acta Informatica, 2016)

Active learning for extended finite state machines. - Sofia Cassel; Falk Howar; Bengt Jonsson 001; Bernhard Steffen (Formal Aspects Comput., 2016)

Comparing Source Sets and Persistent Sets for Partial Order Reduction. - Parosh Aziz Abdulla; Stavros Aronis; Bengt Jonsson 001; Konstantinos Sagonas (Models, Algorithms, Logics and Tools, 2017)

Exposing Inter-Process Information for Efficient Parallel Discrete Event Simulation of Spatial Stochastic Systems. - Jonatan Lindén; Pavol Bauer; Stefan Engblom; Bengt Jonsson 001 (SIGSIM-PADS, 2017)

Stateless model checking for TSO and PSO. - Parosh Aziz Abdulla; Stavros Aronis; Mohamed Faouzi Atig; Bengt Jonsson 001; Carl Leonardsson; Konstantinos Sagonas (Acta Informatica, 2017)

Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. - Parosh Aziz Abdulla; Stavros Aronis; Bengt Jonsson 001; Konstantinos Sagonas (J. ACM, 2017)

An integrated specification and verification technique for highly concurrent data structures. - Parosh Aziz Abdulla; Frédéric Haziza; Lukás Holík; Bengt Jonsson 001; Ahmed Rezine (Int. J. Softw. Tools Technol. Transf., 2017)

Extending Automata Learning to Extended Finite State Machines. - Sofia Cassel; Falk Howar; Bengt Jonsson 001; Bernhard Steffen (Machine Learning for Dynamic Software Analysis, 2018)

Fragment Abstraction for Concurrent Shape Analysis. - Parosh Aziz Abdulla; Bengt Jonsson 001; Cong Quy Trinh (ESOP, 2018)

Fine-Grained Local Dynamic Load Balancing in PDES. - Jonatan Lindén; Pavol Bauer; Stefan Engblom; Bengt Jonsson 001 (SIGSIM-PADS, 2018)

Optimal Dynamic Partial Order Reduction with Observers. - Stavros Aronis; Bengt Jonsson 001; Magnus Lång; Konstantinos Sagonas (TACAS (2), 2018)

Optimal stateless model checking under the release-acquire semantics. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Bengt Jonsson 001; Tuan Phong Ngo (Proc. ACM Program. Lang., 2018)

Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial). - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Bengt Jonsson 001; Tuan Phong Ngo (NETYS, 2019)

Optimal stateless model checking for reads-from equivalence under sequential consistency. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Bengt Jonsson 001; Magnus Lång; Tuan Phong Ngo; Konstantinos Sagonas (Proc. ACM Program. Lang., 2019)

Exposing Inter-process Information for Efficient PDES of Spatial Stochastic Systems on Multicores. - Jonatan Lindén; Pavol Bauer; Stefan Engblom; Bengt Jonsson 001 (ACM Trans. Model. Comput. Simul., 2019)

Combining Black-Box and White-Box Techniques for Learning Register Automata. - Falk Howar; Bengt Jonsson 001; Frits W. Vaandrager (Computing and Software Science, 2019)

Optimal Stateless Model Checking for Reads-From Equivalence under Sequential Consistency. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Bengt Jonsson 001; Magnus Lång; Tuan Phong Ngo; Konstantinos Sagonas (Zenodo, 2019)

Analysis of DTLS Implementations Using Protocol State Fuzzing. - Paul Fiterau-Brostean; Bengt Jonsson 001; Robert Merget; Joeri de Ruiter; Konstantinos Sagonas; Juraj Somorovsky (USENIX Security Symposium, 2020)

Correction to: An integrated specification and verification technique for highly concurrent data structures. - Parosh Aziz Abdulla; Frédéric Haziza; Lukás Holík; Bengt Jonsson 001; Ahmed Rezine (Int. J. Softw. Tools Technol. Transf., 2021)

Lock-free Contention Adapting Search Trees. - Kjell Winblad; Konstantinos Sagonas; Bengt Jonsson 001 (ACM Trans. Parallel Comput., 2021)

Consistency and Persistency in Program Verification: Challenges and Opportunities. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Ahmed Bouajjani; Bengt Jonsson 001; K. Narayan Kumar; Prakash Saivasan (Principles of Systems Design, 2022)

Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. - Bengt Jonsson 001; Magnus Lång; Konstantinos Sagonas (FMCAD, 2022)

Applying Symbolic Execution to Test Implementations of a Network Protocol Against its Specification. - Hooman Asadian; Paul Fiterau-Brostean; Bengt Jonsson 001; Konstantinos Sagonas (ICST, 2022)

DTLS-Fuzzer: A DTLS Protocol State Fuzzer. - Paul Fiterau-Brostean; Bengt Jonsson 001; Konstantinos Sagonas; Fredrik Tåquist (ICST, 2022)

Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Frederik Meyer Bønneland; Sarbojit Das; Bengt Jonsson 001; Magnus Lång; Konstantinos Sagonas (ATVA, 2023)

CONCUR Test-Of-Time Award 2023 (Invited Paper). - Bengt Jonsson 001; Marta Kwiatkowska; Igor Walukiewicz (CONCUR, 2023)

Automata-Based Automated Detection of State Machine Bugs in Protocol Implementations. - Paul Fiterau-Brostean; Bengt Jonsson 001; Konstantinos Sagonas; Fredrik Tåquist (NDSS, 2023)

An Active Learning Approach to Synthesizing Program Contracts. - Sandip Ghosal; Bengt Jonsson 001; Philipp Rümmer (SEFM, 2023)

Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution. - Hooman Asadian; Paul Fiterau-Brostean; Bengt Jonsson 001; Konstantinos Sagonas (ARES, 2024)

Parsimonious Optimal Dynamic Partial Order Reduction. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Sarbojit Das; Bengt Jonsson 001; Konstantinos Sagonas (CAV (2), 2024)

Testing IoT Protocol Requirements Using Fuzzing and Symbolic Execution: Application to CoAP. - Hooman Asadian; Paul Fiterau-Brostean; Bengt Jonsson 001; Konstantinos Sagonas (CSCN, 2024)

SMBugFinder: An Automated Framework for Testing Protocol Implementations for State Machine Bugs. - Paul Fiterau-Brostean; Bengt Jonsson 001; Konstantinos Sagonas; Fredrik Tåquist (ISSTA, 2024)

Scalable Tree-based Register Automata Learning. - Simon Dierl; Paul Fiterau-Brostean; Falk Howar; Bengt Jonsson 001; Konstantinos Sagonas; Fredrik Tåquist (TACAS (2), 2024)

Artifact: Parsimonious Optimal Dynamic Partial Order Reduction. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Sarbojit Das; Bengt Jonsson 001; Konstantinos Sagonas (Zenodo, 2024)

Artifact: Parsimonious Optimal Dynamic Partial Order Reduction. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Sarbojit Das; Bengt Jonsson 001; Konstantinos Sagonas (Zenodo, 2024)

Artifact: Trading Space for Simplicity in Stateless Model Checking. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Sarbojit Das; Bengt Jonsson 001; Konstantinos Sagonas (Zenodo, 2024)

Trading Space for Simplicity in Stateless Model Checking. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Sarbojit Das; Bengt Jonsson 001; Konstantinos Sagonas (Real Time and Such, 2025)

Timing is All You Need. - Susanne Graf; Bengt Jonsson 001; Behnam Khodabandeloo; Chengzi Huang; Nikolaus Huber; Philipp Rümmer; Wang Yi 001 (The Combined Power of Research, Education, and Dissemination, 2025)

Efficient Linearizability Monitoring. - Parosh Aziz Abdulla; Samuel Grahn; Bengt Jonsson 001; Shankaranarayanan Krishna; Om Swostik Mishra (Proc. ACM Program. Lang., 2025)