Quantitative analysis of systems using game-theoretic learning

Transactions on Embedded Computing Systems

Volumn 11, Issue SUPPL. 2, 2012, Pages

  Seshia, Sanjit A ^a   Rakhlin, Alexander ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Cyber physical systems; Embedded software; Execution time; Formal verification; Game theory; Online learning; Quantitative properties; Real time systems

Indexed keywords

CYBER PHYSICAL SYSTEMS (CPSS); EXECUTION TIME; FORMAL VERIFICATIONS; ONLINE LEARNING; QUANTITATIVE PROPERTIES;

ALGORITHMS; AUTOMATIC TEST PATTERN GENERATION; EMBEDDED SOFTWARE; EMBEDDED SYSTEMS; GAME THEORY; GRAPH THEORY; ONLINE SYSTEMS; PROBABILITY DISTRIBUTIONS; PROGRAM PROCESSORS; REAL TIME SYSTEMS;

SOFTWARE TESTING;

EID: 84867127398     PISSN: 15399087     EISSN: 15583465     Source Type: Journal    
DOI: 10.1145/2331147.2331165     Document Type: Article

References (32)

1. AUER, P., CESA-BIANCHI, N., FREUND, Y., AND SCHAPIRE, R. E. 2003. The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32, 1, 48-77.
2. AWERBUCH, B. AND KLEINBERG, R. D. 2004. Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04). ACM, New York, NY, USA, 45-53.
3. BARRETT, C., SEBASTIANI, R., SESHIA, S. A., AND TINELLI, C. 2009. Satisfiability modulo theories. In Handbook of Satisfiability, A. Biere, H. van Maaren, and T. Walsh Eds., vol. 4. IOS Press, Amsterdam, Chapter 8.
4. BRYANT, R. E., KROENING, D., OUAKNINE, J., SESHIA, S. A., STRICHMAN, O., AND BRADY, B. 2007. Deciding bit-vector arithmetic with abstraction. In Proceedings of theWorkshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 4424. Springer, Berlin, 358-372.
5. CESA-BIANCHI, N. AND LUGOSI, G. 2006. Prediction, Learning, and Games. Cambridge University Press.
6. CHAKRABARTI, A., CHATTERJEE, K., HENZINGER, T. A., KUPFERMAN, O., AND MAJUMDAR, R. 2005. Verifying quantitative properties using bound functions. In Proceedings of the 13th IFIPWG 10.5 International Conference on Correct Hardware Design and Verification Methods (CHARME). Lecture Notes in Computer Science, vol. 3725. 50-64.
7. EPPSTEIN, D. 1998. Finding the k shortest paths. SIAM J. Comput. 28, 2, 652-673.
8. GY ÖRGY, A., LINDER, T., LUGOSI, G., AND OTTUCS ́AK, G. 2007. The on-line shortest path problem under partial monitoring. J. Mach. Learn. Res. 8, 2369-2403.
9. IRANI, S., SINGH, G., SHUKLA, S., AND GUPTA, R. 2005. An overview of the competitive and adversarial approaches to designing dynamic power management strategies. IEEE Trans. VLSI 13, 12, 1349-1361.
10. KIRNER, R. AND PUSCHNER, P. 2008. Obstacles in worst-case execution time analysis. In Proceedings of the IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC). 333-339.
11. LEE, E. A. 2007. Computing foundations and practice for cyber-physical systems: A preliminary report. Tech. rep., UCB/EECS-2007-72, University of California at Berkeley.
12. LI, X., LIANG, Y., MITRA, T., AND ROYCHOUDHURY, A. 2005. Chronos: A timing analyzer for embedded software. Tech. rep., National University of Singapore. http://www.comp.nus.edu.sg/rpembed/chronos/chronos-tool.pdf.
13. LI, Y.-T. S. AND MALIK, S. 1999. Performance Analysis of Real-Time Embedded Software. Kluwer Academic, Berlin.
14. MCCABE, T. J. 1976. A complexity measure. IEEE Trans. Softw. Eng. 2, 4, 308-320.
15. MCMAHAN, H. B. AND BLUM, A. 2004. Online geometric optimization in the bandit setting against an adaptive adversary. In Proceedings of the Annual Conference on Learning Theory (COLT'04). 109-123.
16. NEMER, F.,CASS, H., SAINRAT, P.,BAHSOUN, J.-P., AND MICHIEL, M. D. 2006. Papabench: A free real-time benchmark. In Proceedings of the 6th International Workshop on Worst-Case Execution Time (WCET) Analysis.
17. WILHELM, R., ENGBLOM, J., ERMEDAHL, A., HOLSTI, N., THESING, S., WHALLEY, D., BERNAT, G., FERDINAND, C.,HECKMANN, R.,MITRA, T.,MUELLER, F., PUANT, I., PUSCHNER, P., STASCHULAT, J., AUER, P., CESA-BIANCHI, N., FREUND, Y., AND SCHAPIRE, R. E. 2003. The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32, 1, 48-77.
18. AWERBUCH, B. AND KLEINBERG, R. D. 2004. Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC'04). ACM, New York, NY, USA, 45-53.
19. BARRETT, C., SEBASTIANI, R., SESHIA, S. A., AND TINELLI, C. 2009. Satisfiability modulo theories. In Handbook of Satisfiability, A. Biere, H. van Maaren, and T. Walsh Eds., vol. 4. IOS Press, Amsterdam, Chapter 8.
20. BRYANT, R. E., KROENING, D., OUAKNINE, J., SESHIA, S. A., STRICHMAN, O., AND BRADY, B. 2007. Deciding bit-vector arithmetic with abstraction. In Proceedings of theWorkshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Lecture Notes in Computer Science, vol. 4424. Springer, Berlin, 358-372.
21. CESA-BIANCHI, N. AND LUGOSI, G. 2006. Prediction, Learning, and Games. Cambridge University Press.
22. CHAKRABARTI, A., CHATTERJEE, K., HENZINGER, T. A., KUPFERMAN, O., AND MAJUMDAR, R. 2005. Verifying quantitative properties using bound functions. In Proceedings of the 13th IFIPWG 10.5 International Conference on Correct Hardware Design and Verification Methods (CHARME). Lecture Notes in Computer Science, vol. 3725. 50-64.
23. EPPSTEIN, D. 1998. Finding the k shortest paths. SIAM J. Comput. 28, 2, 652-673.
24. GY ÖRGY, A., LINDER, T., LUGOSI, G., AND OTTUCS ́AK, G. 2007. The on-line shortest path problem under partial monitoring. J. Mach. Learn. Res. 8, 2369-2403.
25. IRANI, S., SINGH, G., SHUKLA, S., AND GUPTA, R. 2005. An overview of the competitive and adversarial approaches to designing dynamic power management strategies. IEEE Trans. VLSI 13, 12, 1349-1361.
26. KIRNER, R. AND PUSCHNER, P. 2008. Obstacles in worst-case execution time analysis. In Proceedings of the IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC). 333-339.
27. LEE, E. A. 2007. Computing foundations and practice for cyber-physical systems: A preliminary report. Tech. rep., UCB/EECS-2007-72, University of California at Berkeley.
28. LI, X., LIANG, Y., MITRA, T., AND ROYCHOUDHURY, A. 2005. Chronos: A timing analyzer for embedded software. Tech. rep., National University of Singapore. http://www.comp.nus.edu.sg/rpembed/chronos/chronos-tool.pdf.
29. LI, Y.-T. S. AND MALIK, S. 1999. Performance Analysis of Real-Time Embedded Software. Kluwer Academic, Berlin.
30. MCCABE, T. J. 1976. A complexity measure. IEEE Trans. Softw. Eng. 2, 4, 308-320.
31. MCMAHAN, H. B. AND BLUM, A. 2004. Online geometric optimization in the bandit setting against an adaptive adversary. In Proceedings of the Annual Conference on Learning Theory (COLT'04). 109-123.
32. NEMER, F.,CASS, H., SAINRAT, P.,BAHSOUN, J.-P., AND MICHIEL, M. D. 2006. Papabench: A free real-time benchmark. In Proceedings of the 6th International Workshop on Worst-Case Execution Time (WCET) Analysis.