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

Proceedings-Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 30-39

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

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

^c CNRS   (France)

^d UNIVERSITÉ PANTHÉON ASSAS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBABILITY; PROGRAM DEBUGGING; SYNTACTICS;

PROBABILISTIC ABSTRACTION;

COMPUTER SCIENCE;

EID: 0036051155     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2002.1029815     Document Type: Article

References (17)

1. Testing k-colorability
2. Efficient testing of large graphs
3. Designing programs that check their work
4. Self-testing/correcting with applications to numerical problems
5. Graph-based algorithms for boolean function manipulation
6. Symbolic boolean manipulation with ordered binary decision diagrams
7. Automatic verification of finite-state concurrent systems using temporal logic specifications
8. Model checking and abstraction
9. Property testing and its connection to learning and approximation
10. A sublinear bipartiteness tester for bounded degree graphs
11. Property testing in bounded degree graphs
12. On the communication complexity of graph properties
13. Robust characterizations of polynomials with applications to program testing
14. Regular partitions of graphs