{"id":"https://openalex.org/W350391862","doi":"https://doi.org/10.1007/978-3-642-54830-7_12","title":"Complexity of Model-Checking Call-by-Value Programs","display_name":"Complexity of Model-Checking Call-by-Value Programs","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W350391862","doi":"https://doi.org/10.1007/978-3-642-54830-7_12","mag":"350391862"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-54830-7_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-54830-7_12","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-54830-7_12.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-54830-7_12.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090766554","display_name":"Takeshi Tsukada","orcid":"https://orcid.org/0000-0002-2824-8708"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Takeshi Tsukada","raw_affiliation_strings":["JSPS Postdoctoral Fellow for Research Abroad, Japan","University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"JSPS Postdoctoral Fellow for Research Abroad, Japan","institution_ids":[]},{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100772473","display_name":"Naoki Kobayashi","orcid":"https://orcid.org/0000-0002-0537-0604"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Naoki Kobayashi","raw_affiliation_strings":["The University of Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"The University of Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090766554"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7239,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.71546443,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"180","last_page":"194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9024797081947327},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7377560138702393},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6957173347473145},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6819909811019897},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6332687139511108},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5606837272644043},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5020995140075684},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.47286391258239746},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4514261782169342},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.44323185086250305},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.41687777638435364},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.37579280138015747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3520077168941498},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35103774070739746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23478099703788757},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.16852331161499023}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9024797081947327},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7377560138702393},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6957173347473145},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6819909811019897},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6332687139511108},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5606837272644043},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5020995140075684},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.47286391258239746},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4514261782169342},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.44323185086250305},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.41687777638435364},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37579280138015747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3520077168941498},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35103774070739746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23478099703788757},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.16852331161499023},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-54830-7_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-54830-7_12","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-54830-7_12.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.650.2549","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.650.2549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-kb.is.s.u-tokyo.ac.jp/~tsukada/papers/cbv-reachability.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/978-3-642-54830-7_12","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-54830-7_12","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-54830-7_12.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2155035233","display_name":"\u7d4c\u6e08\u72af\u7f6a\u306e\u5b9f\u614b\u4e26\u3073\u8a34\u8ffd\u51e6\u7f70\u4e0a\u306e\u554f\u984c\u70b9","funder_award_id":"20001","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5786340949","display_name":null,"funder_award_id":"KAKENHI Grant Number","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7006592895","display_name":null,"funder_award_id":"23220001","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W350391862.pdf","grobid_xml":"https://content.openalex.org/works/W350391862.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W152732218","https://openalex.org/W1969045031","https://openalex.org/W1981638222","https://openalex.org/W1989109065","https://openalex.org/W1992878210","https://openalex.org/W1994090338","https://openalex.org/W2036753951","https://openalex.org/W2070324762","https://openalex.org/W2081367192","https://openalex.org/W2123733847","https://openalex.org/W2128529251","https://openalex.org/W2134918221","https://openalex.org/W2138308600","https://openalex.org/W2141505892","https://openalex.org/W2150985604","https://openalex.org/W2158244462","https://openalex.org/W2160005349","https://openalex.org/W2168627357","https://openalex.org/W2169417140","https://openalex.org/W2294925939","https://openalex.org/W2499161924","https://openalex.org/W2808195962","https://openalex.org/W3019389875","https://openalex.org/W3101847013","https://openalex.org/W3103259279","https://openalex.org/W4249452185"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W2099490078","https://openalex.org/W4287199681","https://openalex.org/W3172202899","https://openalex.org/W2948165904","https://openalex.org/W64121912"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}