Bounded Symbolic Execution for Runtime Error Detection of Erlang Programs
Dynamically typed languages, like Erlang, allow developers to quickly write programs without explicitly providing any type information on expressions or function definitions. However, this feature makes those languages less reliable than statically typed languages, where many runtime errors can be d...
Main Authors: | Emanuele De Angelis, Fabio Fioravanti, Adrián Palacios, Alberto Pettorossi, Maurizio Proietti |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2018-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1809.04770v1 |
Similar Items
-
Verification of Imperative Programs by Constraint Logic Program Transformation
by: Emanuele De Angelis, et al.
Published: (2013-09-01) -
Lemma Generation for Horn Clause Satisfiability: A Preliminary Study
by: Emanuele De Angelis, et al.
Published: (2019-08-01) -
Removing Unnecessary Variables from Horn Clause Verification Conditions
by: Emanuele De Angelis, et al.
Published: (2016-07-01) -
Concurrent programming in ERLANG /
by: Armstrong, Joe
Published: (1996) -
An Erlanger program for combinatorial geometries.
by: Kung, Joseph Pee Sin
Published: (2015)