Verifying quantitative temporal properties of procedural programs

DOI10.4230/LIPICS.CONCUR.2018.15MaRDI QIDQ5009429zbMATH OpenOpenAlexFDO

Authors Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan, Prakash Saivasan

Publication date 4 August 2021

Full work available at URL https://doi.org/10.4230/LIPIcs.CONCUR.2018.15

zbMATH Keywords

verificationformal methodspushdown systemsquantitative temporal propertiesvisibly pushdown

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• Temporal reasoning for procedural programs
• Validation of Stochastic Systems
• Model checking procedural programs
• The complexity of probabilistic verification

Cites work

• scientific article; zbMATH DE number 2038747 (Why is no real title available?)
• Analyzing Timed Systems Using Tree Automata
• Automata, Languages and Programming
• Bounded Parikh automata
• Counting in trees
• Dense-timed pushdown automata
• First-Order and Temporal Logics for Nested Words
• Model checking languages of data words
• On nondeterministic unranked tree automata with sibling constraints
• Parikh's theorem: a simple and direct automaton construction
• Push-down automata with gap-order constraints
• Quantitative interprocedural analysis
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
• The complexity of regular abstractions of one-counter languages
• Timed Pushdown Automata Revisited
• Visibly pushdown automata and transducers with counters
• Visibly pushdown languages
• Well-structured pushdown systems

Cited in

(2)

• scientific article; zbMATH DE number 52748 (Why is no real title available?)
• QBF Encoding of Temporal Properties and QBF-Based Verification

This page was built for publication: Verifying quantitative temporal properties of procedural programs

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