Bengt Jonsson

Efficient Linearizability Monitoring

Abdulla, Parosh; Grahn, Samuel; Jonsson, Bengt; Krishna, Shankaranarayanan et al.

Ingår i Proceedings of the ACM on Programming Languages, s. 1937-1960, 2025

• DOI för Efficient Linearizability Monitoring
• Ladda ner fulltext (pdf) av Efficient Linearizability Monitoring

Awaiting for Godot: stateless model checking that avoids executions where nothing happens

Jonsson, Bengt; Lång, Magnus; Sagonas, Konstantinos

Ingår i Formal methods in system design, s. 71-105, 2025

• DOI för Awaiting for Godot: stateless model checking that avoids executions where nothing happens
• Ladda ner fulltext (pdf) av Awaiting for Godot: stateless model checking that avoids executions where nothing happens

Timing is All You Need

Graf, Susanne; Jonsson, Bengt; Khodabandeloo, Behnam; Huang, Chengzi et al.

Ingår i The Combined Power of Research, Education, and Dissemination, s. 259-279, Springer, 2025

• DOI för Timing is All You Need

Testing IoT Protocol Requirements Using Fuzzing and Symbolic Execution: Application to CoAP

Asadian, Hooman; Fiterău-Broştean, Paul; Jonsson, Bengt; Sagonas, Konstantinos

Ingår i 2024 IEEE Conference on Standards for Communications and Networking (CSCN), s. 48-54, 2024

• DOI för Testing IoT Protocol Requirements Using Fuzzing and Symbolic Execution: Application to CoAP

Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution

Asadian, Hooman; Fiterau-Brostean, Paul; Jonsson, Bengt; Sagonas, Konstantinos

Ingår i 19TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY, AND SECURITY, ARES 2024, 2024

• DOI för Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution

Efficient Linearizability Monitoring

Abdulla, Parosh; Grahn, Samuel; Jonsson, Bengt; Krishna, Shankaranarayanan et al.

Ingår i Proceedings of the ACM on Programming Languages, s. 1937-1960, 2025

• DOI för Efficient Linearizability Monitoring
• Ladda ner fulltext (pdf) av Efficient Linearizability Monitoring

Awaiting for Godot: stateless model checking that avoids executions where nothing happens

Jonsson, Bengt; Lång, Magnus; Sagonas, Konstantinos

Ingår i Formal methods in system design, s. 71-105, 2025

• DOI för Awaiting for Godot: stateless model checking that avoids executions where nothing happens
• Ladda ner fulltext (pdf) av Awaiting for Godot: stateless model checking that avoids executions where nothing happens

Lock-free Contention Adapting Search Trees

Winblad, Kjell; Sagonas, Konstantinos; Jonsson, Bengt

Ingår i ACM TRANSACTIONS ON PARALLEL COMPUTING, 2021

• DOI för Lock-free Contention Adapting Search Trees

Optimal stateless model checking for reads-from equivalence under sequential consistency

Abdulla, Parosh; Atig, Mohamed Faouzi; Jonsson, Bengt; Lång, Magnus et al.

Ingår i Proceedings of the ACM on Programming Languages, s. 1-29, 2019

• DOI för Optimal stateless model checking for reads-from equivalence under sequential consistency
• Ladda ner fulltext (pdf) av Optimal stateless model checking for reads-from equivalence under sequential consistency

Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores

Lindén, Jonatan; Bauer, Pavol; Engblom, Stefan; Jonsson, Bengt

Ingår i ACM Transactions on Modeling and Computer Simulation, 2019

• DOI för Exposing inter-process information for efficient PDES of spatial stochastic systems on multicores

Optimal Stateless Model Checking under the Release-Acquire Semantics

Abdulla, Parosh; Atig, Mohamed Faouzi; Jonsson, Bengt; Ngo, Tuan-Phong

Ingår i Proceedings of the ACM on Programming Languages, s. 1-29, 2018

• DOI för Optimal Stateless Model Checking under the Release-Acquire Semantics
• Ladda ner fulltext (pdf) av Optimal Stateless Model Checking under the Release-Acquire Semantics

An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures

Abdulla, Parosh; Haziza, Frédéric; Holík, Lukás; Jonsson, Bengt et al.

Ingår i International Journal on Software Tools for Technology Transfer, s. 549-563, 2017

• DOI för An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures

Stateless model checking for TSO and PSO

Abdulla, Parosh Aziz; Aronis, Stavros; Atig, Mohamed Faouzi; Jonsson, Bengt et al.

Ingår i Acta Informatica, s. 789-818, 2017

• DOI för Stateless model checking for TSO and PSO

Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction

Abdulla, Parosh; Aronis, Stavros; Jonsson, Bengt; Sagonas, Konstantinos

Ingår i Journal of the ACM, 2017

• DOI för Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction

Verification of heap manipulating programs with ordered data by extended forest automata

Abdulla, Parosh Aziz; Holík, Lukás; Jonsson, Bengt; Lengál, Ondrej et al.

Ingår i Acta Informatica, s. 357-385, 2016

• DOI för Verification of heap manipulating programs with ordered data by extended forest automata

Active learning for extended finite state machines

Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Steffen, Bernhard

Ingår i Formal Aspects of Computing, s. 233-263, 2016

• DOI för Active learning for extended finite state machines

A succinct canonical register automaton model

Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Merten, Maik et al.

Ingår i Journal of Logical and Algebraic Methods in Programming, s. 54-66, 2015

• DOI för A succinct canonical register automaton model

Generating models of infinite-state communication protocols using regular inference with abstraction

Aarts, Fides; Jonsson, Bengt; Uijen, Johan; Vaandrager, Frits

Ingår i Formal methods in system design, s. 1-41, 2015

• DOI för Generating models of infinite-state communication protocols using regular inference with abstraction

An algebraic theory of interface automata

Chilton, Chris; Jonsson, Bengt; Kwiatkowska, Marta

Ingår i Theoretical Computer Science, s. 146-174, 2014

• DOI för An algebraic theory of interface automata

Compositional assume–guarantee reasoning for input/output component theories

Chilton, Chris; Jonsson, Bengt; Kwiatkowska, Marta

Ingår i Science of Computer Programming, s. 115-137, 2014

• DOI för Compositional assume–guarantee reasoning for input/output component theories

Building timing predictable embedded systems

Axer, Philip; Ernst, Rolf; Falk, Heiko; Girault, Alain et al.

Ingår i ACM Transactions on Embedded Computing Systems, 2014

• DOI för Building timing predictable embedded systems

Regular model checking for LTL(MSO)

Abdulla, Parosh; Jonsson, Bengt; Nilsson, Marcus; d'Orso, Julien et al.

Ingår i International Journal on Software Tools for Technology Transfer, s. 223-241, 2012

• DOI för Regular model checking for LTL(MSO)

Using refinement calculus techniques to prove linearizability

Jonsson, Bengt

Ingår i Formal Aspects of Computing, s. 537-554, 2012

• DOI för Using refinement calculus techniques to prove linearizability

Learning of event-recording automata

Grinchtein, Olga; Jonsson, Bengt; Leucker, Martin

Ingår i Theoretical Computer Science, s. 4029-4054, 2010

• DOI för Learning of event-recording automata

State-space exploration for concurrent algorithms under weak memory orderings

Jonsson, Bengt

Ingår i SIGARCH Computer Architecture News, s. 65-71, 2008

• DOI för State-space exploration for concurrent algorithms under weak memory orderings

Simulating perfect channels with probabilistic lossy channels

Abdulla, Parosh; Baier, Christel; Iyer, S. Purushotaman; Jonsson, Bengt

Ingår i Information and Computation, s. 22-40, 2005

Insights to Angluin's Learning

Berg, Therese; Jonsson, Bengt; Leucker, Martin; Saksena, Mayank

Ingår i Electr. Notes on Theoret. Comput. Sci., s. 3-18, 2005

Using Forward Reachability Analysis for Verification of Lossy Channel Systems

Abdulla, Parosh Aziz; Collomb-Annichini, Aurore; Bouajjani, Ahmed; Jonsson, Bengt

Ingår i Formal methods in system design, s. 39-65, 2004

• DOI för Using Forward Reachability Analysis for Verification of Lossy Channel Systems

Model checking of systems with many identical timed processes

Abdulla, Parosh; Jonsson, Bengt

Ingår i Theoretical Computer Science, s. 241-264, 2003

• DOI för Model checking of systems with many identical timed processes

ASTEC: An Experience in the Establishment of Collaboration between Academia and Industry

Jonsson, Bengt; Sagonas, Konstantinos

Ingår i Springer International Journal on Software Tools for Technology Transfer, s. 401-404, 2003

Testing preorders for probabilistic processes can be characterized by simulations

Jonsson, Bengt; Yi, Wang

Ingår i Theoretical Computer Science, s. 33-51, 2002

Algorithmic analysis of programs with well quasi-ordered domains

Abdulla, PA; Cerans, K; Jonsson, B; Tsay, YK

Ingår i INFORMATION AND COMPUTATION, s. 109-127, 2000

Proving Refinement Using Transduction

Jonsson, Bengt; Pnueli, Amir; Rump, Camilla

Ingår i Distributed Computing, s. 129-150, 1999

Verifying programs with unreliable channels

Abdulla, PA; Jonsson, B

Ingår i Information and Computation, s. 91-101, 1996

• DOI för Verifying programs with unreliable channels

Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs

Jonsson, Bengt; Parrow, Joachim

Ingår i Information and Computation, s. 272-302, 1993

• DOI för Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs

Timing is All You Need

Graf, Susanne; Jonsson, Bengt; Khodabandeloo, Behnam; Huang, Chengzi et al.

Ingår i The Combined Power of Research, Education, and Dissemination, s. 259-279, Springer, 2025

• DOI för Timing is All You Need

Trading Space for Simplicity in Stateless Model Checking

Abdulla, Parosh; Atig, Mohamed Faouzi; Das, Sarbojit; Jonsson, Bengt et al.

Ingår i Real Time and Such, s. 79-97, Springer, 2024

• DOI för Trading Space for Simplicity in Stateless Model Checking

Consistency and Persistency in Program Verification: Challenges and Opportunities

Abdulla, Parosh; Atig, Mohamed Faouzi; Bouajjani, Ahmed; Jonsson, Bengt et al.

Ingår i Principles of Systems Design, s. 494-510, Springer, 2022

• DOI för Consistency and Persistency in Program Verification: Challenges and Opportunities

Comparing source sets and persistent sets for partial order reduction

Abdulla, Parosh; Aronis, Stavros; Jonsson, Bengt; Sagonas, Konstantinos

Ingår i Models, Algorithms, Logics and Tools, s. 516-536, Springer, 2017

• DOI för Comparing source sets and persistent sets for partial order reduction

Learning of automata models extended with data

Jonsson, Bengt

Ingår i Formal Methods for Eternal Networked Software Systems, s. 327-349, Springer Berlin/Heidelberg, 2011

• DOI för Learning of automata models extended with data

Probabilistic Extensions of Process Algebras

Jonsson, Bengt; Larsen, Kim; Yi, Wang

s. 685-710, ELSEVIER, 2001

On the existence of network invariants for verifying parameterized systems

Abdulla, Parosh; Jonsson, Bengt

Ingår i Correct System Design, s. 180-197, Springer-Verlag, Berlin, 1999

Testing IoT Protocol Requirements Using Fuzzing and Symbolic Execution: Application to CoAP

Asadian, Hooman; Fiterău-Broştean, Paul; Jonsson, Bengt; Sagonas, Konstantinos

Ingår i 2024 IEEE Conference on Standards for Communications and Networking (CSCN), s. 48-54, 2024

• DOI för Testing IoT Protocol Requirements Using Fuzzing and Symbolic Execution: Application to CoAP

Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution

Asadian, Hooman; Fiterau-Brostean, Paul; Jonsson, Bengt; Sagonas, Konstantinos

Ingår i 19TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY, AND SECURITY, ARES 2024, 2024

• DOI för Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution

Parsimonious Optimal Dynamic Partial Order Reduction

Abdulla, Parosh; Atig, Mohamed Faouzi; Das, Sarbojit; Jonsson, Bengt et al.

2024

• Ladda ner fulltext (pdf) av Parsimonious Optimal Dynamic Partial Order Reduction

Parsimonious Optimal Dynamic Partial Order Reduction

Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Das, Sarbojit; Jonsson, Bengt et al.

Ingår i COMPUTER AIDED VERIFICATION, PT II, CAV 2024, s. 19-43, 2024

• DOI för Parsimonious Optimal Dynamic Partial Order Reduction
• Ladda ner fulltext (pdf) av Parsimonious Optimal Dynamic Partial Order Reduction

SMBugFinder: An Automated Framework for Testing Protocol Implementations for State Machine Bugs

Fiterau-Brostean, Paul; Jonsson, Bengt; Sagonas, Konstantinos; Tåquist, Fredrik

Ingår i PROCEEDINGS OF THE 33RD ACM SIGSOFT INTERNATIONAL SYMPOSIUM ON SOFTWARE TESTING AND ANALYSIS, ISSTA 2024, s. 1866-1870, 2024

