◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Bengt Jonsson

3 papers hereh-index 333 citations10 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author3

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.PL2
  • cs.FL1

identity via Semantic Scholar / OpenAlex

most citedScalable Tree-based Register Automata Learning

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

cs.PL2025

Efficient Linearizability Monitoring

Parosh Aziz Abdulla, Samuel Grahn, Bengt Jonsson +2

This paper revisits the fundamental problem of monitoring the linearizability of concurrent stacks, queues, sets, and multisets. Given a history of a library implementing one of th…

cs.PL2024

Parsimonious Optimal Dynamic Partial Order Reduction

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Sarbojit Das +2

Stateless model checking is a fully automatic verification technique for concurrent programs that checks for safety violations by exploring all possible thread schedulings. It beco…

cs.FL2024★ 1 cited

Scalable Tree-based Register Automata Learning

Simon Dierl, Paul Fiterau-Brostean, Falk Howar +3

Existing active automata learning (AAL) algorithms have demonstrated their potential in capturing the behavior of complex systems (e.g., in analyzing network protocol implementatio…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.