2018
Symbolic Computation via Program Transformation
LAUKO, Henrich; Petr ROČKAI and Jiří BARNATBasic information
Original name
Symbolic Computation via Program Transformation
Authors
LAUKO, Henrich (703 Slovakia, belonging to the institution); Petr ROČKAI (703 Slovakia, belonging to the institution) and Jiří BARNAT (203 Czech Republic, guarantor, belonging to the institution)
Edition
Cham (Switzerland), Theoretical Aspects of Computing – ICTAC 2018, p. 313-332, 20 pp. 2018
Publisher
Springer
Other information
Language
English
Type of outcome
Proceedings paper
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Switzerland
Confidentiality degree
is not subject to a state or trade secret
Publication form
printed version "print"
References:
Impact factor
Impact factor: 0.402 in 2005
RIV identification code
RIV/00216224:14330/18:00101301
Organization unit
Faculty of Informatics
ISBN
978-3-030-02507-6
ISSN
UT WoS
000612998900017
EID Scopus
2-s2.0-85055428224
Keywords in English
Symbolic Computation; Abstraction; DIVINE; LLVM; Transformation; Verification; Model Checking; C; C++
Tags
International impact, Reviewed
Changed: 20/9/2022 11:14, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
Symbolic computation is an important approach in automated program analysis. Most state-of-the-art tools perform symbolic computation as interpreters and directly maintain symbolic data. In this paper, we show that it is feasible, and in fact practical, to use a compiler-based strategy instead. Using compiler tooling, we propose and implement a transformation which takes a standard program and outputs a program that performs a semantically equivalent, but partially symbolic, computation. The transformed program maintains symbolic values internally and operates directly on them; therefore, the program can be processed by a tool without support for symbolic manipulation.
Links
GA18-02177S, research and development project |
| ||
MUNI/A/0854/2017, interní kód MU |
| ||
MUNI/A/1038/2017, interní kód MU |
|