{log}: A language for programming in logic with finite sets

Dovier, Agostino; Omodeo, Eugenio G.; Pontelli, Enrico; Rossi, Gianfranco

doi:10.1016/0743-1066(95)00147-6

Cited by 85 publications

(78 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Ainsi, en programmation en logique, plusieurs propositions d'extensions ensemblistes sont apparues récemment (le. LPS [22], LDL1 [4], {Log} [10] ou [32]). Ces approches se présentent comme une extension des signatures des langages de type Prolog par l'introduction des constructeurs de termes ensemblistes, et donc l'introduction d'expressions ensemblistes dans les clauses de Horn.…”

Section: Intégration Dans Une Approche Clpunclassified

“…Le principal problème provient du caractère AfVcomplet de l'unifiabilité de structures ensemblistes [21] et de l'absence d'unicité de l'unificateur le plus général. L'introduction d'un algorithme d'unification ensembliste dans la résolution SLD, comme par exemple dans le langage {log} [10], conduit à une multiplication de points de choix qui viennent s'ajouter à ceux provenant des disjonctions de clauses. Ceci rend cette approche peu réaliste du point de vue de l'efficacité.…”

Section: Intégration Dans Une Approche Clpunclassified

See 1 more Smart Citation

Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini

Hibti¹,

Legeard²,

Lombardi³

1997

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

Section: Intégration Dans Une Approche Clpunclassified

Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini

Hibti¹,

Legeard²,

Lombardi³

1997

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

“…An evaluation of candidate alternatives for this task is mandatory for solving this scalability issue. {log} [40], a constraint logic programming language, arises from [41] as a possible alternative, but further studies are needed to see how well it would behave in the presence of a state explosion situation.…”

Section: Question 1: General Evaluation Of Beta-scope and Tool Supportmentioning

confidence: 99%

An empirical study of test generation with BETA

2016

View full text Add to dashboard Cite

Background: BETA (Bbased testing approach) is a toolsupported approach to generate test cases from Bmethod specifications through the application of input space partitioning and logical coverage criteria. The BETA tool automates the whole process, from the design of abstract test cases to the generation of executable test scripts. Methods: In this paper, we present an empirical study that was performed to evaluate and contribute to the development of BETA. The study evaluated the applicability of BETA on problems with different characteristics and used techniques of code coverage and mutation analysis to measure the quality of the generated test cases. The study was carried out in different rounds, and the results of each round were used as a reference for the improvement of the approach and its supporting tool. Results: These case studies were relevant not only for the evaluation of BETA but also to evaluate how different features affect the usability of the approach and the quality of the test cases and to compare the quality of the test cases generated using different coverage criteria. Conclusions:The results of this study showed that (1) BETAgenerated test scenarios for the different criteria follow theoretical expectations in terms of criteria subsumption; (2) the BETA implementation of the logical criteria generates more efficient test sets regarding code and mutation coverage than the input space partitioning ones; (3) it is important to go beyond the strict requirements of the criteria by adding some additional variation (randomization) of the input data; and (4) the algorithms designed to combine test requirements into test cases need to deal carefully with infeasible (logically unsatisfiable) combinations.

show abstract

“…In the meantime, Prolog has also been extended to incorporate general-purpose set constructs and basic operations on sets [Dovier et al 1996;Jayaraman 1992;Hill and Lloyd 1994].…”

Section: Complex-value Deductive Languagesmentioning

confidence: 99%

Deductive database languages

Liu

1999

ACM Comput. Surv.

View full text Add to dashboard Cite

Deductive databases result from the integration of relational database and logic programming techniques. However, significant problems remain inherent in this simple synthesis from the language point of view. In this paper, we discuss these problems from four different aspects: complex values, object orientation, higherorderness, and updates. In each case, we examine four typical languages that address the corresponding issues.

show abstract

{log}: A language for programming in logic with finite sets

Cited by 85 publications

References 13 publications

Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini

Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini

An empirical study of test generation with BETA

Deductive database languages

Contact Info

Product

Resources

About