References

  1. A. Adje, O. Bouissou, J. Goubault-Larrecq, E. Goubault & S. Putot (2014): Static analysis of programs with imprecise probabilistic inputs.. In: In Verified Software: Theories, Tools, Experiments, pp. 22–47, doi:10.1007/978-3-642-54108-7_2.
  2. Elvira Albert, Puri Arenas, Samir Genaim & Germán Puebla (2009): Cost Relation Systems: A Language-Independent Target Language for Cost Analysis.. Electr. Notes Theor. Comput. Sci. 248, pp. 31–46, doi:10.1016/j.entcs.2009.07.057.
  3. Mathias Bauer (1996): Approximations for Decision Making in the Dempster-Shafer Theory of Evidence.. In: UAI. Morgan Kaufmann, pp. 73–80. Available at http://arxiv.org/abs/1302.3557.
  4. Daniel Berleant & Hang Cheng (1998): A Software Tool for Automatically Verified Operations on Intervals and Probability Distributions.. Reliable Computing 4(1), pp. 71–82, doi:10.1023/A:1009954817673.
  5. Guillem Bernat, Alan Burns & Martin Newby (2005): Probabilistic timing analysis: An approach using copulas.. J. Embedded Computing 1(2), pp. 179–194.
  6. Olivier Bouissou, Eric Goubault, Jean Goubault-Larrecq & Sylvie Putot (2012): A generalization of p-boxes to affine arithmetic.. Computing 94(2-4), pp. 189–201, doi:10.1007/s00607-011-0182-8.
  7. Patrick Cousot & Michael Monerau (2012): Probabilistic Abstract Interpretation.. In: ESOP, LNCS 7211, pp. 169–193, doi:10.1007/978-3-642-28869-2_9.
  8. Dorothy E. Denning (1976): A Lattice Model of Secure Information Flow.. Commun. ACM 19(5), pp. 236–243, doi:10.1145/360051.360056.
  9. S. Destercke & D. Dubois (2009): The role of generalised p-boxes in imprecise probability models. In: 6th International Symposium on Imprecise Probability: Theories and Applications, pp. 179–188.
  10. Jan Dhaene, Michel Denuit, Marc J Goovaerts, R Kaas & David Vyncke (2002): The Concept of Comonotonicity in Actuarial Science and Finance: Theory. Insurance, mathematics & economics 31(2), pp. 133–161, doi:10.1016/S0167-6687(02)00135-X.
  11. Scott Ferson (2014): Model uncertainty in risk analysis. Tech. report. Centre de Recherches de Royallieu, Universite de Technologie de Compiegne.
  12. Scott Ferson, Vladik Kreinovich, Lev Ginzburg, Davis S. Myers & Kari Sentz (2002): Constructing Probability Boxes and Dempster-Shafer Structures. SAND2002-4015. Sandia National Laboratories.
  13. Philippe Flajolet, Bruno Salvy & Paul Zimmermann (1991): Automatic Average-Case Analysis of Algorithm.. Theor. Comput. Sci. 79(1), pp. 37–109, doi:10.1016/0304-3975(91)90145-R.
  14. Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norman & David Parker (2011): Automated Verification Techniques for Probabilistic Systems.. In: SFM, LNCS 6659, pp. 53–113, doi:10.1007/978-3-642-21455-4_3.
  15. Ang Gao (2013): Modular average case analysis: Language implementation and extension. Ph.d. thesis. University College Cork.
  16. Jaco Geldenhuys, Matthew B Dwyer & Willem Visser (2012): Probabilistic symbolic execution. In: Proceedings of the 2012 International Symposium on Software Testing and Analysis, pp. 166–176, doi:10.1145/2338965.2336773.
  17. Jean Gordon & Edward H. Shortliffe (1984): The Dempster-Shafer Theory of Evidence. In: Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project, pp. 21 pp.
  18. Xi Guo, Menouer Boubekeur, J. McEnery & David Hickey (2007): ACET based scheduling of soft real-time systems: An approach to optimise resource budgeting. International Journal of Computers and Communications 1(1), pp. 82–86.
  19. Rakowsky Uwe Kay (2007): Fundamentals of the Dempster-Shafer theory and its applications to system safety and reliability modelling. International Journal of Reliability, Quality and Safety Engineering 14(06), pp. 579–601, doi:10.1142/S0218539307002817.
  20. Jens Knoop, Laura Kovács & Jakob Zwirchmayr (2011): Symbolic Loop Bound Computation for WCET Analysis.. In: Ershov Memorial Conference, LNCS 7162, pp. 227–242, doi:10.1007/978-3-642-29709-0_20.
  21. Dexter Kozen (1981): Semantics of Probabilistic Programs.. J. Comput. Syst. Sci. 22(3), pp. 328–350, doi:10.1016/0022-0000(81)90036-2.
  22. M. Kwiatkowska, G. Norman & D. Parker (September 2010): Advances and challenges of probabilistic model checking.. In: 48th Annual Allerton Conference on Communication, Control, and Computing, pp. 1691–1698, doi:10.1109/ALLERTON.2010.5707120.
  23. U. Liqat, S. Kerrison, A. Serrano, K. Georgiou, P. Lopez-Garcia, N. Grech, M. V. Hermenegildo & K. Eder (2013): Energy Consumption Analysis of Programs based on XMOS ISA Level Models. In: 23rd InternatioFnal Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR, LNCS 8901, pp. 72–90, doi:10.1007/978-3-319-14125-1_5.
  24. Pedro López-García, Luthfi Darmawan & Francisco Bueno (2010): A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification.. In: ICLP (Technical Communications), LIPIcs 7, pp. 104–113.
  25. David Monniaux (2000): Abstract Interpretation of Probabilistic Semantics.. In: SAS, LNCS 1824, pp. 322–339, doi:10.1007/978-3-540-45099-3_17.
  26. Carroll Morgan, Annabelle McIver & Karen Seidel (1996): Probabilistic Predicate Transformers.. ACM Trans. Program. Lang. Syst. 18(3), pp. 325–353, doi:10.1145/229542.229547.
  27. Alessandra Di Pierro, Chris Hankin & Herbert Wiklicky (2006): Abstract Interpretation for Worst and Average Case Analysis.. In: Program Analysis and Compilation, LNCS 4444, pp. 160–174, doi:10.1007/978-3-540-71322-7_8.
  28. Alessandra Di Pierro, Herbert Wiklicky, Gabriele Puppis & Tiziano Villa (2013): Probabilistic data flow analysis: a linear equational approach. In: Proc. Fourth Int. Symp. on Games, Automata, Logics and Formal Verification, GandALF 119, pp. 150–165, doi:10.4204/EPTCS.119.14.
  29. Hector Soza Pollman, Manuel Carro & Pedro Lopez Garcia (2009): Probabilistic Cost Analysis of Logic Programs: A First Case Study. INGENIARE - Revista Chilena de Ingeniera 17(2), pp. 195–204.
  30. Mads Rosendahl (1989): Automatic Complexity Analysis.. In: FPCA, pp. 144–156, doi:10.1145/99370.99381.
  31. Mads Rosendahl (2002): Simple Driving Techniques.. In: The Essence of Computation, LNCS 2566, pp. 404–419, doi:10.1007/3-540-36377-7_18.
  32. S. Sankaranarayanan, A. Chakarov & S. Gulwani (June 2013): Static analysis for probabilistic programs: inferring whole program properties from finitely many paths. In: PLDI. ACM., pp. 447–458, doi:10.1145/2462156.2462179.
  33. Michel P. Schellekens (2008): A modular calculus for the average cost of data structuring.. Springer, doi:10.1007/978-0-387-73384-5.
  34. Lars Schor, Iuliana Bacivarov, Hoeseok Yang & Lothar Thiele (2012): Worst-Case Temperature Guarantees for Real-Time Applications on Multi-core Systems.. In: IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 87–96, doi:10.1007/s10836-013-5397-5.
  35. A. Uwimbabazi (2013): Extended probabilistic symbolic execution. University of Stellenbosch.
  36. Dennis M. Volpano, Cynthia E. Irvine & Geoffrey Smith (1996): A Sound Type System for Secure Flow Analysis.. Journal of Computer Security 4(2/3), pp. 167–188, doi:10.3233/JCS-1996-42-304.
  37. Ben Wegbreit (1975): Mechanical Program Analysis.. Commun. ACM 18(9), pp. 528–539, doi:10.1145/361002.361016.
  38. Adam Wierman, Lachlan L. H. Andrew & Ao Tang (2008): Stochastic Analysis of Power-Aware Scheduling. In: Proceedings of Allerton Conference on Communication, Control and Computing. Urbana-Champaign, IL, pp. 1278–1283, doi:10.1109/ALLERTON.2008.4797707.
  39. Nic Wilson (2000): Algorithms for Dempster-Shafer Theory. In: Handbook of defeasible reasoning and uncertainty management systems. Springer Netherlands, pp. 421–475, doi:10.1007/978-94-017-1737-3_10.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org