Bengt Jonsson

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
\(SL^{\lambda}\): a scalable algorithm for register automata learning
Journal of Automated Reasoning
2026-08-24Paper
Awaiting for Godot: stateless model checking that avoids executions where nothing happens
Formal Methods in System Design
2025-10-24Paper
CONCUR test-of-time award 2023 (invited paper)2025-06-26Paper
Timing is all you need2025-03-25Paper
Partial order reductions for timed systems2025-01-27Paper
Exposing inter-process information for efficient PDEs of spatial stochastic systems on multicores
ACM Transactions on Modeling and Computer Simulation
2024-09-08Paper
An active learning approach to synthesizing program contracts2024-06-05Paper
Assumption/guarantee specifications in linear-time temporal logic (extended abstract)
TAPSOFT '95: Theory and Practice of Software Development
2022-08-18Paper
Deciding bisimulation equivalences for a class of non-finite-state programs
STACS 89
2022-08-16Paper
Towards a complete hierarchy of compositional dataflow models
Lecture Notes in Computer Science
2022-08-16Paper
Combining black-box and white-box techniques for learning register automata2022-02-16Paper
Proving refinement using transduction2020-12-03Paper
Comparing Source Sets and Persistent Sets for Partial Order Reduction
Lecture Notes in Computer Science
2020-02-24Paper
Stateless model checking for TSO and PSO
Tools and Algorithms for the Construction and Analysis of Systems
2019-09-17Paper
Optimal dynamic partial order reduction with observers2019-09-16Paper
Fragment abstraction for concurrent shape analysis2019-09-13Paper
Undecidable verification problems for programs with unreliable channels
Automata, Languages and Programming
2019-04-29Paper
Source sets: a foundation for optimal dynamic partial order reduction
Journal of the ACM
2018-05-17Paper
Stateless model checking for TSO and PSO
Acta Informatica
2017-12-01Paper
Active learning for extended finite state machines
Formal Aspects of Computing
2016-08-04Paper
Verification of heap manipulating programs with ordered data by extended forest automata
Acta Informatica
2016-06-28Paper
Mediator Synthesis in a Component Algebra with Data
Lecture Notes in Computer Science
2015-11-04Paper
Generating models of infinite-state communication protocols using regular inference with abstraction
Formal Methods in System Design
2015-03-24Paper
A succinct canonical register automaton model
Journal of Logical and Algebraic Methods in Programming
2014-12-03Paper
An algebraic theory of interface automata
Theoretical Computer Science
2014-08-27Paper
Verification of heap manipulating programs with ordered data by extended forest automata
Automated Technology for Verification and Analysis
2014-07-08Paper
Optimal dynamic partial order reduction
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
2014-04-10Paper
Inference of timed transition systems2013-10-02Paper
Insights to Angluin's learning2013-09-20Paper
An integrated specification and verification technique for highly concurrent data structures
Tools and Algorithms for the Construction and Analysis of Systems
2013-08-05Paper
Using refinement calculus techniques to prove linearizability
Formal Aspects of Computing
2013-03-22Paper
A succinct canonical register automaton model for data domains with binary relations
Automated Technology for Verification and Analysis
2012-11-21Paper
Demonstrating Learning of Register Automata
Tools and Algorithms for the Construction and Analysis of Systems
2012-06-29Paper
A compositional specification theory for component behaviours
Programming Languages and Systems
2012-06-22Paper
Inferring canonical register automata
Lecture Notes in Computer Science
2012-06-15Paper
A Succinct Canonical Register Automaton Model
Automated Technology for Verification and Analysis
2011-10-07Paper
Eliminating queues from RT UML model representations
Lecture Notes in Computer Science
2011-04-08Paper
Learning of event-recording automata
Theoretical Computer Science
2010-11-11Paper
Algorithmic improvements in regular model checking.
Lecture Notes in Computer Science
2010-04-20Paper
Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
Tools and Algorithms for the Construction and Analysis of Systems
2008-04-11Paper
Systematic Acceleration in Regular Model Checking
Computer Aided Verification
2007-11-29Paper
Proving Liveness by Backwards Reachability
CONCUR 2006 – Concurrency Theory
2007-09-04Paper
Inference of Event-Recording Automata Using Timed Decision Trees
CONCUR 2006 – Concurrency Theory
2007-09-04Paper
Specifying and generating test cases using observer automata
Lecture Notes in Computer Science
2005-12-02Paper
On the correspondence between conformance testing and regular inference
Lecture Notes in Computer Science
2005-09-13Paper
Regular model checking for LTL(MSO)
Lecture Notes in Computer Science
2005-08-25Paper
A survey of regular model checking
Lecture Notes in Computer Science
2005-08-23Paper
Learning of event-recording automata
Lecture Notes in Computer Science
2005-08-19Paper
Simulating perfect channels with probabilistic lossy channels
Information and Computation
2005-05-12Paper
Handling global conditions in parameterized system verification
Lecture Notes in Computer Science
2004-09-24Paper
Using forward reachability analysis for verification of lossy channel systems
Formal Methods in System Design
2004-09-09Paper
Decidability of timed language-inclusion for networks of real-time communicating sequential processes
Lecture Notes in Computer Science
2004-07-01Paper
Processor pipelines and their properties for static WCET analysis
Lecture Notes in Computer Science
2003-12-14Paper
Regular model checking made simple and efficient
Lecture Notes in Computer Science
2003-06-12Paper
Regular tree model checking
Lecture Notes in Computer Science
2003-05-01Paper
Channel representations in protocol verification. (Preliminary version)
Lecture Notes in Computer Science
2003-02-03Paper
Model checking of systems with many identical timed processes
Theoretical Computer Science
2003-01-21Paper
Algorithmic analysis of programs with well quasi-ordered domains.
Information and Computation
2003-01-14Paper
Testing preorders for probabilistic processes can be characterized by simulations
Theoretical Computer Science
2002-07-15Paper
Reasoning about probabilistic lossy channel systems
Lecture Notes in Computer Science
2002-06-25Paper
An execution semantics for MSC-2000
Lecture Notes in Computer Science
2002-04-15Paper
Incremental requirement specification for evolving systems
Nordic Journal of Computing
2002-01-31Paper
Abstraction of communication channels in Promela: A case study
Lecture Notes in Computer Science
2001-11-11Paper
Regular model checking
Lecture Notes in Computer Science
2001-11-11Paper
On the complexity of equation solving in process algebra
Lecture Notes in Computer Science
2001-08-29Paper
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science
2001-08-20Paper
Probabilistic extensions of process algebras.2001-01-01Paper
Transitive closures of regular relations for verifying infinite-state systems
Lecture Notes in Computer Science
2000-12-03Paper
A fully abstract semantics for concurrent constraint programming
Information and Computation
1999-03-23Paper
Undecidable verification problems for programs with unreliable channels
Information and Computation
1997-03-06Paper
Assumption/guarantee specifications in linear-time temporal logic
Theoretical Computer Science
1997-02-27Paper
Verifying programs with unreliable channels
Information and Computation
1996-10-01Paper
A logic for reasoning about time and reliability
Formal Aspects of Computing
1995-02-09Paper
A fully abstract trace model for dataflow and asynchronous networks
Distributed Computing
1994-09-13Paper
Deciding bisimulation equivalences for a class of non-finite-state programs
Information and Computation
1994-03-24Paper
scientific article; zbMATH DE number 140247 (Why is no real title available?)1993-03-28Paper
scientific article; zbMATH DE number 4213439 (Why is no real title available?)1990-01-01Paper


Research outcomes over time


This page was built for person: Bengt Jonsson