Bengt Jonsson

According to our database1, Bengt Jonsson
  • authored at least 134 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures.
STTT, 2017

Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction.
J. ACM, 2017

Stateless model checking for TSO and PSO.
Acta Inf., 2017

Exposing Inter-Process Information for Efficient Parallel Discrete Event Simulation of Spatial Stochastic Systems.
Proceedings of the 2017 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, 2017

Comparing Source Sets and Persistent Sets for Partial Order Reduction.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
Active learning for extended finite state machines.
Formal Asp. Comput., 2016

Stateless Model Checking for POWER.
CoRR, 2016

Verification of heap manipulating programs with ordered data by extended forest automata.
Acta Inf., 2016

Automated Verification of Linearization Policies.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Industrial Evaluation of Test Suite Generation Strategies for Model-Based Testing.
Proceedings of the Ninth IEEE International Conference on Software Testing, 2016

Stateless Model Checking for POWER.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
A succinct canonical register automaton model.
J. Log. Algebr. Meth. Program., 2015

Generating models of infinite-state communication protocols using regular inference with abstraction.
Formal Methods in System Design, 2015

Stateless Model Checking for TSO and PSO.
CoRR, 2015

Stateless Model Checking for TSO and PSO.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Efficient Inter-Process Synchronization for Parallel Discrete Event Simulation on Multicores.
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.
Proceedings of the 2015 IEEE International Symposium on Performance Analysis of Systems and Software, 2015

Mediator Synthesis in a Component Algebra with Data.
Proceedings of the Correct System Design, 2015

2014
Building timing predictable embedded systems.
ACM Trans. Embedded Comput. Syst., 2014

An algebraic theory of interface automata.
Theor. Comput. Sci., 2014

Compositional assume-guarantee reasoning for input/output component theories.
Sci. Comput. Program., 2014

A Constraint Programming Approach for Managing End-to-end Requirements in Sensor Network Macroprogramming.
Proceedings of the SENSORNETS 2014 - Proceedings of the 3rd International Conference on Sensor Networks, Lisbon, Portugal, 7, 2014

Learning Extended Finite State Machines.
Proceedings of the Software Engineering and Formal Methods - 12th International Conference, 2014

Optimal dynamic partial order reduction.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Modeling cache coherence misses on multicores.
Proceedings of the 2014 IEEE International Symposium on Performance Analysis of Systems and Software, 2014

2013
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning.
Proceedings of the Software Engineering and Formal Methods - 11th International Conference, 2013

A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2012
Regular model checking for LTL(MSO).
STTT, 2012

Using refinement calculus techniques to prove linearizability.
Formal Asp. Comput., 2012

Inferring Canonical Register Automata.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2012

Demonstrating Learning of Register Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Inferring Semantic Interfaces of Data Structures.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2012

Assume-Guarantee Reasoning for Safe Component Behaviours.
Proceedings of the Formal Aspects of Component Software, 9th International Symposium, 2012

A Compositional Specification Theory for Component Behaviours.
Proceedings of the Programming Languages and Systems, 2012

A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2011
Learning of Automata Models Extended with Data.
Proceedings of the Formal Methods for Eternal Networked Software Systems, 2011

A Succinct Canonical Register Automaton Model.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
Learning of event-recording automata.
Theor. Comput. Sci., 2010

Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction.
Proceedings of the Testing Software and Systems, 2010

On Handling Data in Automata Learning - Considerations from the CONNECT Perspective.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

Inferring Compact Models of Communication Protocol Entities.
Proceedings of the Leveraging Applications of Formal Methods, Verification, and Validation, 2010

10051 Executive Summary - Quantitative and Qualitative Analysis of Network Protocols.
Proceedings of the Quantitative and Qualitative Analysis of Network Protocols, 31.01., 2010

10051 Abstracts Collection - Quantitative and Qualitative Analysis of Network Protocols.
Proceedings of the Quantitative and Qualitative Analysis of Network Protocols, 31.01., 2010

2009
CONNECT Challenges: Towards Emergent Connectors for Eternal Networked Systems.
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).
SIGARCH Computer Architecture News, 2008

Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Regular Inference for State Machines Using Domains with Equality Tests.
Proceedings of the Fundamental Approaches to Software Engineering, 2008

Cyclic dependencies in modular performance analysis.
Proceedings of the 8th ACM & IEEE International conference on Embedded software, 2008

2007
Systematic Acceleration in Regular Model Checking.
Proceedings of the Computer Aided Verification, 19th International Conference, 2007

2006
Regular Inference for State Machines with Parameters.
Proceedings of the Fundamental Approaches to Software Engineering, 2006

Inference of Event-Recording Automata Using Timed Decision Trees.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

Proving Liveness by Backwards Reachability.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
Simulating perfect channels with probabilistic lossy channels.
Inf. Comput., 2005

Inference of Timed Transition Systems.
Electr. Notes Theor. Comput. Sci., 2005

Insights to Angluin's Learning.
Electr. Notes Theor. Comput. Sci., 2005

On the Correspondence Between Conformance Testing and Regular Inference.
Proceedings of the Fundamental Approaches to Software Engineering, 2005

2004
Using Forward Reachability Analysis for Verification of Lossy Channel Systems.
Formal Methods in System Design, 2004

Learning of Event-Recording Automata.
Proceedings of the Formal Techniques, 2004

Specifying and Generating Test Cases Using Observer Automata.
Proceedings of the Formal Approaches to Software Testing, 4th International Workshop, 2004

Finite State Machines.
Proceedings of the Model-Based Testing of Reactive Systems, 2004

A Survey of Regular Model Checking.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

Regular Model Checking for LTL(MSO).
Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2003
Model checking of systems with many identical timed processes.
Theor. Comput. Sci., 2003

