Infinite-State Model Checking of LTLR Formulas Using Narrowing
From MaRDI portal
Publication:2945133
DOI10.1007/978-3-319-12904-4_6zbMath1366.68162OpenAlexW111391299MaRDI QIDQ2945133
Publication date: 9 September 2015
Published in: Rewriting Logic and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12904-4_6
Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)
Related Items (6)
Sentence-normalized conditional narrowing modulo in rewriting logic and Maude ⋮ Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude ⋮ Liveness Properties in CafeOBJ – A Case Study for Meta-Level Specifications ⋮ Variant-Based Satisfiability in Initial Algebras ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ Programming and symbolic computation in Maude
This page was built for publication: Infinite-State Model Checking of LTLR Formulas Using Narrowing