• DOI för SMBugFinder: An Automated Framework for Testing Protocol Implementations for State Machine Bugs

Scalable Tree-based Register Automata Learning

Dierl, Simon; Fiterau-Brostean, Paul; Howar, Falk; Jonsson, Bengt et al.

Ingår i Tools and Algorithms for the Construction and Analysis of Systems, s. 87-108, 2024

• DOI för Scalable Tree-based Register Automata Learning
• Ladda ner fulltext (pdf) av Scalable Tree-based Register Automata Learning

CONCUR Test-Of-Time Award 2023

Jonsson, Bengt; Kwiatkowska, Marta; Walukiewicz, Igor

Ingår i 34th International Conference on Concurrency Theory (CONCUR 2023), 2023

• DOI för CONCUR Test-Of-Time Award 2023
• Ladda ner fulltext (pdf) av CONCUR Test-Of-Time Award 2023

Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs

Abdulla, Parosh; Atig, Mohamed Faouzi; Meyer Bønneland, Frederik; Das, Sarbojit et al.

Ingår i Automated Technology for Verification and Analysis, s. 176-198, 2023

• DOI för Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs
• Ladda ner fulltext (pdf) av Tailoring Stateless Model Checking for Event-Driven Multi-threaded Programs

An Active Learning Approach to Synthesizing Program Contracts

Ghosal, Sandip; Jonsson, Bengt; Rümmer, Philipp

Ingår i Software Engineering and Formal Methods, SEFM 2023, s. 126-144, 2023

• DOI för An Active Learning Approach to Synthesizing Program Contracts

An Active Learning Approach to Synthesizing Program Contracts

Ghosal, Sandip; Jonsson, Bengt; Rümmer, Philipp

2023

Applying Symbolic Execution to Test Implementations of a Network Protocol Against its Specification

Asadian, Hooman; Fiterau-Brostean, Paul; Jonsson, Bengt; Sagonas, Konstantinos

Ingår i 2022 IEEE 15TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST 2022), s. 70-81, 2022

• DOI för Applying Symbolic Execution to Test Implementations of a Network Protocol Against its Specification

Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens

Jonsson, Bengt; Lång, Magnus; Sagonas, Konstantinos

Ingår i 2022 Formal Methods in Computer-Aided Design (FMCAD), s. 284-293, 2022

• DOI för Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens
• Ladda ner fulltext (pdf) av Awaiting for Godot: Stateless Model Checking that Avoids Executions where Nothing Happens

DTLS-Fuzzer: A DTLS Protocol State Fuzzer

Fiterau-Brostean, Paul; Jonsson, Bengt; Sagonas, Konstantinos; Tåquist, Fredrik

Ingår i 2022 IEEE 15th International Conference on Software Testing, Verification and Validation (ICST 2022), s. 456-458, 2022

• DOI för DTLS-Fuzzer: A DTLS Protocol State Fuzzer

Analysis of DTLS Implementations Using Protocol State Fuzzing

Fiterau-Brostean, Paul; Jonsson, Bengt; Merget, Robert; de Ruiter, Joeri et al.

Ingår i Proceedings of the 29th USENIX Security Symposium, s. 2523-2540, 2020

• Ladda ner fulltext (pdf) av Analysis of DTLS Implementations Using Protocol State Fuzzing

Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial)

Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Jonsson, Bengt; Ngo, Tuan-Phong

Ingår i Networked Systems, s. 3-18, 2019

• DOI för Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial)

Optimal dynamic partial order reduction with observers

Aronis, Stavros; Jonsson, Bengt; Lång, Magnus; Sagonas, Konstantinos

Ingår i Tools and Algorithms for the Construction and Analysis of Systems, s. 229-248, 2018

• DOI för Optimal dynamic partial order reduction with observers
• Ladda ner fulltext (pdf) av Optimal dynamic partial order reduction with observers

Optimal Stateless Model Checking under the Release-Acquire Semantics

Abdulla, Parosh; Atig, Mohamed Faouzi; Jonsson, Bengt; Ngo, Tuan-Phong

Ingår i SPLASH OOPSLA 2018, Boston, Nov 4-9, 2018, 2018

• DOI för Optimal Stateless Model Checking under the Release-Acquire Semantics

Fragment abstraction for concurrent shape analysis

Abdulla, Parosh Aziz; Jonsson, Bengt; Trinh, Cong Quy

Ingår i Programming Languages and Systems, s. 442-471, 2018

