Zobrazeno 1 - 10
of 53
pro vyhledávání: '"Payet, Etienne"'
Autor:
Payet, Etienne
In this paper, we define two particular forms of non-termination, namely loops and binary chains, in an abstract framework that encompasses term rewriting and logic programming. The definition of loops relies on the notion of compatibility of binary
Externí odkaz:
http://arxiv.org/abs/2312.13949
This report contains the proceedings of the 19th International Workshop on Termination (WST 2023), which was held in Obergurgl during August 24--25 as part of Obergurgl Summer on Rewriting (OSR 2023).
Externí odkaz:
http://arxiv.org/abs/2308.09536
Autor:
Payet, Étienne
We present a new syntactic criterion for the automatic detection of non-termination in an abstract setting that encompasses a simplified form of term rewriting and logic programming.
Comment: Presented at WST 2023
Comment: Presented at WST 2023
Externí odkaz:
http://arxiv.org/abs/2307.11549
Publikováno v:
Theory and Practice of Logic Programming 20 (2020) 671-686
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 concoli
Externí odkaz:
http://arxiv.org/abs/2008.00421
Concolic testing mixes symbolic and concrete execution to generate test cases covering paths effectively. Its benefits have been demonstrated for more than 15 years to test imperative programs. Other programming paradigms, like logic programming, hav
Externí odkaz:
http://arxiv.org/abs/2002.07115
Autor:
Payet, Etienne
In this paper, we reconsider the unfolding-based technique that we have introduced previously for detecting loops in standard term rewriting. We improve it by guiding the unfolding process, using distinguished positions in the rewrite rules. This res
Externí odkaz:
http://arxiv.org/abs/1808.05065
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Concolic testing is a popular dynamic validation technique that can be used for both model checking and automatic test case generation. We have recently introduced concolic testing in the context of logic programming. In contrast to previous approach
Externí odkaz:
http://arxiv.org/abs/1608.03054
Publikováno v:
Theory and Practice of Logic Programming 15 (2015) 711-725
Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logic programming. In this paper, we introduce a systematic approach for dynamic
Externí odkaz:
http://arxiv.org/abs/1507.05454
Autor:
Payet, Etienne, Mesnard, Fred
We present a set of rules for compiling a Dalvik bytecode program into a logic program with array constraints. Non-termination of the resulting program entails that of the original one, hence the techniques we have presented before for proving non-te
Externí odkaz:
http://arxiv.org/abs/1412.3729