Probabilistic abstraction for model checking: an approach based on property testing
- 25 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Property Testing in Bounded Degree GraphsAlgorithmica, 2002
- Efficient Testing of Large GraphsCombinatorica, 2000
- A Sublinear Bipartiteness Tester for Bounded Degree GraphsCombinatorica, 1999
- Property testing and its connection to learning and approximationJournal of the ACM, 1998
- Robust Characterizations of Polynomials with Applications to Program TestingSIAM Journal on Computing, 1996
- Designing programs that check their workJournal of the ACM, 1995
- Symbolic Model CheckingPublished by Springer Nature ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- On the communication complexity of graph propertiesPublished by Association for Computing Machinery (ACM) ,1988
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986