Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/89467
Título: | Verifying temporal relational models with Pardinus |
Autor(es): | Macedo, Nuno Brunel, Julien Chemouil, David Cunha, Alcino |
Palavras-chave: | Model Checking Model Finding Relational Logic Temporal Logic |
Data: | 2023 |
Editora: | Springer, Cham |
Revista: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Citação: | Macedo, 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_20 |
Resumo(s): | This 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. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/89467 |
ISBN: | 978-3-031-33162-6 |
e-ISBN: | 978-3-031-33163-3 |
DOI: | 10.1007/978-3-031-33163-3_20 |
ISSN: | 0302-9743 |
Versão da editora: | https://link.springer.com/chapter/10.1007/978-3-031-33163-3_20 |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: |