About the Concolic Execution and Symbolic ASM Function Promotion in CASM

About the Concolic Execution and Symbolic ASM Function Promotion in CASM

Abstract

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.

Grafik Top
Authors
  • Paulweber, Philipp
  • Moosbrugger, Jakob
  • Zdun, Uwe
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
8th International Conference on Rigorous State-Based Methods (ABZ'21)
Divisions
Software Architecture
Subjects
Software Engineering
Programmiersprachen
Theoretische Informatik
Event Location
Ulm, Germany
Event Type
Conference
Event Dates
9-11 June 2021
Series Name
Lecture Notes in Computer Science (LNCS) 12709
ISSN/ISBN
978-3-030-77542-1
Page Range
pp. 112-117
Date
23 May 2021
Export
Grafik Top