Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Vanhoof, Wim"'
Autor:
Yernaux, Gonzague, Vanhoof, Wim
Publikováno v:
EPTCS 385, 2023, pp. 41-54
In this work, which is done in the context of a (moded) logic programming language, we devise a data-flow analysis dedicated to computing what we call argument profiles. Such a profile essentially describes, for each argument of a predicate, its func
Externí odkaz:
http://arxiv.org/abs/2308.15880
Autor:
De Angelis, Emanuele, Vanhoof, Wim
This volume constitutes the pre-proceedings of the 31st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2021), held on 7-8th September 2021 as a hybrid (blended) meeting, both in-person (at the Teachers' House in T
Externí odkaz:
http://arxiv.org/abs/2107.10160
Autor:
Yernaux, Gonzague, Vanhoof, Wim
Anti-unification in logic programming refers to the process of capturing common syntactic structure among given goals, computing a single new goal that is more general called a generalization of the given goals. Finding an arbitrary common generaliza
Externí odkaz:
http://arxiv.org/abs/2107.00341
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:
Yernaux, Gonzague, Vanhoof, Wim
Publikováno v:
Theory and Practice of Logic Programming 19 (2019) 773-789
Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what is often ca
Externí odkaz:
http://arxiv.org/abs/1907.10333
In so-called constraint-based testing, symbolic execution is a common technique used as a part of the process to generate test data for imperative programs. Databases are ubiquitous in software and testing of programs manipulating databases is thus e
Externí odkaz:
http://arxiv.org/abs/1501.05821
Symbolic execution is a technique which enables automatically generating test inputs (and outputs) exercising a set of execution paths within a program to be tested. If the paths cover a sufficient part of the code under test, the test data offer a r
Externí odkaz:
http://arxiv.org/abs/1501.05265
Autor:
Demeyer, Romain, Vanhoof, Wim
Publikováno v:
EPTCS 137, 2013, pp. 115-134
Writing concurrent programs is a hard task, even when using high-level synchronization primitives such as transactional memories together with a functional language with well-controlled side-effects such as Haskell, because the interferences generate
Externí odkaz:
http://arxiv.org/abs/1312.2706
Publikováno v:
Proceedings of CICLOPS-WLPE 2010
This paper presents a test automation framework for Mercury programs. We developed a method that generates runnable Mercury code from a formalized test suite, and which code provides a report on execution about the success of test cases. We also deve
Externí odkaz:
http://arxiv.org/abs/1009.3765
Autor:
Hill, Patricia, Vanhoof, Wim
This volume contains the papers presented at WLPE 2007: the 17th Workshop on Logic-based Methods in Programming Environments on 13th September, 2007 in Porto, Portugal. It was held as a satellite workshop of ICLP 2007, the 23th International Conferen
Externí odkaz:
http://arxiv.org/abs/0712.3116