2022 · 15 citations · 20 references
ComputingComputer ScienceComputer SystemsFormal MethodsProgramming LanguagesTest DevelopmentDesign For TestabilitySoftware TestingSpecification LanguagesTest SpecificationWeb Application TestingAcceptance TestingLinear Temporal LogicProperty TestingProperty-based TestingSpecification-based TestingSystem TestingTestingWeb Application Frameworks
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.
20
Learning regular sets from queries and counterexamples
Dana Angluin · Information and Computation · 1987 · 2.1K citations
Bowen Alpern, Fred B. Schneider · Information Processing Letters · 1985 · 1K citations
Counterexample-guided abstraction refinement for symbolic model checking
Edmund M. Clarke, Orna Grümberg, Somesh Jha et al. · Journal of the ACM · 2003 · 991 citations
Koen Claessen, John Hughes · 2000 · 714 citations