{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T18:41:36Z","timestamp":1743619296801},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/lics.2002.1029815","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:14:31Z","timestamp":1056564871000},"page":"30-39","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic abstraction for model checking: an approach based on property testing"],"prefix":"10.1109","author":[{"given":"S.","family":"Laplante","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Lassaigne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Magniez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Peyronnet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"de Rougemont","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","first-page":"399","article-title":"Regular partitions of graphs","author":"szemer?di","year":"1978","journal-title":"Proble?mes combinatoires et the?orie des graphes"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62228"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050060"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0078-7"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200880"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070001"},{"key":"1","article-title":"Testing k-colorability","author":"alon","year":"0","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/5397.5399"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/136035.136043"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"journal-title":"Model checking","year":"1999","author":"clarke","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/186025.186051"}],"event":{"name":"17th Annual IEEE Symposium on Logic in Computer Science","acronym":"LICS-02","location":"Copenhagen, Denmark"},"container-title":["Proceedings 17th Annual IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8005\/22127\/01029815.pdf?arnumber=1029815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T16:14:40Z","timestamp":1489162480000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1029815\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/lics.2002.1029815","relation":{},"subject":[]}}