Verifying Temporal Relational Models with Pardinus
Verifying Temporal Relational Models with Pardinus
dc.contributor.author | Alcino Cunha | en |
dc.contributor.author | Nuno Moreira Macedo | en |
dc.contributor.other | 5612 | en |
dc.contributor.other | 5625 | en |
dc.date.accessioned | 2024-02-02T14:31:19Z | |
dc.date.available | 2024-02-02T14:31:19Z | |
dc.date.issued | 2023 | en |
dc.description.abstract | 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. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG. | en |
dc.identifier | P-00Y-FJW | en |
dc.identifier.uri | https://repositorio.inesctec.pt/handle/123456789/14799 | |
dc.language | eng | en |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.title | Verifying Temporal Relational Models with Pardinus | en |
dc.type | en | |
dc.type | Publication | en |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- P-00Y-FJW.pdf
- Size:
- 338.73 KB
- Format:
- Adobe Portable Document Format
- Description: