Author image not provided
 Bengt Jonsson

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article14.13
Citation Count1,455
Publication count103
Publication years1987-2017
Available for download11
Average downloads per article344.18
Downloads (cumulative)3,786
Downloads (12 Months)515
Downloads (6 Weeks)69
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


103 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 103
Result page: 1 2 3 4 5 6

Sort by:

1
December 2017 Acta Informatica: Volume 54 Issue 8, December 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel representation of executions under TSO and PSO, called chronological traces. Chronological traces induce a partial order relation on relaxed memory executions, ...

2
October 2017 International Journal on Software Tools for Technology Transfer (STTT): Volume 19 Issue 5, October 2017
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We present a technique for automatically verifying safety properties of concurrent programs, in particular programs that rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an ...
Keywords: Concurrency, Verification, Pointer programs, Unbounded, Linearizability, Queue, Specification, Explicit memory allocation, Stack

3 published by ACM
August 2017 Journal of the ACM (JACM): Volume 64 Issue 4, September 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 20,   Downloads (12 Months): 112,   Downloads (Overall): 112

Full text available: PDFPDF
Stateless model checking is a powerful method for program verification that, however, suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR), an algorithm originally introduced by Flanagan and Godefroid in ...
Keywords: wakeup trees, Dynamic partial order reduction, concurrency, software model checking, source sets, systematic testing

4 published by ACM
May 2017 SIGSIM-PADS '17: Proceedings of the 2017 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 41,   Downloads (Overall): 41

Full text available: PDFPDF
We present a new efficient approach to the parallelization of discrete event simulators for multicore computers, which is based on exposing and disseminating essential information between processors. We aim specifically at simulation models with a spatial structure, where time intervals between successive events are highly variable and without lower bounds. ...
Keywords: multicore, PDES, spatial stochastic simulation, optimism control, parallel discrete-event simulation

5
June 2016 Acta Informatica: Volume 53 Issue 4, June 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We present a general framework for verifying programs with complex dynamic linked data structures whose correctness depends on ordering relations between stored data values. The underlying formalism of our framework is that of forest automata (FA), which has previously been developed for verification of heap-manipulating programs. We extend FA with ...

6
April 2016 Formal Aspects of Computing: Volume 28 Issue 2, April 2016
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialects of EFSMs are widely used in tools for model-based software development, verification, and ...

7 published by ACM
June 2015 SIGSIM PADS '15: Proceedings of the 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 5,   Downloads (12 Months): 43,   Downloads (Overall): 183

Full text available: PDFPDF
We present a new technique for controlling optimism in Parallel Discrete Event Simulation on multicores. It is designed to be suitable for simulating models, in which the time intervals between successive events between different processes are highly variable, and have no lower bounds. In our technique, called Dynamic Local Time ...
Keywords: parallel discrete-event simulation, multicore, pdes, spatial stochastic simulation, optimism control

8
April 2015 Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9035
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 3

We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel representation of executions under TSO and PSO, called chronological traces . Chronological traces induce a partial order relation on relaxed memory ...

9
February 2015 Formal Methods in System Design: Volume 46 Issue 1, February 2015
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 4

In order to facilitate model-based verification and validation, effort is underway to develop techniques for generating models of communication system components from observations of their external behavior. Most previous such work has employed regular inference techniques which generate modest-size finite-state models. They typically suppress parameters of messages, although these have ...
Keywords: Abstraction techniques, Transmission control protocol, Communication protocols, Mealy machines, Active automata learning, Session initiation protocol

10 published by ACM
March 2014 ACM Transactions on Embedded Computing Systems (TECS) - Regular Papers: Volume 13 Issue 4, November 2014
Publisher: ACM
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 22,   Downloads (12 Months): 178,   Downloads (Overall): 1,080

Full text available: PDFPDF
A large class of embedded systems is distinguished from general-purpose computing systems by the need to satisfy strict requirements on timing, often under constraints on available resources. Predictable system design is concerned with the challenge of building systems for which timing requirements can be guaranteed a priori . Perhaps paradoxically, ...
Keywords: resource sharing, Embedded systems, safety-critical systems, timing analysis, predictability

