Extensible Proof Systems for Infinite-State Systems

DOI10.1145/3622786arXiv2207.12953MaRDI QIDQ6201709

Rance Cleaveland, Jeroen J. A. Keiren

Publication date: 21 February 2024

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

tableauxmodel checkinginfinite-state systemsmu-calculustimed systems

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set theory. An introduction to independence proofs
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92

This page was built for publication: Extensible Proof Systems for Infinite-State Systems