Výsledky vyhledávání - "Étienne Payet"

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

Publikováno v: Theory and Practice of Logic Programming
Theory and Practice of Logic Programming, Cambridge University Press (CUP), 2020, 20 (5), pp.671-686. ⟨10.1017/s1471068420000216⟩
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname

[EN] Concolic testing is a popular software verification technique based on a combination of concrete and symbolic execution. Its main focus is finding bugs and generating test cases with the aim of maximizing code coverage. A previous approach to co

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d0f5f7f45e6d82f1442cea6ceee1007d
http://arxiv.org/abs/2008.00421

Zobrazit plný text záznamu

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

Zobrazit plný text záznamu

Guided Unfoldings for Finding Loops in Standard Term Rewriting

Autor: Étienne Payet

Publikováno v: Logic-Based Program Synthesis and Transformation ISBN: 9783030138370
LOPSTR

In this paper, we reconsider the unfolding-based technique that we have introduced previously for detecting loops in standard term rewriting. We modify it by guiding the unfolding process, using disagreement pairs in rewrite rules. This results in a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::177f1f3f532c8fcce52e039e3f9ea314
https://doi.org/10.1007/978-3-030-13838-7_2

Zobrazit plný text záznamu

Checking Array Bounds by Abstract Interpretation and Symbolic Expressions

Autor: Fausto Spoto, Étienne Payet

Publikováno v: Lecture Notes in Computer Sciences
9th International Joint Conference on Automated Reasoning (IJCAR'18)
9th International Joint Conference on Automated Reasoning (IJCAR'18), Jul 2018, Oxford, United Kingdom. pp.706-722, ⟨10.1007/978-3-319-94205-6_46⟩
Automated Reasoning ISBN: 9783319942049
IJCAR

International audience; Array access out of bounds is a typical programming error. From the '70s, static analysis has been used to identify where such errors actually occur at runtime, through abstract interpretation into linear constraints. However,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::016b2c2702aca586a6e537af9dd83bd0
http://hdl.handle.net/11562/988472

Zobrazit plný text záznamu

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

Zobrazit plný text záznamu

Optimal approximation for efficient termination analysis of Floating-point Loops

Autor: Étienne Payet, Fonenantsoa Maurica, Frédéric Mesnard

Publikováno v: 2017 1st International Conference on Next Generation Computing Applications (NextComp)
1st International Conference on Next Generation Computing Applications (NextComp2017)
1st International Conference on Next Generation Computing Applications (NextComp2017), Jul 2017, Pointe aux Piments, Mauritius. pp.17-22, ⟨10.1109/NEXTCOMP.2017.8016170⟩

International audience; Floating-point numbers are used in a wide variety of programs, from numerical analysis programs to control command programs. However floating-point computations are affected by rounding errors that render them hard to be verif

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ba1939e4ab6238633a53e75db3b713f
https://hal.archives-ouvertes.fr/hal-01579791/document

Zobrazit plný text záznamu

On the Linear Ranking Problem for Simple Floating-Point Loops

Autor: Frédéric Mesnard, Fonenantsoa Maurica, Étienne Payet

Publikováno v: Lecture Notes in Computer Science, Proceedings of the 23rd International Symposium on Static Analysis (SAS)
23rd International Symposium on Static Analysis (SAS)
23rd International Symposium on Static Analysis (SAS), Sep 2016, Edinburgh, United Kingdom. pp.300-316, ⟨10.1007/978-3-662-53413-7_15⟩
Static Analysis ISBN: 9783662534120
SAS

International audience; Termination of loops can be inferred from the existence of linear ranking functions. We already know that the existence of thesefunctions is PTIME decidable for simple rational loops. Since very recently, we know that the prob

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa76157c6af65c315c06c5362ce9a7da
https://hal.univ-reunion.fr/hal-01451688

Zobrazit plný text záznamu

Towards a framework for algorithm recognition in binary code

Autor: Wim Vanhoof, Étienne Payet, Frédéric Mesnard

Publikováno v: PPDP
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming (PPDP16)
18th International Symposium on Principles and Practice of Declarative Programming (PPDP)
18th International Symposium on Principles and Practice of Declarative Programming (PPDP), Sep 2016, Edinburgh, United Kingdom. pp.202--213
University of Namur

International audience; Algorithm recognition, which is the problem of verifying whether a program implements a given algorithm, is an important topic in program analysis. We propose an approach for algorithm recognition in binary code. For this pape

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b00ceac2a80d56fb75107c3747e34aa
https://doi.org/10.1145/2967973.2968600

Zobrazit plný text záznamu

Termination analysis of floating-point programs using parameterizable rational approximations

Autor: Fonenantsoa Maurica, Étienne Payet, Frédéric Mesnard

Publikováno v: SAC
Proceedings of the 31st Annual ACM Symposium on Applied Computing (SAC)
31st Annual ACM Symposium on Applied Computing (SAC)
31st Annual ACM Symposium on Applied Computing (SAC), Apr 2016, Pise, Italy. pp.1674--1679, ⟨10.1145/2851613.2851834⟩

International audience; Analysis of floating-point programs is a topic that received an increasing attention the past few years. However, only very few works have been done regarding their termination analysis. We address that problem in this paper.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47d4fd465392916a89b4eaf2a7e17222
https://doi.org/10.1145/2851613.2851834

Zobrazit plný text záznamu

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

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání