Bengt Jonsson

According to our database, Bengt Jonsson authored at least 147 papers between 1985 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Scalable Tree-based Register Automata Learning.

Simon Dierl, Paul Fiterau-Brostean, Falk Howar, Bengt Jonsson, Konstantinos Sagonas, Fredrik Tåquist

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

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

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

Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis, 2024

Parsimonious Optimal Dynamic Partial Order Reduction.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das, Bengt Jonsson, Konstantinos Sagonas

Proceedings of the Computer Aided Verification - 36th International Conference, 2024

Monitor-based Testing of Network Protocol Implementations Using Symbolic Execution.

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

Proceedings of the 19th International Conference on Availability, Reliability and Security, 2024

2023

An Active Learning Approach to Synthesizing Program Contracts.

Sandip Ghosal, Bengt Jonsson, Philipp Rümmer

Proceedings of the Software Engineering and Formal Methods - 21st International Conference, 2023

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

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

Proceedings of the 30th Annual Network and Distributed System Security Symposium, 2023

CONCUR Test-Of-Time Award 2023 (Invited Paper).

Bengt Jonsson, Marta Kwiatkowska, Igor Walukiewicz

Proceedings of the 34th International Conference on Concurrency Theory, 2023

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

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Frederik Meyer Bønneland, Sarbojit Das, Bengt Jonsson, Magnus Lång, Konstantinos Sagonas

Proceedings of the Automated Technology for Verification and Analysis, 2023

2022

DTLS-Fuzzer: A DTLS Protocol State Fuzzer.

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

Proceedings of the 15th IEEE Conference on Software Testing, Verification and Validation, 2022

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

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

Proceedings of the 15th IEEE Conference on Software Testing, Verification and Validation, 2022

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

Bengt Jonsson, Magnus Lång, Konstantinos Sagonas

Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

Consistency and Persistency in Program Verification: Challenges and Opportunities.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmed Bouajjani, Bengt Jonsson, K. Narayan Kumar, Prakash Saivasan

Proceedings of the Principles of Systems Design, 2022

2021

Lock-free Contention Adapting Search Trees.

Kjell Winblad, Konstantinos Sagonas, Bengt Jonsson

ACM Trans. Parallel Comput., 2021

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, Ahmed Rezine

Int. J. Softw. Tools Technol. Transf., 2021

2020

Analysis of DTLS Implementations Using Protocol State Fuzzing.

Paul Fiterau-Brostean, Bengt Jonsson, Robert Merget, Joeri de Ruiter, Konstantinos Sagonas, Juraj Somorovsky

Proceedings of the 29th USENIX Security Symposium, 2020

2019

Optimal Stateless Model Checking for Reads-From Equivalence under Sequential Consistency.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan Phong Ngo, Konstantinos Sagonas

Dataset, October, 2019

Combining Black-Box and White-Box Techniques for Learning Register Automata.

Falk Howar, Bengt Jonsson, Frits W. Vaandrager

Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

Exposing Inter-process Information for Efficient PDES of Spatial Stochastic Systems on Multicores.

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

ACM Trans. Model. Comput. Simul., 2019

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

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bengt Jonsson, Magnus Lång, Tuan Phong Ngo, Konstantinos Sagonas

Proc. ACM Program. Lang., 2019

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

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

Proceedings of the Networked Systems - 7th International Conference, 2019

2018

Optimal stateless model checking under the release-acquire semantics.

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

Proc. ACM Program. Lang., 2018

Optimal Dynamic Partial Order Reduction with Observers.

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

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Fine-Grained Local Dynamic Load Balancing in PDES.

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

Proceedings of the 2018 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, 2018

Fragment Abstraction for Concurrent Shape Analysis.

Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh

Proceedings of the Programming Languages and Systems, 2018

Extending Automata Learning to Extended Finite State Machines.

Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen

Proceedings of the Machine Learning for Dynamic Software Analysis: Potentials and Limits, 2018

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, Ahmed Rezine

Int. J. Softw. Tools Technol. Transf., 2017

Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction.

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

J. ACM, 2017

Stateless model checking for TSO and PSO.

Parosh Aziz Abdulla, Stavros Aronis, Mohamed Faouzi Atig, Bengt Jonsson, Carl Leonardsson, Konstantinos Sagonas

Acta Informatica, 2017

