An SMT-Based Concolic Testing Tool for Logic Programs

Autor: Étienne Payet, Sophie Fortz, Gilles Perrouin, Wim Vanhoof, Fred Mesnard, Germán Vidal

Publikováno v: RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
Functional and Logic Programming. FLOPS 2020
Nakano K.; Sagonas K. Functional and Logic Programming. FLOPS 2020, 12073, Springer, pp.215-219, 2020, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-59025-3_13⟩
Fortz, S, Mesnard, F, Payet, E, Perrouin, G, Vanhoof, W & Vidal, G 2020, An SMT-Based Concolic Testing Tool for Logic Programs . in K Nakano & K Sagonas (eds), Functional and Logic Programming : 15th International Symposium, FLOPS 2020, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12073 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 215-219, 15th International Symposium on Functional and Logic Programming, FLOPS 2020, Akita, Japan, 14/09/20 . https://doi.org/10.1007/978-3-030-59025-3_13
Functional and Logic Programming ISBN: 9783030590246
FLOPS

[EN] Concolic testing combines symbolic and concrete execution to generate test cases that achieve a good program coverage. Its benefits have been demonstrated for more than 15 years in the case of imperative programs. In this work, we present a conc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1dc880002e5b63fdd893dd832af8c250
https://researchportal.unamur.be/en/publications/a8ed3861-2105-412e-b5d7-865ba911d541

Selective unification in constraint logic programming

Autor: Étienne Payet, Fred Mesnard, Germán Vidal

Publikováno v: PPDP
RiuNet: Repositorio Institucional de la Universitat Politécnica de Valéncia
Universitat Politècnica de València (UPV)
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming (PPDP'17)
19th International Symposium on Principles and Practice of Declarative Programming (PPDP'17)
19th International Symposium on Principles and Practice of Declarative Programming (PPDP'17), Oct 2017, Namur, Belgium. pp.115-126
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname

[EN] Concolic testing is a well-known validation technique for imperative and object oriented programs. In a previous paper, we have introduced an adaptation of this technique to logic programming. At the heart of our framework lies a specific proced

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eca4f90b9dd4507f770f0c56ad3461ba
https://doi.org/10.1145/3131851.3131863

A non-termination criterion for binary constraint logic programs

Autor: Fred Mesnard, Étienne Payet

Publikováno v: Theory and Practice of Logic Programming. 9:145-164

On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide this l

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6488ebf6373123839ae392425abed101
https://doi.org/10.1017/s1471068409003652

Nontermination inference of logic programs

Autor: Fred Mesnard, Étienne Payet

Publikováno v: ACM Transactions on Programming Languages and Systems. 28:256-289

We present a static analysis technique for nontermination inference of logic programs. Our framework relies on an extension of the subsumption test, where some specific argument positions can be instantiated while others are generalized. We give synt

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d948585ba334c4ebc9f2e2b90ab21e6d
https://doi.org/10.1145/1119479.1119481

cTI: a constraint-based termination inference tool for ISO-Prolog

Autor: Roberto Bagnara, Fred Mesnard

Publikováno v: Theory and Practice of Logic Programming. 5:243-257

We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a termination analyzer tries to prove that a given class of queries termi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dcf7e42a07b39a5a21620b135999c4cb
https://doi.org/10.1017/s1471068404002017