• DOI för Fragment abstraction for concurrent shape analysis

Lock-free Contention Adapting Search Trees

Winblad, Kjell; Sagonas, Konstantinos; Jonsson, Bengt

Ingår i The 30th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, 2018

• DOI för Lock-free Contention Adapting Search Trees

Fine-grained local dynamic load balancing in PDES

Lindén, Jonatan; Bauer, Pavol; Engblom, Stefan; Jonsson, Bengt

Ingår i Proc. 6th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, s. 201-212, 2018

• DOI för Fine-grained local dynamic load balancing in PDES

The Quest for Optimality in Stateless Model Checking of Concurrent Programs

Jonsson, Bengt

Ingår i Formal Methods For Industrial Critical Systems, FMICS 2018, 2018

Extending Automata Learning to Extended Finite State Machines

Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Steffen, Bernhard

Ingår i Machine Learning for Dynamic Software Analysis, s. 149-177, 2018

• DOI för Extending Automata Learning to Extended Finite State Machines

Exposing inter-process information for efficient parallel discrete event simulation of spatial stochastic systems

Lindén, Jonatan; Bauer, Pavol; Engblom, Stefan; Jonsson, Bengt

Ingår i Proc. 5th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, s. 53-64, 2017

• DOI för Exposing inter-process information for efficient parallel discrete event simulation of spatial stochastic systems

Automated Verification of Linearization Policies

Abdulla, Parosh; Jonsson, Bengt; Trinh, Cong Quy

Ingår i Automated Verification of Linearization Policies, 2016

• DOI för Automated Verification of Linearization Policies

Stateless model checking for POWER

Abdulla, Parosh Aziz; Atig, Mohamed Faouzi; Jonsson, Bengt; Leonardsson, Carl

Ingår i Computer Aided Verification, s. 134-156, 2016

• DOI för Stateless model checking for POWER

Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing

Blom, Johan; Jonsson, Bengt; Nyström, Sven-Olof

2016

• DOI för Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing

Efficient inter-process synchronization for parallel discrete event simulation on multicores

Bauer, Pavol; Lindén, Jonatan; Engblom, Stefan; Jonsson, Bengt

Ingår i Proc. 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, s. 183-194, 2015

• DOI för Efficient inter-process synchronization for parallel discrete event simulation on multicores

Stateless model checking for TSO and PSO

Abdulla, Parosh Aziz; Aronis, Stavros; Atig, Mohamed Faouzi; Jonsson, Bengt et al.

Ingår i Tools and Algorithms for the Construction and Analysis of Systems, s. 353-367, 2015

• DOI för Stateless model checking for TSO and PSO

Mediator synthesis in a component algebra with data

Holik, Lukás; Isberner, Malte; Jonsson, Bengt

Ingår i Correct System Design, s. 238-259, 2015

• DOI för Mediator synthesis in a component algebra with data

RALib: A LearnLib extension for inferring EFSMs

Cassel, Sofia; Falk, Howar; Jonsson, Bengt

2015

A Modeling Framework for Reuse Distance-based Estimation of Cache Performance

Pan, Xiaoyue; Jonsson, Bengt

Ingår i Performance Analysis of Systems and Software (ISPASS), 2015 IEEE International Symposium on, s. 62-71, 2015

• DOI för A Modeling Framework for Reuse Distance-based Estimation of Cache Performance

Learning Extended Finite State Machines

Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Steffen, Bernhard

Ingår i Software Engineering and Formal Methods.  12th International Conference, SEFM 2014, s. 250-264, 2014

• DOI för Learning Extended Finite State Machines

A constraint programming approach for managing end-to-end requirements in sensor network macroprogramming

Hassani Bijarbooneh, Farshid; Pathak, Animesh; Pearson, Justin; Issarny, Valérie et al.

Ingår i Proc. 3rd International Conference on Sensor Networks, s. 28-40, 2014

• DOI för A constraint programming approach for managing end-to-end requirements in sensor network macroprogramming

Optimal dynamic partial order reduction

Abdulla, Parosh; Aronis, Stavros; Jonsson, Bengt; Sagonas, Konstantinos

Ingår i Proc. 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, s. 373-384, 2014

• DOI för Optimal dynamic partial order reduction

Modeling cache coherence misses on multicores

Pan, Xiaoyue; Jonsson, Bengt

Ingår i 2014 IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE (ISPASS), s. 96-105, 2014

• DOI för Modeling cache coherence misses on multicores

An Integrated Specification and Verification Technique for Highly Concurrent Data Structures

