EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

StartSet l o g EndSet { l o g } $\{log\}$ : From a Constraint Logic Programming Language to a Formal Verification Tool

MAXIMILIANO CRISTIÁ, ALFREDO CAPOZUCCA, GIANFRANCO ROSSI

Theory and Practice of Logic Programming · 2025-11 · 25 (6) · 1015-1046

DOI: 10.1017/s1471068426100428 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theory and Practice of Logic Programming, online erschienen am 29.04.2026. Verfasst von MAXIMILIANO CRISTIÁ und 2 weiteren Autor:innen. Die Arbeit nennt 61 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

StartSet l o g EndSet { l o g } $\{log\}$ (read ‘setlog’) was born as a Constraint Logic Programming (CLP) language where sets and binary relations are first-class citizens, thus fostering set programming. Internally, StartSet l o g EndSet { l o g } $\{log\}$ is a constraint satisfiability solver implementing decision procedures for several fragments of set theory. Hence, StartSet l o g EndSet { l o g } $\{log\}$ can be used as a declarative, set, logic programming language and as an automated theorem prover for set theory. Over time StartSet l o g EndSet { l o g } $\{log\}$ has been extended with some components integrated to the satisfiability solver thus providing a formal verification environment. In this paper we make a comprehensive presentation of this environment which includes a language for the description of state machines based on set theory, an interactive environment for the execution of functional scenarios over state machines, a generator of verification conditions for state machines, automated verification of state machines, and test case generation. State machines are both, programs and specifications; exactly the same code works as a program and as its specification. In this way, with a few additions, a CLP language turned into a seamlessly integrated programming and automated proof system.

Zitieren

APA

CRISTIÁ, M., CAPOZUCCA, A., & ROSSI, G. (2025). StartSet l o g EndSet { l o g } $\{log\}$ : From a Constraint Logic Programming Language to a Formal Verification Tool. Theory and Practice of Logic Programming, 25(6), 1015-1046. https://doi.org/10.1017/s1471068426100428

Vancouver

CRISTIÁ M, CAPOZUCCA A, ROSSI G. StartSet l o g EndSet { l o g } $\{log\}$ : From a Constraint Logic Programming Language to a Formal Verification Tool. Theory and Practice of Logic Programming. 2025;25(6):1015-1046. doi:10.1017/s1471068426100428

BibTeX
@article{CRISTI2025,
  author = {CRISTIÁ, MAXIMILIANO and CAPOZUCCA, ALFREDO and ROSSI, GIANFRANCO},
  title = {StartSet l o g EndSet  l o g  $\log\$ : From a Constraint Logic Programming Language to a Formal Verification Tool},
  journal = {Theory and Practice of Logic Programming},
  year = {2025},
  volume = {25},
  number = {6},
  pages = {1015--1046},
  doi = {10.1017/s1471068426100428}
}
Kostenlos starten →