Please use this identifier to cite or link to this item: http://hdl.handle.net/10077/33309
DC FieldValueLanguage
dc.contributor.authorCristiá, Massimilianoit
dc.contributor.authorRossi, Gianfrancoit
dc.date.accessioned2021-12-24T08:22:19Z-
dc.date.available2021-12-24T08:22:19Z-
dc.date.issued2021-
dc.identifier.citationMassimiliano Cristiá, Gianfranco Rossi, "{log}: Set formulas as programs" in: "Rendiconti dell’Istituto di Matematica dell’Università di Trieste: an International Journal of Mathematics vol.53 (2021)", EUT Edizioni Università di Trieste, Trieste, 2021. pp.it
dc.identifier.issn0049-4704-
dc.identifier.urihttp://hdl.handle.net/10077/33309-
dc.description.abstract{log} is a programming language at the intersection of Constraint Logic Programming, set programming and declarative programming. But {log} is also a satisfiability solver for a theory of finite sets and finite binary relations. With {log} programmers can write abstract programs using all the power of set theory and binary relations. These programs are not very efficient but they are very close to specifications. Then, their correctness is more evident. Furthermore, {log} programs are also set formulas. Hence, programmers can use {log} again to automatically prove their programs verify non trivial properties. In this paper we show this development methodology by means of several examples.it
dc.language.isoenit
dc.publisherEUT Edizioni Università di Triesteit
dc.relation.ispartofRendiconti dell’Istituto di Matematica dell’Università di Trieste: an International Journal of Mathematicsit
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internazionale*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectset theoryit
dc.subjectdeclarative programmingit
dc.subjectset programmingit
dc.subjectformal verificationit
dc.subject{log}it
dc.title{log}: Set formulas as programsit
dc.typeArticleit
dc.identifier.doi10.13137/2464-8728/33309-
dc.subject.msc201068N17it
dc.subject.msc201068V15it
dc.subject.msc201003B70it
dc.subject.msc201003E20it
dc.subject.msc201003E75it
dc.identifier.eissn2464-8728-
dc.identifier.doieutx-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.openairetypearticle-
Appears in Collections:Rendiconti dell’Istituto di Matematica dell’Università di Trieste: an International Journal of Mathematics vol.53 (2021)
Files in This Item:
File Description SizeFormat
23_CristiaRossi.pdf433.81 kBAdobe PDFThumbnail
View/Open
Show simple item record


CORE Recommender

Page view(s)

60
checked on Jun 24, 2022

Download(s)

4
checked on Jun 24, 2022

Google ScholarTM

Check

Altmetric

Altmetric


This item is licensed under a Creative Commons License Creative Commons