Exposing Inter-Process Information for Efficient Parallel Discrete Event Simulation of Spatial Stochastic Systems.

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

Proceedings of the 2017 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, 2017

Comparing Source Sets and Persistent Sets for Partial Order Reduction.

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

Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016

Active learning for extended finite state machines.

Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen

Formal Aspects Comput., 2016

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

Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar

Acta Informatica, 2016

Automated Verification of Linearization Policies.

Parosh Aziz Abdulla, Bengt Jonsson, Cong Quy Trinh

Proceedings of the Static Analysis - 23rd International Symposium, 2016

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

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

Proceedings of the Ninth IEEE International Conference on Software Testing, 2016

Stateless Model Checking for POWER.

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

Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015

A succinct canonical register automaton model.

Sofia Cassel, Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen

J. Log. Algebraic Methods Program., 2015

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

Fides Aarts, Bengt Jonsson, Johan Uijen, Frits W. Vaandrager

Formal Methods Syst. Des., 2015

Efficient Inter-Process Synchronization for Parallel Discrete Event Simulation on Multicores.

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

Proceedings of the 3rd ACM Conference on SIGSIM-Principles of Advanced Discrete Simulation, London, United Kingdom, June 10, 2015

A modeling framework for reuse distance-based estimation of cache performance.

Xiaoyue Pan, Bengt Jonsson

Proceedings of the 2015 IEEE International Symposium on Performance Analysis of Systems and Software, 2015

Mediator Synthesis in a Component Algebra with Data.

Lukás Holík, Malte Isberner, Bengt Jonsson

Proceedings of the Correct System Design, 2015

2014

Building timing predictable embedded systems.

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

ACM Trans. Embed. Comput. Syst., 2014

An algebraic theory of interface automata.

Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska

Theor. Comput. Sci., 2014

Compositional assume-guarantee reasoning for input/output component theories.

Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska

Sci. Comput. Program., 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

Proceedings of the SENSORNETS 2014 - Proceedings of the 3rd International Conference on Sensor Networks, Lisbon, Portugal, 7, 2014

Learning Extended Finite State Machines.

Sofia Cassel, Falk Howar, Bengt Jonsson, Bernhard Steffen

Proceedings of the Software Engineering and Formal Methods - 12th International Conference, 2014

Optimal dynamic partial order reduction.

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

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Modeling cache coherence misses on multicores.

Xiaoyue Pan, Bengt Jonsson

Proceedings of the 2014 IEEE International Symposium on Performance Analysis of Systems and Software, 2014

2013

Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning.

Amel Bennaceur, Chris Chilton, Malte Isberner, Bengt Jonsson

Proceedings of the Software Engineering and Formal Methods - 11th International Conference, 2013

A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention.

Jonatan Lindén, Bengt Jonsson

Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

2012

Regular model checking for LTL(MSO).

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso, Mayank Saksena

Int. J. Softw. Tools Technol. Transf., 2012

Using refinement calculus techniques to prove linearizability.

Bengt Jonsson

Formal Aspects Comput., 2012

Inferring Canonical Register Automata.

Falk Howar, Bernhard Steffen, Bengt Jonsson, Sofia Cassel

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

Demonstrating Learning of Register Automata.

Maik Merten, Falk Howar, Bernhard Steffen, Sofia Cassel, Bengt Jonsson

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Inferring Semantic Interfaces of Data Structures.

Falk Howar, Malte Isberner, Bernhard Steffen, Oliver Bauer, Bengt Jonsson

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2012

Assume-Guarantee Reasoning for Safe Component Behaviours.

Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska

Proceedings of the Formal Aspects of Component Software, 9th International Symposium, 2012

A Compositional Specification Theory for Component Behaviours.

Taolue Chen, Chris Chilton, Bengt Jonsson, Marta Z. Kwiatkowska

Proceedings of the Programming Languages and Systems, 2012

A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations.

Sofia Cassel, Bengt Jonsson, Falk Howar, Bernhard Steffen

Proceedings of the Automated Technology for Verification and Analysis, 2012

2011

Learning of Automata Models Extended with Data.

Bengt Jonsson

Proceedings of the Formal Methods for Eternal Networked Software Systems, 2011

2010

Learning of event-recording automata.

Olga Grinchtein, Bengt Jonsson, Martin Leucker

Theor. Comput. Sci., 2010

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

Fides Aarts, Bengt Jonsson, Johan Uijen

Proceedings of the Testing Software and Systems, 2010

On Handling Data in Automata Learning - Considerations from the CONNECT Perspective.

Falk Howar, Bengt Jonsson, Maik Merten, Bernhard Steffen, Sofia Cassel

Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

Inferring Compact Models of Communication Protocol Entities.

Therese Bohlin, Bengt Jonsson, Siavash Soleimanifard

Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

10051 Executive Summary - Quantitative and Qualitative Analysis of Network Protocols.

Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska

Proceedings of the Quantitative and Qualitative Analysis of Network Protocols, 31.01., 2010

10051 Abstracts Collection - Quantitative and Qualitative Analysis of Network Protocols.

Bengt Jonsson, Jörg Kreiker, Marta Z. Kwiatkowska

Proceedings of the Quantitative and Qualitative Analysis of Network Protocols, 31.01., 2010

2009

CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems.

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

Proceedings of the 14th IEEE International Conference on Engineering of Complex Computer Systems, 2009

2008

State-space exploration for concurrent algorithms under weak memory orderings: (preliminary version).

Bengt Jonsson

SIGARCH Comput. Archit. News, 2008

Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols.

Mayank Saksena, Oskar Wibling, Bengt Jonsson

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Regular Inference for State Machines Using Domains with Equality Tests.

Therese Berg, Bengt Jonsson, Harald Raffelt

Proceedings of the Fundamental Approaches to Software Engineering, 2008

Cyclic dependencies in modular performance analysis.

Bengt Jonsson, Simon Perathoner, Lothar Thiele, Wang Yi

Proceedings of the 8th ACM & IEEE International conference on Embedded software, 2008

2007

Systematic Acceleration in Regular Model Checking.

Bengt Jonsson, Mayank Saksena

Proceedings of the Computer Aided Verification, 19th International Conference, 2007

2006

Regular Inference for State Machines with Parameters.

Therese Berg, Bengt Jonsson, Harald Raffelt

Proceedings of the Fundamental Approaches to Software Engineering, 2006

Inference of Event-Recording Automata Using Timed Decision Trees.

Olga Grinchtein, Bengt Jonsson, Paul Pettersson

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Proving Liveness by Backwards Reachability.

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

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005

Simulating perfect channels with probabilistic lossy channels.

Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson

Inf. Comput., 2005

On the Correspondence Between Conformance Testing and Regular Inference.

Therese Berg, Olga Grinchtein, Bengt Jonsson, Martin Leucker, Harald Raffelt, Bernhard Steffen

Proceedings of the Fundamental Approaches to Software Engineering, 2005

2004

Using Forward Reachability Analysis for Verification of Lossy Channel Systems.

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

Formal Methods Syst. Des., 2004

Inference of Timed Transition Systems.

Olga Grinchtein, Bengt Jonsson, Martin Leucker

Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

Specifying and Generating Test Cases Using Observer Automata.

Johan Blom, Anders Hessel, Bengt Jonsson, Paul Pettersson

Proceedings of the Formal Approaches to Software Testing, 4th International Workshop, 2004

Finite State Machines.

Bengt Jonsson

Proceedings of the Model-Based Testing of Reactive Systems, 2004

A Survey of Regular Model Checking.

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

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003

Model checking of systems with many identical timed processes.

Parosh Aziz Abdulla, Bengt Jonsson

Theor. Comput. Sci., 2003

Preface by the section editors.

Bengt Jonsson, Konstantinos Sagonas

Int. J. Softw. Tools Technol. Transf., 2003

Generating online test oracles from temporal logic specifications.

John Håkansson, Bengt Jonsson, Ola Lundqvist

Int. J. Softw. Tools Technol. Transf., 2003

Insights to Angluin's Learning.

Therese Berg, Bengt Jonsson, Martin Leucker, Mayank Saksena

Proceedings of the International Workshop on Software Verification and Validation, 2003

Automated test generation for industrial Erlang applications.

Johan Blom, Bengt Jonsson

Proceedings of the 2003 ACM SIGPLAN Workshop on Erlang, Uppsala, Sweden, August 29, 2003, 2003

Algorithmic Improvements in Regular Model Checking.

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso

Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002

