Modeling and Verification of Infinite Systems with Resources

DOI10.2168/LMCS-9(4:22)2013zbMath1314.68184arXiv1311.1043MaRDI QIDQ2871475

Martin Lang, Christof Löding

Publication date: 8 January 2014

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.1043

zbMATH Keywords

pushdown systemsquantitative automata and logicsreachability with annotations

Mathematics Subject Classification ID

Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Decidable models of integer-manipulating programs with recursive parallelism

Uses Software

• jMoped

This page was built for publication: Modeling and Verification of Infinite Systems with Resources