Utilize este identificador para referenciar este registo: https://hdl.handle.net/1822/89467

Registo completo
Campo DCValorIdioma
dc.contributor.authorMacedo, Nunopor
dc.contributor.authorBrunel, Julienpor
dc.contributor.authorChemouil, Davidpor
dc.contributor.authorCunha, Alcinopor
dc.date.accessioned2024-03-12T21:59:36Z-
dc.date.available2024-03-12T21:59:36Z-
dc.date.issued2023-
dc.identifier.citationMacedo, N., Brunel, J., Chemouil, D., Cunha, A. (2023). Verifying Temporal Relational Models with Pardinus. In: Glässer, U., Creissac Campos, J., Méry, D., Palanque, P. (eds) Rigorous State-Based Methods. ABZ 2023. Lecture Notes in Computer Science, vol 14010. Springer, Cham. https://doi.org/10.1007/978-3-031-33163-3_20por
dc.identifier.isbn978-3-031-33162-6-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://hdl.handle.net/1822/89467-
dc.description.abstractThis short paper summarizes an article published in the Journal of Automated Reasoning [7]. It presents, an extension of the popular [12] relational model finder with linear temporal logic (including past operators) to simplify the analysis of dynamic systems. includes a SAT-based bounded model checking engine and an SMV-based complete model checking engine, both allowing iteration through the different instances (or counterexamples) of a specification. It also supports a decomposed parallel analysis strategy that improves the efficiency of both analysis engines on commodity multi-core machines.por
dc.description.sponsorshipWork financed by the European Regional Development Fund (ERDF) through the Operational Programme for Competitiveness and Internationalisation (COMPETE2020) and by National Funds through the Portuguese funding agency, Fundação para a Ciência e a Tecnologia (FCT) within project POCI-01-0145-FEDER-016826 and by the French Research Agency project FORMEDICIS ANR-16-CE25-0007 and by the research project CONCORDE of the Defense Innovation Agency (AID) of the French Ministry of Defense (2019650090004707501).por
dc.language.isoengpor
dc.publisherSpringer, Champor
dc.rightsopenAccesspor
dc.subjectModel Checkingpor
dc.subjectModel Findingpor
dc.subjectRelational Logicpor
dc.subjectTemporal Logicpor
dc.titleVerifying temporal relational models with Pardinuspor
dc.typeconferencePaperpor
dc.peerreviewedyespor
dc.relation.publisherversionhttps://link.springer.com/chapter/10.1007/978-3-031-33163-3_20por
oaire.citationStartPage254por
oaire.citationEndPage261por
oaire.citationVolume14010 LNCSpor
dc.date.updated2024-02-10T07:58:28Z-
dc.identifier.doi10.1007/978-3-031-33163-3_20por
dc.identifier.eisbn978-3-031-33163-3-
dc.subject.fosCiências Naturais::Ciências da Computação e da Informaçãopor
dc.subject.fosEngenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informáticapor
sdum.export.identifier13226-
sdum.journalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)por
oaire.versionAMpor
Aparece nas coleções:HASLab - Artigos em atas de conferências internacionais (texto completo)

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
main.pdf315,73 kBAdobe PDFVer/Abrir

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID