Further steps towards efficient runtime verification: Handling probabilistic cost models

2012 1st International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches, FormSERA 2012 - Proceedings

Volumn , Issue , 2012, Pages 2-8

  Filieri, Antonio ^a   Ghezzi, Carlo ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE TIME; HIGH-LEVEL MODELS; MARKOV REWARD MODEL; MODEL ASSUMPTIONS; PROBABILISTIC COSTS; PROBABILISTIC MODEL CHECKING; RUN-TIME VERIFICATION; RUNTIMES; SELF-HEALING; STATE MACHINE; STATES AND TRANSITIONS; SYSTEM BEHAVIORS; TEST CASE;

COSTS; MODEL CHECKING; SOFTWARE ENGINEERING;

AGILE MANUFACTURING SYSTEMS;

EID: 84864225074     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FormSERA.2012.6229785     Document Type: Conference Paper

References (18)

1. B. H. C. Cheng, R. de Lemos, H. Giese, P. Inverardi, and J. Magee, Eds., Software Engineering for Self-Adaptive Systems, ser. LNCS, vol. 5525. Springer, 2009.
2. I. Epifani, C. Ghezzi, R. Mirandola, and G. Tamburrelli, "Model evolution by run-time parameter adaptation," in ICSE, 2009.
3. A. Filieri, C. Ghezzi, and G. Tamburrelli, "A formal approach to adaptive software: continuous assurance of non-functional requirements," Formal Aspects of Computing, pp. 1-24, 2011.
4. -, "Run-time efficient probabilistic model checking," in ICSE. New York, NY, USA: ACM, 2011, pp. 341-350.
5. A. Filieri, C. Ghezzi, A. Leva, and M. Maggio, "Self-adaptive software meets control theory: A preliminary approach supporting reliability requirements," in ASE 2011, nov. 2011, pp. 283-292.
6. M. Kwiatkowska, G. Norman, and D. Parker, "Prism: Probabilistic symbolic model checker," in Computer Performance Evaluation: Modelling Techniques and Tools, ser. LNCS. Springer, 2002, vol. 2324, pp. 113-140.
7. C. Baier and J.-P. Katoen, Principles of Model Checking. The MIT Press, 2008.
8. M. Kwiatkowska, G. Norman, and D. Parker, "Stochastic model checking," in Formal Methods for Performance Evaluation, ser. LNCS. Springer, 2007, vol. 4486, pp. 220-270.
9. S. Ross, Stochastic Processes. Wiley New York, 1996.
10. A. Quarteroni, R. Sacco, and F. Saleri, Numerical mathematics. Springer Verlag, 2007, vol. 37.
11. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," Journal of Symbolic Computation, vol. 9, no. 3, pp. 251-280, 1990.
12. R. Yuster and U. Zwick, "Fast sparse matrix multiplication," ACM Trans. Algorithms, vol. 1, pp. 2-13, July 2005.
13. H. T. Kung, "The computational complexity of algebraic numbers," in Proceedings of the fifth annual ACM symposium on Theory of computing, ser. STOC '73. New York, NY, USA: ACM, 1973, pp. 152-159.
14. A. Bojanczyk, "Complexity of solving linear systems in different models of computation," SIAM Journal on Numerical Analysis, vol. 21, no. 3, pp. 591-603, 1984.
15. T. Davis, Direct methods for sparse linear systems. Society for Industrial Mathematics, 2006, vol. 2.
16. E. Hahn, H. Hermanns, and L. Zhang, "Probabilistic reachability for parametric markov models," Model Checking Software, pp. 88-106, 2009.
17. C. Daws, "Symbolic and parametric model checking of discrete-time markov chains," ICTAC, pp. 280-294, 2005.
18. E. Hahn, T. Han, and L. Zhang, "Synthesis for pctl in parametric markov decision processes," in NASA FM. Springer, 2011, vol. 6617, pp. 146-161.