11 published by ACM
January 2014 POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 25
Downloads (6 Weeks): 4,   Downloads (12 Months): 80,   Downloads (Overall): 387

Full text available: PDFPDF
Stateless model checking is a powerful technique for program verification, which however suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR). We present a new DPOR algorithm, which is the ...
Keywords: dynamic partial oder reduction, wakeup trees, concurrency, software model checking, source sets, systematic testing
Also published in:
January 2014  ACM SIGPLAN Notices - POPL '14: Volume 49 Issue 1, January 2014

12
December 2013 OPODIS 2013: Proceedings of the 17th International Conference on Principles of Distributed Systems - Volume 8304
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 5

Priority queues are fundamental to many multiprocessor applications. Several priority queue algorithms based on skiplists have been proposed, as skiplists allow concurrent accesses to different parts of the data structure in a simple way. However, for priority queues on multiprocessors, an inherent bottleneck is the operation that deletes the minimal ...
Keywords: Skiplist, Lock-free, Priority Queue, Concurrent Data Structures, Non-blocking

13
September 2013 SEFM 2013: Proceedings of the 11th International Conference on Software Engineering and Formal Methods - Volume 8137
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

Software systems are increasingly composed of independently developed heterogeneous components. To ensure interoperability, mediators are needed that coordinate actions and translate exchanged messages between the components. We present a technique for automated synthesis of mediators, by means of a quotient operator, that is based on behavioural models of the components ...
Keywords: mediator synthesis, quotient, ontology, deadlock-freeness

14
March 2013 TACAS'13: Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 9

We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an ...

15
October 2012 ISoLA'12: Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

In this paper, we show how to fully automatically infer semantic interfaces of data structures on the basis of systematic testing. Our semantic interfaces are a generalized form of Register Automata (RA), comprising parameterized input and output, allowing to model control- and data-flow in component interfaces concisely. Algorithmic key to ...

16
October 2012 ATVA'12: Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We present a novel canonical automaton model for languages over infinite data domains, that is suitable for specifying the behavior of services, protocol components, interfaces, etc. The model is based on register automata. A major contribution is a construction of succinct canonical register automata, which is parameterized on the set ...

17
July 2012 Formal Aspects of Computing: Volume 24 Issue 4-6, July 2012
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Stepwise refinement is a method for systematically transforming a high-level program into an efficiently executable one. A sequence of successively refined programs can also serve as a correctness proof, which makes different mechanisms in the program explicit. We present rules for refinement of multi-threaded shared-variable concurrent programs. We apply our ...
Keywords: Formal verification, Linearizability, Multi-threading, Refinement calculus

18
July 2012 Formal Aspects of Computing - Celebrating the 60th Birthday of Carroll Morgan: Volume 24 Issue 4-6, July 2012
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 3

Stepwise refinement is a method for systematically transforming a high-level program into an efficiently executable one. A sequence of successively refined programs can also serve as a correctness proof, which makes different mechanisms in the program explicit. We present rules for refinement of multi-threaded shared-variable concurrent programs. We apply our ...
Keywords: Linearizability, Multi-threading, Formal verification

19
April 2012 International Journal on Software Tools for Technology Transfer (STTT) - Regular Model Checking: Volume 14 Issue 2, April 2012
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4

Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems whose states can be represented as words of arbitrary length over a finite alphabet, in which regular sets of words are used to represent sets of states. We present LTL ( MSO ), a combination ...
Keywords: Communication protocols, Monadic logic, Parameterized systems, Temporal logic, Model checking, Regular model checking

20
March 2012 TACAS'12: Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We will demonstrate the impact of the integration of our most recently developed learning technology for inferring Register Automata into the LearnLib, our framework for active automata learning. This will not only illustrate the unique power of Register Automata, which allows one to faithfully model data independent systems, but also ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us