Oskar Wickström

dblp:317/1303 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing › software validation
acceptance testing
0.612022
Quickstrom: property-based acceptance testing with LTL specifications · PLDI 2022
Software testing › random testing
property-based testing
0.612022
Quickstrom: property-based acceptance testing with LTL specifications · PLDI 2022
Software testing › test generation
specification-based test generation
0.612022
Quickstrom: property-based acceptance testing with LTL specifications · PLDI 2022
Software testing
test generation
0.612022
Quickstrom: property-based acceptance testing with LTL specifications · PLDI 2022
Logic in computer science › temporal logic
linear temporal logic
0.212022
Quickstrom: property-based acceptance testing with LTL specifications · PLDI 2022
Logic in computer science
temporal logic
0.212022
Quickstrom: property-based acceptance testing with LTL specifications · PLDI 2022

Methods — techniques the papers use, named apart from their topics

QuickLTL · 1.1LTL · 1.1
YearPublicationVenuePosition
2022 Quickstrom: property-based acceptance testing with LTL specifications
abstract
We present Quickstrom, a property-based testing system for acceptance testing of interactive applications. Using Quickstrom, programmers can specify the behaviour of web applications as properties in our testing-oriented dialect of Linear Temporal Logic (LTL) called QuickLTL, and then automatically test their application against the given specification with hundreds of automatically generated interactions. QuickLTL extends existing finite variants of LTL for the testing use-case, determining likely outcomes from partial traces whose minimum length is itself determined by the LTL formula. This temporal logic is embedded in our specification language, Specstrom, which is designed to be approachable to web programmers, expressive for writing specifications, and easy to analyse. Because Quickstrom tests only user-facing behaviour, it is agnostic to the implementation language of the system under test. We therefore formally specify and test many implementations of the popular TodoMVC benchmark, used for evaluation and comparison across various web frontend frameworks and languages. Our tests uncovered bugs in almost half of the available implementations.
Liam O'Connor, Oskar Wickström
PLDI2