Abdulla, Parosh Aziz; Haziza, Frédéric; Holik, Lukas; Jonsson, Bengt et al.

Ingår i Tools and Algorithms for the Construction and Analysis of Systems, 2013

• Ladda ner fulltext (pdf) av An Integrated Specification and Verification Technique for Highly Concurrent Data Structures

Verification of heap manipulating programs with ordered data by extended forest automata

Abdulla, Parosh Aziz; Holík, Lukás; Jonsson, Bengt; Lengál, Ondrej et al.

Ingår i Automated Technology for Verification and Analysis, s. 224-239, 2013

• DOI för Verification of heap manipulating programs with ordered data by extended forest automata
• Ladda ner fulltext (pdf) av Verification of heap manipulating programs with ordered data by extended forest automata

A Skiplist-based Concurrent Priority Queue with Minimal Memory Contention

Lindén, Jonatan; Jonsson, Bengt

Ingår i OPODIS 2013: 17th International Conference On Principles Of DIstributed Systems, s. 206-220, 2013

• DOI för A Skiplist-based Concurrent Priority Queue with Minimal Memory Contention

Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning

Benaceur, Amel; Chilton, Chris; Isberner, Malte; Jonsson, Bengt

Ingår i SEFM 2013, 11th Int. Conf. on Software Engineering and Formal Methods, s. 274-288, 2013

• DOI för Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning

Assume-guarantee reasoning for safe component behaviours

Chilton, C.; Jonsson, Bengt; Kwiatkowska, M.

Ingår i Formal Aspects of Component Software, s. 92-109, 2013

• DOI för Assume-guarantee reasoning for safe component behaviours

Inferring Canonical Register Automata

Howar, Falk; Steffen, Bernhard; Jonsson, Bengt; Cassel, Sofia

Ingår i Verification, Model Checking, and Abstract Interpretation - 13th International Conference,, s. 251-266, 2012

• DOI för Inferring Canonical Register Automata

Demonstrating Learning of Register Automata

Merten, Maik; Howar, Falk; Steffen, Bernhard; Cassel, Sofia et al.

Ingår i Tools and Algorithms for the Construction and Analysis of Systems - 18th International Conference,, s. 466-471, 2012

• DOI för Demonstrating Learning of Register Automata

Inferring semantic interfaces of data structures

Howar, F.; Isberner, M.; Steffen, B.; Bauer, O. et al.

Ingår i Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, s. 554-571, 2012

• DOI för Inferring semantic interfaces of data structures

A succinct canonical register automaton model for data domains with binary relations

Cassel, Sofia; Jonsson, Bengt; Howar, F.; Steffen, B.

Ingår i Automated Technology for Verification and Analysis, s. 57-71, 2012

• DOI för A succinct canonical register automaton model for data domains with binary relations

A Compositional Specification Theory for Component Behaviours

Chen, Taolue; Chilton, Chris; Jonsson, Bengt; Kwiatkowska, Marta

Ingår i Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012,, s. 148-168, 2012

• DOI för A Compositional Specification Theory for Component Behaviours

Predicting the Cost of Lock Contention in Parallel Applications on Multicores using Analytic Modeling

Pan, Xiaoyue; Lindén, Jonatan; Jonsson, Bengt

Ingår i Proc. 5th Swedish Workshop on Multi-Core Computing, 2012

Assume-Guarantee Reasoning for Safe Component Behaviours

Chilton, Chris; Jonsson, Bengt; Kwiatkowska, Marta

Ingår i Proc. FACS: Formal Aspects of Component Software, 9th Int. Symp., s. 92-109, 2012

• DOI för Assume-Guarantee Reasoning for Safe Component Behaviours

A succinct canonical register automaton model

Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Merten, Maik et al.

Ingår i Automated Technology for Verification and Analysis, s. 366-380, 2011

• DOI för A succinct canonical register automaton model

Inferring Compact Models of Communication Protocol Entities

Bohlin, Therese; Jonsson, Bengt; Soleimanifard, Siavash

Ingår i Leveraging Applications of Formal Methods, Verification, and Validation, s. 658-672, 2010

• DOI för Inferring Compact Models of Communication Protocol Entities

Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction

Aarts, Fides; Jonsson, Bengt; Uijen, Johan

Ingår i Testing Software and Systems, s. 188-204, 2010

• DOI för Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction

On Handling Data in Automata Learning: Considerations from the CONNECT Perspective

Howar, Falk; Jonsson, Bengt; Merten, Maik; Steffen, Bernhard et al.

Ingår i Leveraging Applications of Formal Methods, Verification, and Validation, s. 221-235, 2010

• DOI för On Handling Data in Automata Learning: Considerations from the CONNECT Perspective

CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems

Issarny, Valérie; Steffen, Bernhard; Jonsson, Bengt; Blair, Gordon et al.

Ingår i Proc. 14th International Conference on Engineering of Complex Computer Systems, s. 154-161, 2009

• DOI för CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems

Using SPIN to model check concurrent algorithms, using a translation from C to Promela

Jiang, Ke; Jonsson, Bengt

Ingår i Proc. 2nd Swedish Workshop on Multi-Core Computing, s. 67-69, 2009

• Ladda ner fulltext (pdf) av Using SPIN to model check concurrent algorithms, using a translation from C to Promela

Cyclic dependencies in modular performance analysis

Jonsson, Bengt; Perathoner, Simon; Thiele, Lothar; Yi, Wang

Ingår i Proc. 8th ACM International Conference on Embedded Software, s. 179-188, 2008

• DOI för Cyclic dependencies in modular performance analysis

Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols

Saksena, Mayank; Wibling, Oskar; Jonsson, Bengt

Ingår i Tools and Algorithms for the Construction and Analysis of Systems, s. 18-32, 2008

• DOI för Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols

State-Space Exploration for Concurrent Algorithms under Weak Memory Orderings

Jonsson, Bengt

Ingår i Proc. 1st Swedish Workshop on Multi-Core Computing, s. 82-88, 2008

Regular Inference for State Machines Using Domains with Equality Tests

Berg, Therese; Jonsson, Bengt; Raffelt, Harald

Ingår i Fundamental Approaches to Software Engineering, s. 317-331, 2008

• DOI för Regular Inference for State Machines Using Domains with Equality Tests

Systematic Acceleration in Regular Model Checking

Jonsson, Bengt; Saksena, Mayank

Ingår i Computer Aided Verification, s. 131-144, 2007

• DOI för Systematic Acceleration in Regular Model Checking

Regular Inference for State Machines with Parameters.

Berg, Therese; Jonsson, Bengt; Raffelt, Harald

Ingår i Fundamental Approaches to Software Engineering, 9th International Conference, FASE 2006,, s. 107-121, 2006

Proving Liveness by Backwards Reachability

Abdulla, Parosh Aziz; Jonsson, Bengt; Rezine, Ahmed; Saksena, Mayank

2006

Inference of Event-Recording Automata using Timed Decision Trees

Grinchtein, Olga; Jonsson, Bengt; Pettersson, Paul

Ingår i International Conference on Concurrency Theory, 2006

Specifying and Generating Test Cases Using Observer Automata

Blom, Johan; Hessel, Anders; Jonsson, Bengt; Pettersson, Paul

Ingår i Formal Approaches to Software Testing, s. 125-139, 2005

• DOI för Specifying and Generating Test Cases Using Observer Automata

Inference of Timed Transition Systems

Grinchtein, Olga; Leucker, Martin; Jonsson, Bengt

Ingår i Proceedings of the 6th International Workshop on Verification of Infinite-State Systems (INFINITY), 2005

On the Correspondence Between Conformance Testing and Regular Inference

Berg, Therese; Grinchtein, Olga; Jonsson, Bengt; Leucker, Martin et al.

Ingår i FASE 2005, s. 175-189, 2005

Learning of event-recording automata

Grinchtein, Olga; Jonsson, Bengt; Leucker, Martin

Ingår i FORMATS/FTRTFT 2004, s. 379-396, 2004

• DOI för Learning of event-recording automata

Specifying and Generating Test Cases Using Observer Automata

Blom, Johan; Hessel, Anders; Jonsson, Bengt; Pettersson, Paul

Ingår i Proceedings of the 4th International Workshop on Formal Approaches to Testing of Software, s. 125-139, 2004

• DOI för Specifying and Generating Test Cases Using Observer Automata

Regular Model Checking for LTL(MSO)

Abdulla, Parosh; Jonsson, Bengt; Nilsson, Marcus; d'Orso, Julien et al.

Ingår i Computer Aided Verification, s. 348-360, 2004

A Survey of Regular Model Checking.

Abdulla, Parosh; Jonsson, Bengt; Nilsson, Marcus; Saksena, Mayank

Ingår i CONCUR 2004 - Concurrency Theory, s. 35-48, 2004

