Jolie Static Type Checker: a prototype
Abstract
Static verification of a program source code correctness is an important element of software reliability. Formal verification of software programs involves proving that a program satisfies a formal specification of its behavior. Many languages use both static and dynamic type checking. With such approach, the static type checker verifies everything possible at compile time, and dynamic checks the remaining. The current state of the Jolie programming language includes a dynamic type system. Consequently, it allows avoidable run-time errors. A static type system for the language has been formally defined on paper but lacks an implementation yet. In this paper, we describe a prototype of Jolie Static Type Checker (JSTC), which employs a technique based on a SMT solver. We describe the theory behind and the implementation, and the process of static analysis.
Cite
@article{arxiv.1702.07146,
title = {Jolie Static Type Checker: a prototype},
author = {Daniel de Carvalho and Manuel Mazzara and Bogdan Mingela and Larisa Safina and Alexander Tchitchigin and Nikolay Troshkov},
journal= {arXiv preprint arXiv:1702.07146},
year = {2017}
}
Comments
Modeling and Analysis of Information Systems, 2017