Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complexity Bounds for the Verification of Real-Time Software

From MaRDI portal
Publication:3656878
Jump to:navigation, search

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



Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3656878&oldid=17117687"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 06:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki