uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Concolic testing for functional languages
Natl Tech Univ Athens, Sch Elect & Comp Engn, Athens, Greece.
Natl Tech Univ Athens, Sch Elect & Comp Engn, Athens, Greece.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Natl Tech Univ Athens, Sch Elect & Comp Engn, Athens, Greece.ORCID iD: 0000-0001-9657-0179
2017 (English)In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 147, p. 109-134Article in journal (Refereed) Published
Abstract [en]

Concolic testing is a software testing technique that simultaneously combines concrete execution of a program (given specific input, along specific paths) with symbolic execution (generating new test inputs that explore other paths, which gives better path coverage than random test case generation). So far, concolic testing has been applied, mainly at the level of bytecode or assembly code, to programs written in imperative languages that manipulate primitive data types such as integers and arrays. In this article, we demonstrate its application to a functional programming language core, the functional subset of Core Erlang, that supports pattern matching, structured recursive data types such as lists, recursion and higher-order functions. We present CutEr, a tool implementing this testing technique, and describe its architecture, the challenges that it needs to address, its current limitations, and report some experiences from its use.

Place, publisher, year, edition, pages
2017. Vol. 147, p. 109-134
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-333909DOI: 10.1016/j.scico.2017.04.008ISI: 000410014200006OAI: oai:DiVA.org:uu-333909DiVA, id: diva2:1158230
Projects
RELEASE
Funder
Swedish Research Council, 621-2017-04812Available from: 2017-05-12 Created: 2017-11-18 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Sagonas, Konstantinos

Search in DiVA

By author/editor
Sagonas, Konstantinos
By organisation
Computing Science
In the same journal
Science of Computer Programming
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 97 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf