Visibly Linear Dynamic Logic

From MaRDI portal

Revision as of 15:30, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4636575

Jump to:navigation, search

DOI10.4230/LIPIcs.FSTTCS.2016.28zbMath1391.68022OpenAlexW2822781371MaRDI QIDQ4636575

Martín G. Zimmermann, Alexander Weinert

Publication date: 19 April 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2016.28

zbMATH Keywords

model checking infinite games temporal logic satisfiability visibly pushdown languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

A Branching Time Variant of CaRet ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Robust, expressive, and quantitative linear temporal logics: pick any two for free ⋮ Visibly linear temporal logic ⋮ Visibly linear dynamic logic ⋮ Unnamed Item

This page was built for publication: Visibly Linear Dynamic Logic

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4636575&oldid=18819252"