Abstract
Even with impressive advances in formal methods over the last few decades, some problems in automatic verification remain challenging. Central amongst these is the verification of quantitative properties of software such as execution time or energy usage. This paper discusses the main challenges for quantitative analysis of software in cyber-physical systems. It also presents a new approach to this problem based on the combination of inductive inference with deductive reasoning. The approach has been implemented for timing analysis in a system called GameTime. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Seshia, S. A. (2012). Quantitative analysis of software: Challenges and recent advances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6921 LNCS, pp. 1–5). https://doi.org/10.1007/978-3-642-27269-1_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
