Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1459216, author = {Lauko, Henrich and Ročkai, Petr and Barnat, Jiří}, address = {Cham (Switzerland)}, booktitle = {Theoretical Aspects of Computing – ICTAC 2018}, doi = {http://dx.doi.org/10.1007/978-3-030-02508-3_17}, editor = {Bernd Fischer, Tarmo Uustalu}, keywords = {Symbolic Computation; Abstraction; DIVINE; LLVM; Transformation; Verification; Model Checking; C; C++}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Cham (Switzerland)}, isbn = {978-3-030-02507-6}, pages = {313-332}, publisher = {Springer}, title = {Symbolic Computation via Program Transformation}, url = {https://link.springer.com/chapter/10.1007/978-3-030-02508-3_17}, year = {2018} }
TY - JOUR ID - 1459216 AU - Lauko, Henrich - Ročkai, Petr - Barnat, Jiří PY - 2018 TI - Symbolic Computation via Program Transformation PB - Springer CY - Cham (Switzerland) SN - 9783030025076 KW - Symbolic Computation KW - Abstraction KW - DIVINE KW - LLVM KW - Transformation KW - Verification KW - Model Checking KW - C KW - C++ UR - https://link.springer.com/chapter/10.1007/978-3-030-02508-3_17 N2 - 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. ER -
LAUKO, Henrich, Petr ROČKAI and Jiří BARNAT. Symbolic Computation via Program Transformation. In Bernd Fischer, Tarmo Uustalu. \textit{Theoretical Aspects of Computing – ICTAC 2018}. Cham (Switzerland): Springer, 2018, p.~313-332. ISBN~978-3-030-02507-6. Available from: https://dx.doi.org/10.1007/978-3-030-02508-3\_{}17.
|