Probabilistic abstraction for model checking: An approach based on property testing

ACM Transactions on Computational Logic

Volumn 8, Issue 4, 2007, Pages

  Laplante, Sophie ^a   Lassaigne, Richard ^b,d   Magniez, Frédéric ^a   Peyronnet, Sylvain ^a,e   De Rougemont, Michel ^c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

^c UNIVERSITÉ PANTHÉON ASSAS   (France)

^d CNRS   (France)

^e Université Paris Sud ^*

Author keywords

Approximate verification; Model checking; Probabilistic abstraction; Probabilistic verification; Property testing

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBABILISTIC LOGICS; RANDOM PROCESSES;

APPROXIMATE VERIFICATION; BIPARTITENESS; PROGRAM'S TRANSITION SYSTEM; PROPERTY TESTING; SYNTACTIC PROGRAMS;

MODEL CHECKING;

EID: 34548437525     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1276920.1276922     Document Type: Article

References (21)

1. ALON, N. AND KRIVLEVICH, M. 2007. Testing k-colorability. SIAM J. Discrete Math. To appear.
2. ALON, N., FISCHER, E., KRIVELEVICH, M., AND SZEGEDY, M. 2000. Efficient testing of large graphs. Combinatorica 20, 451-476.
3. BLUM, M. AND KANNAN, S. 1995. Designing programs that check their work. J. ACM 42, 1, 269-291.
4. BLUM, M., LUBY, M., AND RUBINFELD, R. 1993. Self-testing/correcting with applications to numerical problems. J. Comp. Sys. Sci. 47, 3, 549-595.
5. BRYANT, R. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35, 8, 677-691.
6. BRYANT, R. 1991. On the complexity of VLSI implementations and graph representation of Boolean functions with application to integer multiplication. IEEE Trans. Comput. 40, 2, 205-213.
7. BRYANT, R. 1992. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Comput. Surv 24, 3, 293-318.
8. CLARKE, E., EMERSON, E., AND SISTLA, A. 1986. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Prog. Langs. Sys. 8, 2, 244-263.
9. CLARKE, E., GRUMBERG, O., AND LONG, D. 1994. Model checking and abstraction. ACM Trans. Prog. Langs. Sys. 16, 5, 1512-1542.
10. CLARKE, E., GRUMBERG, O., AND PELED, D. 1999. Model Checking. MIT Press.
11. GOLDREICH, O., GOLDWASSER, S., AND RON, D. 1998. Property testing and its connection to learning and approximation. J. ACM 45, 4, 653-750.
12. GOLDREICH, O. AND RON, D. 1999. A sublinear bipartiteness tester for bounded degree graphs. Combinatorica 19, 335-373.
13. GOLDREICH, O. AND RON, D. 2002. Property testing in bounded degree graphs. Algorithmica 32, 2, 302-343.
14. GOLDREICH, O. AND TREVISAN, L. 2003. Three Theorems Regarding Testing Graph Properties. RSA: Random Structures Algorithms 23.
15. HAJNAL, A., MAASS, W., AND TURÁN, G. 1988. On the communication complexity of graph properties. Proceedings of the 20th ACM Symposium on the Theory of Computing, pp. 186-191.
16. HOEFFDING, W 1963. Probability inequalities for sums of bounded random variables. J. Am. Stat. Assn. 58, pp. 13-30.
17. JANSON, S., LUCZAK, T., AND RUCIŃSKI, A. 2000. Random Graphs. Wiley-Interscience Series in De-screte Mathematics and Optimization. John Wiley.
18. KUSHILEVITZ, E. AND NISAN, N. 1997. Communication Complexity. Cambridge University Press.
19. MCMILLAN, K. 1993. Symbolic Model Checking. Kluwer Academic Publishers.
20. RUBINFELD, R. AND SUDAN, M. 1996. Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25, 2, 23-32.
21. SZEMERÉDI, E. 1978. Regular partitions of graphs. In Éditions du CNRS, Problèmes combinatoires et théorie des graphes, pp. 399-401.