Variants of LTL query checking

DOI10.1007/978-3-642-19583-9_11MaRDI QIDQ5391524zbMATH OpenOpenAlexFDO

Authors Hana Chockler, Arie Gurfinkel, Ofer Strichman

Publication date 6 April 2011

Published in Hardware and Software: Verification and Testing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19583-9_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• On solving temporal logic queries
• Automata, Languages and Programming
• Computer Science Logic
• scientific article; zbMATH DE number 1670794
• The tractability of model checking for LTL: the good, the bad, and the ugly fragments

Cited in

(8)

• An abstraction-refinement framework for trigger querying
• A tableau construction for finite linear-time temporal logic
• scientific article; zbMATH DE number 1670794 (Why is no real title available?)
• On the distributivity of LTL specifications
• On solving temporal logic queries
• Finding State Solutions to Temporal Logic Queries
• Computer Science Logic
• Automata, Languages and Programming

Describes a project that uses

Uses Software

• PBS

This page was built for publication: Variants of LTL query checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391524)