Abstract State Machines (ASMs) are a well-known state based formal method to describe systems at a very high level and can be executed either through a concrete or symbolic interpretation. By symbolically executing an ASM specification, certain properties can be checked by transforming the described ASM into a suitable input for model checkers or Automated Theorem Provers (ATPs). Due to the rather fast increasing state space, model checking and ATP solutions can lead to inefficient implementations of symbolic execution. More efficient state space and execution performance can be achieved by using a concolic execution approach. In this paper, we describe an improved concolic execution implementation for the Corinthian Abstract State Machine (CASM) language. We outline the transformation of a symbolically executed ASM specification to a single Thousands of Problems for Theorem Provers (TPTP) format. Furthermore, we introduce a compiler analysis to promote concrete ASM functions into symbolic ones in order to obtain symbolic consistency.
% BibTex
@inproceedings{paulweber2021abz,
title = {{About the Concolic Execution and Symbolic ASM Function Promotion in CASM}},
author = {Paulweber, Philipp and Moosbrugger, Jakob and Zdun, Uwe},
booktitle = {8th International Conference on Rigorous State-Based Methods (ABZ'21)},
series = {Lecture Notes in Computer Science (LNCS) 12709},
pages = {112--117},
year = {2021},
organization = {Springer}
}