Preface by the section editors.
STTT, 2003

Generating online test oracles from temporal logic specifications.
STTT, 2003

Automated test generation for industrial Erlang applications.
Proceedings of the 2003 ACM SIGPLAN Workshop on Erlang, Uppsala, Sweden, August 29, 2003, 2003

Algorithmic Improvements in Regular Model Checking.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
Testing preorders for probabilistic processes can be characterized by simulations.
Theor. Comput. Sci., 2002

Eliminating Queues from RT UML Model Representations.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2002

Processor Pipelines and Their Properties for Static WCET Analysis.
Proceedings of the Embedded Software, Second International Conference, 2002

Regular Model Checking Made Simple and Efficient.
Proceedings of the CONCUR 2002, 2002

Regular Tree Model Checking.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001
Ensuring completeness of symbolic verification methods for infinite-state systems.
Theor. Comput. Sci., 2001

Incremental Requirement Specification for Evolving Systems.
Nord. J. Comput., 2001

An Execution Semantics for MSC-2000.
Proceedings of the SDL 2001: Meeting UML, 2001

Channel Representations in Protocol Verification.
Proceedings of the CONCUR 2001, 2001

2000
Algorithmic Analysis of Programs with Well Quasi-ordered Domains.
Inf. Comput., 2000

Transitive Closures of Regular Relations for Verifying Infinite-State Systems.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Abstraction of Communication Channels in Promela: A Case Study.
Proceedings of the SPIN Model Checking and Software Verification, 7th International SPIN Workshop, Stanford, CA, USA, August 30, 2000

Incremental Requirement Specification for Evolving Systems.
Proceedings of the Feature Interactions in Telecommunications and Software Systems VI, 2000

Reasoning about Probabilistic Lossy Channel Systems.
Proceedings of the CONCUR 2000, 2000

Regular Model Checking.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

Invited Tutorial: Verification of Infinite-State and Parameterized Systems.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Proving Refinement Using Transduction.
Distributed Computing, 1999

Handling Global Conditions in Parameterized System Verification.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

On the Existence of Network Invariants for Verifying Parameterized Systems.
Proceedings of the Correct System Design, 1999

Fully Abstract Characterization of Probabilistic May Testing.
Proceedings of the Formal Methods for Real-Time and Probabilistic Systems, 1999

1998
A Fully Abstract Semantics for Concurrent Constraint Programming.
Inf. Comput., 1998

Verifying Networks of Timed Processes (Extended Abstract).
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1998

Partial Order Reductions for Timed Systems.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract).
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1996
Assumption/Guarantee Specifications in Linear-Time Temporal Logic.
Theor. Comput. Sci., 1996

Undecidable Verification Problems for Programs with Unreliable Channels.
Inf. Comput., 1996

Verifying Programs with Unreliable Channels.
Inf. Comput., 1996

General Decidability Theorems for Infinite-State Systems.
Proceedings of the Proceedings, 1996

1995
Guest Editors Foreword.
Nord. J. Comput., 1995

Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract).
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Compositional Testing Preorders for Probabilistic Processes
Proceedings of the Proceedings, 1995

Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms.
Proceedings of the Computer Aided Verification, 1995

1994
Compositional Specification and Verification of Distributed Systems.
ACM Trans. Program. Lang. Syst., 1994

A Logic for Reasoning about Time and Reliability.
Formal Asp. Comput., 1994

A Fully Abstract Trace Model for Dataflow and Asynchronous Networks.
Distributed Computing, 1994

A Low Voltage Wave SI Filter Implementation using Improved Delay Elements.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

Undecidable Verification Problems for Programs with Unreliable Channels.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Testing and Refinement for Nondeterministic and Probabilistic Processes.
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.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Using temporal logic for modular specification of telephone services.
Proceedings of the Feature Interactions in Telecommunications Systems, 1994

Constraint Oriented Temporal Logic Specification.
Proceedings of the Formal Systems Specification, 1994

1993
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs
Inf. Comput., December, 1993

Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations.
Proceedings of the Logic Programming, 1993

Verifying Programs with Unreliable Channels
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Validating Simulations Between Large Nondeterministic Specifications.
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.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Refining Interfaces of Communicating Systems.
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.
Proceedings of the Theoretical Aspects of Computer Software, 1991

Specification and Refinement of Probabilistic Processes
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Specification and Validation of a Simple Overtaking Protokol using LOTOS.
Proceedings of the Formal Description Techniques, 1991

Simulations Between Specifications of Distributed Systems.
Proceedings of the CONCUR '91, 1991

1990
A Calculus for Communicating Systems with Time and Probabitilies.
Proceedings of the Real-Time Systems Symposium, 1990

A Hierarchy of Compositional Models of I/O-Automata (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

An Implementation of a Translational Semantics for an Imperative Language.
Proceedings of the CONCUR '90, 1990

1989
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs.
Proceedings of the STACS 89, 1989

A Framework for Reasoning about Time and Reliability.
Proceedings of the Real-Time Systems Symposium, 1989

On Decomposing and Refining Specifications of Distributed Systems.
Proceedings of the Stepwise Refinement of Distributed Systems, 1989

A Fully Abstract Trace Model for Dataflow Networks.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

Comparing Two Fully Abstract Dataflow Models.
Proceedings of the PARLE '89: Parallel Architectures and Languages Europe, 1989

Specification for Verification.
Proceedings of the Formal Description Techniques, 1989

Implementing a Model Checking Algorithm by Adapting Existing Automated Tools.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1987
Modular Verification of Asynchronous Networks.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1986
Towards Deductive Synthesis of Dataflow Networks
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985
A Model and Proof System for Asynchronous Networks.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985


  Loading...