Report on Dataflow Dependencies in Billing Processing Systems

Abdulla, Parosh; Ben Henda, Noomene; Deneux, Johann; Jonsson, Bengt et al.

Ingår i Proc. ISoLA '04: 1st International Symposium on Leveraging Applications of Formal Methods, 2004

Extracting the Process Structure of Erlang Applications

Nyström, J; Jonsson, B

Ingår i Erlang Workshop, Firenze, Sept. 2, 2002

Extracting the process structure of Erlang applications

Nystrom, Jan; Jonsson, Bengt

Ingår i Proc. Erlang Workshop, Firenze, Italy, 2001

Regular Model Checking

Bouajjani, A; Jonsson, B; Nilsson, M; Touili, T

Ingår i Proc. 12th Int. Conf. on Computer Aided Verification, 2000

Fully Abstract Characterization of Probabilistic May Testin

Jonsson, Bengt; Wang, Yi

1999

Verifying networks of timed processes

Abdulla, Parosh Aziz; Jonsson, Bengt

Ingår i Tools and Algorithms for the Construction and Analysis of Systems, s. 298-312, 1998

• DOI för Verifying networks of timed processes

A general approach to partial order reductions in symbolic verification

Abdulla, Parosh Aziz; Jonsson, Bengt; Kindahl, Mats; Peled, D

Ingår i Computer Aided Verification, s. 379-390, 1998

• DOI för A general approach to partial order reductions in symbolic verification

Undecidable verification problems for programs with unreliable channels

Abdulla, Parosh Aziz; Jonsson, Bengt

Ingår i Automata, Languages and Programming, s. 71-90, 1996

• DOI för Undecidable verification problems for programs with unreliable channels

Automata-Based Automated Detection of State Machine Bugs in Protocol Implementations

Fiterau-Brostean, Paul; Jonsson, Bengt; Sagonas, Konstantinos; Tåquist, Fredrik

Ingår i Proc. 30th Annual Network and Distributed System Security Symposium, NDSS

• DOI för Automata-Based Automated Detection of State Machine Bugs in Protocol Implementations

Uncovering Flaws in Network Protocol Implementations Using Differential Symbolic Execution

Asadian, Hooman; Fiterau-Brostean, Paul; Jonsson, Bengt; Sagonas, Konstantinos

Model-Based Testing of Reactive Systems, Advanced Lectures: outcome of a research seminar

Broy, Manfred; Jonsson, Bengt; Katoen, Joost-Pieter; Leucker, Martin et al.

2005

A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention

Lindén, Jonatan; Jonsson, Bengt

2018

• Ladda ner fulltext (pdf) av A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention

A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention

Lindén, Jonatan; Jonsson, Bengt

2018

• Ladda ner fulltext (pdf) av A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention

Active Learning for Extended Finite State Machines

Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Steffen, Bernhard

2015

• Ladda ner fulltext (pdf) av Active Learning for Extended Finite State Machines

Learning Extended Finite State Machines (extended version)

Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Steffen, Bernhard

2015

Forecasting Lock Contention Before Adopting Another Lock Algorithm

Pan, Xiaoyue; Klaftenegger, David; Jonsson, Bengt

2015

• Ladda ner fulltext (pdf) av Forecasting Lock Contention Before Adopting Another Lock Algorithm

An Algebraic Theory of Interface Automata

Chilton, Chris; Jonsson, Bengt; Kwiatkowska, Marta

2013

A Compositional Specification Theory for Component Behaviours

Chen, Taolue; Chilton, Chris; Jonsson, Bengt; Kwiatkowska, Marta

2012

Regular Inference for Communication Protocol Entities

Bohlin, Therese; Jonsson, Bengt

2008

• Ladda ner fulltext (pdf) av Regular Inference for Communication Protocol Entities

Learning of Event-Recording Automata

Grinchtein, Olga; Jonsson, Bengt; Leucker, Martin

2008

• Ladda ner fulltext (pdf) av Learning of Event-Recording Automata

Inference of Event-Recording Automata using Timed Decision Trees

Grinchtein, Olga; Jonsson, Bengt

2008

• Ladda ner fulltext (pdf) av Inference of Event-Recording Automata using Timed Decision Trees

Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols: (Extended Version)

Saksena, Mayank; Wibling, Oskar; Jonsson, Bengt

2007

Insights to Angluin's Learning

Berg, Therese; Jonsson, Bengt; Leucker, Martin; Saksena, Mayank

2003