Testing preorders for probabilistic processes can be characterized by simulations.

Bengt Jonsson, Wang Yi

Theor. Comput. Sci., 2002

Eliminating Queues from RT UML Model Representations.

Werner Damm, Bengt Jonsson

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002

Processor Pipelines and Their Properties for Static WCET Analysis.

Jakob Engblom, Bengt Jonsson

Proceedings of the Embedded Software, Second International Conference, 2002

Regular Model Checking Made Simple and Efficient.

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso

Proceedings of the CONCUR 2002, 2002

Regular Tree Model Checking.

Parosh Aziz Abdulla, Bengt Jonsson, Pritha Mahata, Julien d'Orso

Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001

Ensuring completeness of symbolic verification methods for infinite-state systems.

Parosh Aziz Abdulla, Bengt Jonsson

Theor. Comput. Sci., 2001

Incremental Requirement Specification for Evolving Systems.

Bengt Jonsson, Tiziana Margaria, Gustaf Naeser, Jan Nyström, Bernhard Steffen

Nord. J. Comput., 2001

An Execution Semantics for MSC-2000.

Bengt Jonsson, Gerardo Padilla

Proceedings of the SDL 2001: Meeting UML, 2001

Channel Representations in Protocol Verification.

Parosh Aziz Abdulla, Bengt Jonsson

Proceedings of the CONCUR 2001, 2001

Probabilistic Extensions of Process Algebras.

Bengt Jonsson, Wang Yi, Kim G. Larsen

Proceedings of the Handbook of Process Algebra, 2001

2000

Algorithmic Analysis of Programs with Well Quasi-ordered Domains.

Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay

Inf. Comput., 2000

Transitive Closures of Regular Relations for Verifying Infinite-State Systems.

Bengt Jonsson, Marcus Nilsson

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Abstraction of Communication Channels in Promela: A Case Study.

Elena Fersman, Bengt Jonsson

Proceedings of the SPIN Model Checking and Software Verification, 7th International SPIN Workshop, Stanford, CA, USA, August 30, 2000

Reasoning about Probabilistic Lossy Channel Systems.

Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson

Proceedings of the CONCUR 2000, 2000

Regular Model Checking.

Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson, Tayssir Touili

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

Invited Tutorial: Verification of Infinite-State and Parameterized Systems.

Parosh Aziz Abdulla, Bengt Jonsson

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999

Proving Refinement Using Transduction.

Bengt Jonsson, Amir Pnueli, Camilla Rump

Distributed Comput., 1999

Handling Global Conditions in Parameterized System Verification.

Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, Marcus Nilsson

Proceedings of the Computer Aided Verification, 11th International Conference, 1999

On the Existence of Network Invariants for Verifying Parameterized Systems.

Parosh Aziz Abdulla, Bengt Jonsson

Proceedings of the Correct System Design, 1999

Fully Abstract Characterization of Probabilistic May Testing.

Bengt Jonsson, Wang Yi

Proceedings of the Formal Methods for Real-Time and Probabilistic Systems, 1999

1998

A Fully Abstract Semantics for Concurrent Constraint Programming.

Sven-Olof Nyström, Bengt Jonsson

Inf. Comput., 1998

Verifying Networks of Timed Processes (Extended Abstract).

Parosh Aziz Abdulla, Bengt Jonsson

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1998

Partial Order Reductions for Timed Systems.

Johan Bengtsson, Bengt Jonsson, Johan Lilius, Wang Yi

Proceedings of the CONCUR '98: Concurrency Theory, 1998

A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract).

Parosh Aziz Abdulla, Bengt Jonsson, Mats Kindahl, Doron A. Peled

Proceedings of the Computer Aided Verification, 10th International Conference, 1998

On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels.

Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson

Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1996

Assumption/Guarantee Specifications in Linear-Time Temporal Logic.

Bengt Jonsson, Yih-Kuen Tsay

Theor. Comput. Sci., 1996

Undecidable Verification Problems for Programs with Unreliable Channels.

Parosh Aziz Abdulla, Bengt Jonsson

Inf. Comput., 1996

Verifying Programs with Unreliable Channels.

Parosh Aziz Abdulla, Bengt Jonsson

Inf. Comput., 1996

General Decidability Theorems for Infinite-State Systems.

Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson, Yih-Kuen Tsay

