This paper presents a method for testing whether objects in actor languages and active object languages exhibit locally deterministic behavior. We investigate such a method for a class of guarded command programs, abstracting from object-oriented features like method calls but focusing on cooperative scheduling of dynamically spawned processes executing in parallel. The proposed method can answer questions such as whether all permutations of an execution trace are equivalent, by generating candidate traces for testing which may lead to different final states. To prune the set of candidate traces, we employ partial order reduction. To further reduce the set, we introduce an analysis technique to decide whether a generated trace is schedulable. Schedulability cannot be decided for guarded commands using standard dependence and interference relations because guard enabledness is non-monotonic. To solve this problem, we use concolic execution to produce linearized symbolic traces of the executed program, which allows a weakest precondition computation to decide on the satisfiability of guards.

, , ,
Recent Developments in the Design and Implementation of Programming Languages
Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands

de Boer, F.S, Johnsen, E.B, Schlatte, R, Tapia Tarifa, S.L, & Tveito, L. (2020). Inseguendo fagiani selvatici: Partial order reduction for guarded command languages. In OpenAccess Series in Informatics. doi:10.4230/OASIcs.Gabbrielli.10