CaRet With Forgettable Past

DOI10.1016/j.entcs.2009.02.045zbMath1347.68219OpenAlexW1978982199MaRDI QIDQ4982130

Laura Bozzelli

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.045

zbMATH Keywords

verificationexpressive completenesspushdown model checkingCaRetNCaRet

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (3)

A Branching Time Variant of CaRet ⋮ Hybrid and First-Order Complete Extensions of CaRet ⋮ CaRet With Forgettable Past

Uses Software

• MOPS

Cites Work

• A hierarchy of temporal logics with past
• Model checking LTL with regular valuations for pushdown systems
• Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
• Visibly pushdown languages
• Alternation
• CaRet With Forgettable Past
• Tools and Algorithms for the Construction and Analysis of Systems
• Reachability analysis of pushdown automata: Application to model-checking
• Unnamed Item
• Unnamed Item

This page was built for publication: CaRet With Forgettable Past