Proceedings of the Proceedings, 1996

1995

Guest Editors Foreword.

Bengt Jonsson, Joachim Parrow

Nord. J. Comput., 1995

Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract).

Bengt Jonsson, Yih-Kuen Tsay

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Compositional Testing Preorders for Probabilistic Processes

Bengt Jonsson, Wang Yi

Proceedings of the Proceedings, 1995

Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms.

Bengt Jonsson, Lars Kempe

Proceedings of the Computer Aided Verification, 1995

1994

Compositional Specification and Verification of Distributed Systems.

Bengt Jonsson

ACM Trans. Program. Lang. Syst., 1994

A Logic for Reasoning about Time and Reliability.

Hans Hansson, Bengt Jonsson

Formal Aspects Comput., 1994

A Fully Abstract Trace Model for Dataflow and Asynchronous Networks.

Bengt Jonsson

Distributed Comput., 1994

Testing and Refinement for Nondeterministic and Probabilistic Processes.

Bengt Jonsson, Chris Ho-Stuart, Wang Yi

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium Organized Jointly with the Working Group Provably Correct Systems, 1994

Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes.

Wang Yi, Bengt Jonsson

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Using temporal logic for modular specification of telephone services.

Johan Blom, Bengt Jonsson, Lars Kempe

Proceedings of the Feature Interactions in Telecommunications Systems, 1994

Constraint Oriented Temporal Logic Specification.

Johan Blom, Bengt Jonsson

Proceedings of the Formal Systems Specification, 1994

1993

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

Bengt Jonsson, Joachim Parrow

Inf. Comput., December, 1993

Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations.

Sven-Olof Nyström, Bengt Jonsson

Proceedings of the Logic Programming, 1993

Validating Simulations Between Large Nondeterministic Specifications.

Ricardo Civalero, Bengt Jonsson, Joakim Nilsson

Proceedings of the Formal Description Techniques, VI, Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, 1993

1991

On the Complexity of Equation Solving in Process Algebra.

Bengt Jonsson, Kim Guldstrand Larsen

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Refining Interfaces of Communicating Systems.

Ed Brinksma, Bengt Jonsson, Fredrik Orava

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Towards a Complete Hierarchy of Compositional Dataflow Models.

Bengt Jonsson, Joost N. Kok

Proceedings of the Theoretical Aspects of Computer Software, 1991

Specification and Refinement of Probabilistic Processes

Bengt Jonsson, Kim Guldstrand Larsen

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Specification and Validation of a Simple Overtaking Protokol using LOTOS.

Patrik Ernberg, Lars-Åke Fredlund, Bengt Jonsson

Proceedings of the Formal Description Techniques, 1991

Simulations Between Specifications of Distributed Systems.

Bengt Jonsson

Proceedings of the CONCUR '91, 1991

1990

A Calculus for Communicating Systems with Time and Probabitilies.

Hans Hansson, Bengt Jonsson

Proceedings of the Real-Time Systems Symposium, 1990

A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract).

Bengt Jonsson

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

An Implementation of a Translational Semantics for an Imperative Language.

Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow

Proceedings of the CONCUR '90, 1990

1989

A Framework for Reasoning about Time and Reliability.

Hans Hansson, Bengt Jonsson

Proceedings of the Real-Time Systems Symposium, 1989

On Decomposing and Refining Specifications of Distributed Systems.

Bengt Jonsson

Proceedings of the Stepwise Refinement of Distributed Systems, 1989

A Fully Abstract Trace Model for Dataflow Networks.

Bengt Jonsson

Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

Comparing Two Fully Abstract Dataflow Models.

Bengt Jonsson, Joost N. Kok

Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

Specification for Verification.

Hans Hansson, Bengt Jonsson, Fredrik Orava, Björn Pehrson

Proceedings of the Formal Description Techniques, 1989

Implementing a Model Checking Algorithm by Adapting Existing Automated Tools.

Bengt Jonsson, Ahmed Hussain Khan, Joachim Parrow

Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1987

Modular Verification of Asynchronous Networks.

Bengt Jonsson

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1986

Towards Deductive Synthesis of Dataflow Networks

Bengt Jonsson, Zohar Manna, Richard J. Waldinger

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985

A Model and Proof System for Asynchronous Networks.

Bengt Jonsson

Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985