{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:13:18Z","timestamp":1694625198497},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T00:00:00Z","timestamp":1131494400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T00:00:00Z","timestamp":1131494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s10009-005-0199-4","type":"journal-article","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T08:53:30Z","timestamp":1131526410000},"page":"1-3","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Why you should definitely read this special section"],"prefix":"10.1007","volume":"8","author":[{"given":"Hubert","family":"Garavel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Hatcliff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,9]]},"reference":[{"key":"199_CR1","doi-asserted-by":"crossref","unstructured":"Bartzis C, Bultan T (2005) Efficient BDDs for bounded arithmetic constraints. Int J Softw Tools Technol Transfer 8(1)","DOI":"10.1007\/s10009-004-0171-8"},{"key":"199_CR2","doi-asserted-by":"crossref","unstructured":"Bozga L, Lakhnech Y, P\u00e9rin M (2005) Pattern-based abstraction for verifying secrecy in protocols. Int J Softw Tools Technol Transfer 8(1)","DOI":"10.1007\/s10009-005-0189-6"},{"key":"199_CR3","doi-asserted-by":"crossref","unstructured":"Ciardo G, Marmorstein R, Siminiceanu R (2005) The saturation algorithm for symbolic state space exploration. Int J Softw Tools Technol Transfer 8(1)","DOI":"10.1007\/s10009-005-0188-7"},{"key":"199_CR4","doi-asserted-by":"crossref","unstructured":"Garavel H, Hatcliff J (2003) Proceedings of the 9th International Conference on Tools and Algorithms for Construction and Analysis of Systems TACAS\u20192003, Warsaw, Poland, April 2003. Lecture notes in computer science, vol 2619. Springer, Berlin Heidelberg New York","DOI":"10.1007\/3-540-36577-X"},{"key":"199_CR5","doi-asserted-by":"crossref","unstructured":"Groote JF, van Ham F (2005) Interactive visualization of large state graphs. Int J Softw Tools Technol Transfer 8(1)","DOI":"10.1007\/s10009-005-0198-5"},{"key":"199_CR6","doi-asserted-by":"crossref","unstructured":"Mateescu R (2005) CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems. Int J Softw Tools Technol Transfer 8(1)","DOI":"10.1007\/s10009-005-0194-9"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-005-0199-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10009-005-0199-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-005-0199-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-005-0199-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T01:06:45Z","timestamp":1652490405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10009-005-0199-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11,9]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["199"],"URL":"https:\/\/doi.org\/10.1007\/s10009-005-0199-4","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11,9]]},"assertion":[{"value":"9 November 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}