Bengt Jonsson

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 39

Top Venues

CoRR

SIGSIM-PADS

Int. J. Softw. Tools Technol. Transf.

CAV (2)

Publications

Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
Scalable Tree-based Register Automata Learning. CoRR (2024)
Hooman Asadian, Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas
Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution. ARES (2024)
Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
Scalable Tree-based Register Automata Learning. TACAS (2) (2024)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas
Parsimonious Optimal Dynamic Partial Order Reduction. CAV (2) (2024)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas
Parsimonious Optimal Dynamic Partial Order Reduction. CoRR (2024)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs. ATVA (2023)
Sandip Ghosal, Bengt Jonsson, Philipp Rümmer
An Active Learning Approach to Synthesizing Program Contracts. SEFM (2023)
Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz
CONCUR Test-Of-Time Award 2023 (Invited Paper). CONCUR (2023)
Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
Automata-Based Automated Detection of State Machine Bugs in Protocol Implementations. NDSS (2023)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
Tailoring Stateless Model Checking for Event-Driven Multi-Threaded Programs. CoRR (2023)
Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist
DTLS-Fuzzer: A DTLS Protocol State Fuzzer. ICST (2022)
Hooman Asadian, Paul Fiterau-Brostean, Bengt Jonsson, Konstantinos Sagonas
Applying Symbolic Execution to Test Implementations of a Network Protocol Against its Specification. ICST (2022)
Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. FMCAD (2022)
Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens. CoRR (2022)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Bengt Jonsson, K. Narayan Kumar, Prakash Saivasan
Consistency and Persistency in Program Verification: Challenges and Opportunities. Principles of Systems Design (2022)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
Correction to: An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 23 (5) (2021)
Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson
Lock-free Contention Adapting Search Trees. ACM Trans. Parallel Comput. 8 (2) (2021)
Paul Fiterau-Brostean, Bengt Jonsson, Robert Merget, Joeri de Ruiter, Konstantinos Sagonas, Juraj Somorovsky
Analysis of DTLS Implementations Using Protocol State Fuzzing. USENIX Security Symposium (2020)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan Phong Ngo, Konstantinos Sagonas
Optimal stateless model checking for reads-from equivalence under sequential consistency. Proc. ACM Program. Lang. 3 (OOPSLA) (2019)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo
Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial). NETYS (2019)
Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson
Exposing Inter-process Information for Efficient PDES of Spatial Stochastic Systems on Multicores. ACM Trans. Model. Comput. Simul. 29 (2) (2019)
Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson
Lock-free Contention Adapting Search Trees. SPAA (2018)
Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh
Fragment Abstraction for Concurrent Shape Analysis. ESOP (2018)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo
Optimal stateless model checking under the release-acquire semantics. Proc. ACM Program. Lang. 2 (OOPSLA) (2018)
Stavros Aronis, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas
Optimal Dynamic Partial Order Reduction with Observers. TACAS (2) (2018)
Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen
Extending Automata Learning to Extended Finite State Machines. Machine Learning for Dynamic Software Analysis (2018)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Tuan Phong Ngo
Optimal Stateless Model Checking under the Release-Acquire Semantics. CoRR (2018)
Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson
Fine-Grained Local Dynamic Load Balancing in PDES. SIGSIM-PADS (2018)
Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas
Comparing Source Sets and Persistent Sets for Partial Order Reduction. Models, Algorithms, Logics and Tools (2017)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 19 (5) (2017)
Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas
Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. J. ACM 64 (4) (2017)
Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas
Stateless model checking for TSO and PSO. Acta Informatica 54 (8) (2017)
Jonatan Lindén, Pavol Bauer, Stefan Engblom, Bengt Jonsson
Exposing Inter-Process Information for Efficient Parallel Discrete Event Simulation of Spatial Stochastic Systems. SIGSIM-PADS (2017)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson
Stateless Model Checking for POWER. CoRR (2016)
Johan Blom, Bengt Jonsson, Sven-Olof Nyström
Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing. ICST Workshops (2016)
Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh
Automated Verification of Linearization Policies. SAS (2016)
Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53 (4) (2016)
Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen
Active learning for extended finite state machines. Formal Aspects Comput. 28 (2) (2016)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson
Stateless Model Checking for POWER. CAV (2) (2016)
Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas
Stateless Model Checking for TSO and PSO. CoRR (2015)
Fides Aarts, Bengt Jonsson, Johan Uijen, Frits W. Vaandrager
Generating models of infinite-state communication protocols using regular inference with abstraction. Formal Methods Syst. Des. 46 (1) (2015)
Lukás Holík, Malte Isberner, Bengt Jonsson
Mediator Synthesis in a Component Algebra with Data. Correct System Design (2015)
Pavol Bauer, Jonatan Lindén, Stefan Engblom, Bengt Jonsson
Efficient Inter-Process Synchronization for Parallel Discrete Event Simulation on Multicores. SIGSIM-PADS (2015)
Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas
Stateless Model Checking for TSO and PSO. TACAS (2015)
Xiaoyue Pan, Bengt Jonsson
A modeling framework for reuse distance-based estimation of cache performance. ISPASS (2015)
Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen
A succinct canonical register automaton model. J. Log. Algebraic Methods Program. 84 (1) (2015)
Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska
Compositional assume-guarantee reasoning for input/output component theories. Sci. Comput. Program. 91 (2014)
Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska
An algebraic theory of interface automata. Theor. Comput. Sci. 549 (2014)
Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen
Learning Extended Finite State Machines. SEFM (2014)
Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas
Optimal dynamic partial order reduction. POPL (2014)
Xiaoyue Pan, Bengt Jonsson
Modeling cache coherence misses on multicores. ISPASS (2014)
Philip Axer, Rolf Ernst, Heiko Falk, Alain Girault, Daniel Grund, Nan Guan, Bengt Jonsson, Peter Marwedel, Jan Reineke, Christine Rochange, Maurice Sebastian, Reinhard von Hanxleden, Reinhard Wilhelm, Wang Yi
Building timing predictable embedded systems. ACM Trans. Embed. Comput. Syst. 13 (4) (2014)
Farshid Hassani Bijarbooneh, Animesh Pathak, Justin Pearson, Valérie Issarny, Bengt Jonsson
A Constraint Programming Approach for Managing End-to-end Requirements in Sensor Network Macroprogramming. SENSORNETS (2014)
Jonatan Lindén, Bengt Jonsson
A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention. OPODIS (2013)
Amel Bennaceur, Chris Chilton, Malte Isberner, Bengt Jonsson
Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning. SEFM (2013)
Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA (2013)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. TACAS (2013)
Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska
Assume-Guarantee Reasoning for Safe Component Behaviours. FACS (2012)
Taolue Chen, Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska
A Compositional Specification Theory for Component Behaviours. ESOP (2012)
Falk Howar, Malte Isberner, Bernhard Steffen, Oliver Bauer, Bengt Jonsson
Inferring Semantic Interfaces of Data Structures. ISoLA (1) (2012)
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena
Regular model checking for LTL(MSO). Int. J. Softw. Tools Technol. Transf. 14 (2) (2012)
Falk Howar, Bernhard Steffen, Bengt Jonsson, Sofia Cassel
Inferring Canonical Register Automata. VMCAI (2012)
Sofia Cassel, Bengt Jonsson, Falk Howar, Bernhard Steffen
A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations. ATVA (2012)
Bengt Jonsson
Using refinement calculus techniques to prove linearizability. Formal Aspects Comput. 24 (4-6) (2012)
Maik Merten, Falk Howar, Bernhard Steffen, Sofia Cassel, Bengt Jonsson
Demonstrating Learning of Register Automata. TACAS (2012)
Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen
A Succinct Canonical Register Automaton Model. ATVA (2011)
Bengt Jonsson
Learning of Automata Models Extended with Data. SFM (2011)
Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska
10051 Abstracts Collection - Quantitative and Qualitative Analysis of Network Protocols. Quantitative and Qualitative Analysis of Network Protocols (2010)
Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska
10051 Executive Summary - Quantitative and Qualitative Analysis of Network Protocols. Quantitative and Qualitative Analysis of Network Protocols (2010)
Fides Aarts, Bengt Jonsson, Johan Uijen
Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction. ICTSS (2010)
Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen, Sofia Cassel
On Handling Data in Automata Learning - Considerations from the CONNECT Perspective. ISoLA (2) (2010)
Therese Bohlin, Bengt Jonsson, Siavash Soleimanifard
Inferring Compact Models of Communication Protocol Entities. ISoLA (1) (2010)
Olga Grinchtein, Bengt Jonsson, Martin Leucker
Learning of event-recording automata. Theor. Comput. Sci. 411 (47) (2010)
Valérie Issarny, Bernhard Steffen, Bengt Jonsson, Gordon S. Blair, Paul Grace, Marta Z. Kwiatkowska, Radu Calinescu, Paola Inverardi, Massimo Tivoli, Antonia Bertolino, Antonino Sabetta
CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems. ICECCS (2009)
Bengt Jonsson
State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version). SIGARCH Comput. Archit. News 36 (5) (2008)
Mayank Saksena, Oskar Wibling, Bengt Jonsson
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. TACAS (2008)
Bengt Jonsson, Simon Perathoner, Lothar Thiele, Wang Yi
Cyclic dependencies in modular performance analysis. EMSOFT (2008)
Therese Berg, Bengt Jonsson, Harald Raffelt
Regular Inference for State Machines Using Domains with Equality Tests. FASE (2008)
Bengt Jonsson, Mayank Saksena
Systematic Acceleration in Regular Model Checking. CAV (2007)
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, Mayank Saksena
Proving Liveness by Backwards Reachability. CONCUR (2006)
Therese Berg, Bengt Jonsson, Harald Raffelt
Regular Inference for State Machines with Parameters. FASE (2006)
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
Inference of Event-Recording Automata Using Timed Decision Trees. CONCUR (2006)
Therese Berg, Bengt Jonsson, Martin Leucker, Mayank Saksena
Insights to Angluin's Learning. Electron. Notes Theor. Comput. Sci. 118 (2005)
Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
Simulating perfect channels with probabilistic lossy channels. Inf. Comput. 197 (1-2) (2005)
Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, Bernhard Steffen
On the Correspondence Between Conformance Testing and Regular Inference. FASE (2005)
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena
Regular Model Checking for LTL(MSO). CAV (2004)
Johan Blom, Anders Hessel, Bengt Jonsson, Paul Pettersson
Specifying and Generating Test Cases Using Observer Automata. FATES (2004)
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Mayank Saksena
A Survey of Regular Model Checking. CONCUR (2004)
Olga Grinchtein, Bengt Jonsson, Martin Leucker
Learning of Event-Recording Automata. FORMATS/FTRTFT (2004)
Parosh Aziz Abdulla, Aurore Collomb-Annichini, Ahmed Bouajjani, Bengt Jonsson
Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods Syst. Des. 25 (1) (2004)
Olga Grinchtein, Bengt Jonsson, Martin Leucker
Inference of Timed Transition Systems. INFINITY (2004)
Bengt Jonsson
Finite State Machines. Model-Based Testing of Reactive Systems (2004)
Parosh Aziz Abdulla, Bengt Jonsson
Model checking of systems with many identical timed processes. Theor. Comput. Sci. 290 (1) (2003)
Johan Blom, Bengt Jonsson
Automated test generation for industrial Erlang applications. Erlang Workshop (2003)
Bengt Jonsson, Konstantinos Sagonas
Preface by the section editors. Int. J. Softw. Tools Technol. Transf. 4 (4) (2003)
John Håkansson, Bengt Jonsson, Ola Lundqvist
Generating online test oracles from temporal logic specifications. Int. J. Softw. Tools Technol. Transf. 4 (4) (2003)
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
Algorithmic Improvements in Regular Model Checking. CAV (2003)
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
Regular Model Checking Made Simple and Efficient. CONCUR (2002)
Jakob Engblom, Bengt Jonsson
Processor Pipelines and Their Properties for Static WCET Analysis. EMSOFT (2002)
Bengt Jonsson, Wang Yi
Testing preorders for probabilistic processes can be characterized by simulations. Theor. Comput. Sci. 282 (1) (2002)

Bengt Jonsson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bengt Jonsson