Possibilistic and probabilistic abstraction-based model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2399, Issue , 2002, Pages 115-134

  Huth, Michael ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGEBRA; COMPUTER CIRCUITS; SEMANTICS; TEMPORAL LOGIC;

ABSTRACT MODELS; FINITE STATE SPACES; POSSIBILISTIC; PROBABILISTIC ABSTRACTION; PROBABILISTIC MODELS; PROBABILISTIC SEMANTICS; STATE TRANSITIONS; VERIFICATION RESULTS;

MODEL CHECKING;

EID: 23044532135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45605-8_8     Document Type: Conference Paper

References (47)

1. S. Andova and J. C. M. Baeten. Abstraction in Probabilistic Process Algebras. In T. Margaria and W. Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), volume 2031 of Lecture Notes in Computer Science, pages 204-219, Genova, Italy, April 2-6 2001. Springer Verlag.
2. C. Baier, E.M. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic Model Checking for Probabilistic Processes. In Proc. ICALP’97, volume 1256 of Lecture Notes in Computer Science, pages 430-440, 1997.
3. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching-time logic with fairness. Journal of Distributed Computing, 11:125-155, 1998.
4. T. Ball, A. Podelski, and S.K. Rajamani. Boolean and Cartesian Abstraction for Model Checking C Programs. In T. Margaria and W. Yi, editors, Proceedings of TACAS 2001, volume 2031 of LNCS, pages 268-283, Genova, Italy, April 2001. Springer Verlag.
5. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proceedings of the 11th Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274-287. Springer Verlag, July 1999.
6. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of CONCUR 2000 (11th International Conference on Concurrency Theory), volume 1877 of Lecture Notes in Computer Science, pages 168-182. Springer Verlag, August 2000.
7. R. R. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
8. D. Clark, C. Hankin, S. Hunt, and R. Nagarajan. Possibilistic Information Flow is safe for Probabilistic Non-Interference. In Workshop on Issues in the Theory of Security (WITS’00), Geneva, Switzerland, 7-8 July 2000.
9. E. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded Model Checking Using Satisfiability Solving. Formal Methods in System Design, 19(1), July 2001.
10. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, 1994.
11. R. Cleaveland, P. Iyer, and D. Yankelevich. Optimality in abstractions of model checking. In SAS’95: Proc. Second Static Analysis Symposium, Lecture Notes in Computer Science 983, pages 51-63. Springer, 1995.
12. C. Courcoubetis and M. Yannakakis. The Complexity of Probabilistic Verification. Journal of the Association of Computing Machinery, 42(4):857-907, July 1995.
13. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs. In Proc. 4th ACM Symp. on Principles of Programming Languages, pages 238-252. ACM Press, 1977.
14. P. Cousot and R. Cousot. Temporal abstract interpretation. In Conference Record of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 12-25, Boston, Mass., January 2000. ACM Press, New York, NY.
15. P.R. D’Argenio, B. Jeannet, H.E. Jensen, and K.G. Larsen. Reachability Analysis of Probabilistic Systems by Successive Refinements. In L. de Alfaro and S. Gilmore, editors, Process Algebra and Probabilistic Methods: Performance Modelling and Verification, volume 2165 of Lecture Notes in Computer Science, pages 39-56, Aachen, Germany, September 12-14 2001. Springer Verlag.
16. C. Derman. Finite-State Markovian Decision Processes. Academic Press, New York, 1970.
17. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating Labeled Markov Processes. In 15th Annual IEEE Symposium on Logic in Computer Science (LICS’00), Santa Barbara, California, 26-29 June 2000. IEEE Computer Society Press.
18. E.-E. Doberkat. The Converse of a Probabilistic Relation. Technical Report 113, Fachbereich Informatik, Universität Dortmund, June 2001.
19. E.-E. Doberkat. The Demonic Product of Probabilistic Relations. In Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, Grenoble, France, April 6-14 2002. Springer Verlag. To appear.
20. D. Dubois, J. Lang, and H. Pade. Possibilistic logic, volume 3 of Handbook of Logic in Artificial Intelligence and Logic Programming, pages 439-514. Oxford University Press, 1992.
21. M. Giry. A categorical approach to probability theory. In B. Banaschewski, editor, Categorical Aspects of Topology and Analysis, volume 915 of Lecture Notes in Mathematics, pages 68-85. Springer Verlag, 1981.
22. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based Model Checking using Modal Transition Systems. In Proceedings of the International Conference on Theory and Practice of Concurrency, volume 2154 of Lecture Notes in Computer Science, pages 426-440. Springer Verlag, August 2001.
23. P.R. Halmos. Measure Theory. Graduate Texts in Mathematics 18. Springer Verlag, 1950.
24. H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Science, Uppsala University, Uppsala, Sweden, 1991.
25. A. Harding, M. Ryan, and P.-Y. Schobbens. Approximating ATL* in ATL. In Third International Workshop on Verification, Model Checking and Abstract Interpretation, volume 2294 of Lecture Notes in Computer Science, pages 289-301, Venice, Italy, January 21-22 2002. Springer Verlag.
26. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
27. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
28. M. Huth. Model checking modal transition systems using Kripke structures. In Third International Workshop on Verification, Model Checking and Abstract Interpretation, volume 2294 of Lecture Notes in Computer Science, pages 302-316, Venice, Italy, January 21-22 2002. Springer Verlag.
29. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: a foundation for three-valued program analysis. In Sands D., editor, Proceedings of the European Symposium on Programming (ESOP 2001), pages 155-169. Springer Verlag, April 2001.
30. B. Jonsson and K.G. Larsen. Specification and Refinement of Probabilistic Processes. In 6th Annual IEEE Symposium on Logic in Computer Science, pages 266-277, Amsterdam, The Netherlands, 15-18 July 1991. IEEE Computer Society Press.
31. P. Kelb. Model checking and abstraction: a framework preserving both truth and failure information. Technical Report OFFIS, University of Oldenburg, Germany, 1994.
32. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
33. K.G. Larsen and B. Thomsen. A Modal Process Logic. In Third Annual Symposium on Logic in Computer Science, pages 203-210. IEEE Computer Society Press, 1988.
34. A. McIver. A Generalization of Stationary Distributions, and Probabilistic Program Algebra. In MFPS 2001: Seventeenth Conference on the Mathematical Foundations of Programming Semantics, volume 45 of Electronic Notes in Theoretical Computer Science, Aarhus, Denmark, 23-26 May 2001. Elsevier.
35. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
36. D. Monniaux. Abstract interpretation of programs as Markov decision processes. Technical report, Départment d’Informatique, école Normale Supérieure, 45, rue d’Ulm, 75230 Paris cedex 5, France, 2001.
37. C. Morgan, A. McIver, K. Seidel, and J.W. Sanders. Refinement-oriented probability for CSP. Formal Aspects of Computing, 8(6):617-647, 1996.
38. Prakash Panangaden. The Category of Markov Kernels. In M. Kwiatkowska C. Baier, M. Huth and M. Ryan, editors, Electronic Notes in Theoretical Computer Science, volume 22. Elsevier Science Publishers, 2000.
39. D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, In Proc. of the 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167-183. Springer Verlag, 1989.
40. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate non-interference. Submitted, February 2002.
41. A. Di Pierro and H. Wiklicky. Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation. In Proc. of the 2nd Int’l ACM SIGPLAN conference on Principles and Practice of Declarative Programming (PPDP 2000), pages 127-138, Montreal, Canada, September 20-23 2000. ACM Press.
42. D.E. Rumelhart, J.L. McClelland, and the PDP Research Group. Parallel Distributed Processing, volume 1 of Explotations in the Microstructure of Cognition. The MIT Press, 1986.
43. A. Sabelfeld and D. Sands. A per model of secure information flow in sequential programs. In Programming Languages and Systems, 8th European Symposium on Programming (ESOP’99), volume 1576 of Lecture Notes in Computer Science, pages 40-58. Springer Verlag, 1999.
44. D.A. Schmidt. From Trace Sets to Modal-Transition Systems by Stepwise Abstract Interpretation. Electronic Notes in Theoretical Computer Science, March 2001. Proc.Workshop on Structure Preserving Relations, Amagasaaki, Japan. To appear.
45. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th IEEE Symp. on Foundations of Computer Science, pages 327-338, Portland, Oregon, October1985.
46. M. Vardi. Pro babilistic Linear-Time Model Checking: an Overview of The Automata-Theoretic Approach. In J.-P. Katoen, editor, Formal Methods for Real-Time and Probabilistic Systems, 5th Int’l AMAST Workshop (ARTS’99), volume 1601 of Lecture Notes in Computer Science, pages 265-276, Bamberg, Germany, 26-28 May 1999. Springer Verlag.
47. L. Zuck, A. Pnueli, and Y. Kesten. Automatic Verification of Probabilistic Free Choice. In A. Cortesi, editor, Third International Workshop on Verification, Model Checking and Abstract Interpretation, volume 2294, pages 208-224, Venice, Italy, 21-22 January 2002. Springer Verlag.