Abstract
We propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative properties. The salient aspect of the framework is that it allows anytime verification, that is, verification algorithms that can be stopped at any time (for example, due to exhaustion of memory), and report approximations that improve monotonically when the algorithms are given more time.
We instantiate the framework with a number of quantitative abstractions and refinement schemes, which differ in terms of how much quantitative information they keep from the original system. We introduce both state-based and trace-based quantitative abstractions, and we describe conditions that define classes of quantitative properties for which the abstractions provide over-approximations. We give algorithms for evaluating the quantitative properties on the abstract systems. We present algorithms for counter-example based refinements for quantitative properties for both state-based and segment-based abstractions. We perform a case study on worst-case execution time of executables to evaluate the anytime verification aspect and the quantitative abstractions we proposed.
Supplemental Material
- M. Boddy. Anytime problem solving using dynamic programming. In AAAI, pages 738--743, 1991. Google Scholar
Digital Library
- E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM, 50(5):752--794, 2003. Google Scholar
Digital Library
- J. Cochet-Terrasson, G. Cohen, S. Gaubert, M. McGettrick, and J.-P. Quadrat. Numerical computation of spectral elements in max-plus algebra, 1998.Google Scholar
- B. Cook, A. Podelski, and A. Rybalchenko. Abstraction refinement for termination. In SAS, pages 87--101, 2005. Google Scholar
Digital Library
- P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238--252, 1977. Google Scholar
Digital Library
- P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL, pages 269--282, 1979. Google Scholar
Digital Library
- P. Cousot and R. Cousot. An abstract interpretation framework for termination. In POPL, pages 245--258, 2012. Google Scholar
Digital Library
- L. de Alfaro and P. Roy. Magnifying-lens abstraction for Markov decision processes. In CAV, pages 325--338, 2007. Google Scholar
Digital Library
- C. Ferdinand, F. Martin, R. Wilhelm, and M. Alt. Cache behavior prediction by abstract interpretation. Sci. Comput. Program., 35(2):163--189, 1999. Google Scholar
Digital Library
- S. Gulwani and F. Zuleger. The reachability-bound problem. In PLDI, pages 292--304, 2010. Google Scholar
Digital Library
- J. Gustafsson, A. Betts, A. Ermedahl, and B. Lisper. The m\"alardalen WCET benchmarks: Past, present and future. In WCET, pages 136--146, 2010.Google Scholar
- H. Hermanns, B. Wachter, and L. Zhang. Probabilistic CEGAR. In CAV, pages 162--175, 2008. Google Scholar
Digital Library
- M. Kattenbelt, M. Kwiatkowska, G. Norman, and D. Parker. Abstraction refinement for probabilistic software. In VMCAI, pages 182--197, 2009. Google Scholar
Digital Library
- A. Podelski and A. Rybalchenko. Transition predicate abstraction and fair termination. In POPL, pages 132--144, 2005. Google Scholar
Digital Library
- A. Prantl, M. Schordan, and J. Knoop. TuBound - a conceptually new tool for worst-case execution time analysis. In WCET, 2008.Google Scholar
- N. Shankar. A tool bus for anytime verification. Usable Verification, 2010.Google Scholar
- V. Tiwari, S. Malik, and A. Wolfe. Power analysis of embedded software: a first step towards software power minimization. In ICCAD, pages 384--390, 1994. Google Scholar
Digital Library
- R. Wilhelm, S. Altmeyer, C. Burguière, D. Grund, J. Herter, J. Reineke, B. Wachter, and S. Wilhelm. Static timing analysis for hard real-time systems. In VMCAI, pages 3--22, 2010. Google Scholar
Digital Library
- R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, F. Mueller, I. Puaut, P. Puschner, J. Staschulat, and P. Stenström. The worst-case execution-time problem - overview of methods and survey of tools. ACM Trans. Embedded Comput. Syst., 7(3), 2008. Google Scholar
Digital Library
Index Terms
Quantitative abstraction refinement
Recommendations
Quantitative abstraction refinement
POPL '13: Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesWe propose a general framework for abstraction with respect to quantitative properties, such as worst-case execution time, or power consumption. Our framework provides a systematic way for counter-example guided abstraction refinement for quantitative ...
A counterexample-guided abstraction-refinement framework for markov decision processes
The main challenge in using abstractions effectively is to construct a suitable abstraction for the system being verified. One approach that tries to address this problem is that of counterexample guided abstraction refinement (CEGAR), wherein one ...
Abstraction for model checking multi-agent systems
Model checking multi-agent systems (MAS) always suffers from the state explosion problem. In this paper we focus on an abstraction technique which is one of the major methods for overcoming this problem. For a multi-agent system, we present a novel ...







Comments