Complexity Bounds for the Verification of Real-Time Software
From MaRDI portal
Publication:3656878
DOI10.1007/978-3-642-11319-2_10zbMath1273.68223OpenAlexW1497713348MaRDI QIDQ3656878
Mahesh Viswanathan, Pavithra Prabhakar, Axel Legay, Rohit Chadha
Publication date: 14 January 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/14134
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
This page was built for publication: Complexity Bounds for the Verification of Real-Time Software