{"id":"https://openalex.org/W1994404058","doi":"https://doi.org/10.2168/lmcs-8(1:4)2012","title":"A type reduction theory for systems with replicated components","display_name":"A type reduction theory for systems with replicated components","publication_year":2012,"publication_date":"2012-02-16","ids":{"openalex":"https://openalex.org/W1994404058","doi":"https://doi.org/10.2168/lmcs-8(1:4)2012","mag":"1994404058"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(1:4)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:4)2012","pdf_url":"https://lmcs.episciences.org/869/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/869/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tomasz Mazur","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tomasz Mazur","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Gavin Lowe","orcid":null},"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":false,"raw_author_name":"Gavin Lowe","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3487,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60456643,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 8, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9853000044822693,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9853000044822693,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.002099999925121665,"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/reduction","display_name":"Reduction (mathematics)","score":0.555899977684021},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5178999900817871},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.503000020980835},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.49410000443458557},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.4837999939918518},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.4706999957561493},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.46630001068115234},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.45840001106262207},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.44290000200271606},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.4374000132083893}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6883999705314636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5656999945640564},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.555899977684021},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5178999900817871},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.503000020980835},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4948999881744385},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.49410000443458557},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.4837999939918518},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.4706999957561493},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.46630001068115234},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.45840001106262207},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.44290000200271606},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.4374000132083893},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41499999165534973},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4104999899864197},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.3953999876976013},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.3815000057220459},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C2776157432","wikidata":"https://www.wikidata.org/wiki/Q1375683","display_name":"Normality","level":2,"score":0.33090001344680786},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C56858530","wikidata":"https://www.wikidata.org/wiki/Q15947151","display_name":"Reduction strategy","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27950000762939453},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.26589998602867126},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.25949999690055847},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2556000053882599},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-8(1:4)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:4)2012","pdf_url":"https://lmcs.episciences.org/869/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1201.1716","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1201.1716","pdf_url":"https://arxiv.org/pdf/1201.1716","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:89b8069df83c41e79a40fa79961905e7","is_oa":true,"landing_page_url":"https://doaj.org/article/89b8069df83c41e79a40fa79961905e7","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 1 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(1:4)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(1:4)2012","pdf_url":"https://lmcs.episciences.org/869/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5072099817","display_name":null,"funder_award_id":"EP/E035590/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1994404058.pdf","grobid_xml":"https://content.openalex.org/works/W1994404058.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W66273859","https://openalex.org/W980858316","https://openalex.org/W1534933292","https://openalex.org/W1590315663","https://openalex.org/W1688892607","https://openalex.org/W2002128397","https://openalex.org/W2023808162","https://openalex.org/W2061438988","https://openalex.org/W2078729172","https://openalex.org/W2080593426","https://openalex.org/W2084910510","https://openalex.org/W2097402988","https://openalex.org/W2112047017","https://openalex.org/W2115088126","https://openalex.org/W2117189826","https://openalex.org/W2128510433","https://openalex.org/W2133055577","https://openalex.org/W2141509697","https://openalex.org/W2147269402","https://openalex.org/W2153791853","https://openalex.org/W2172048144","https://openalex.org/W2176316790","https://openalex.org/W4300021588","https://openalex.org/W6684644128"],"related_works":[],"abstract_inverted_index":{"The":[0,44,134,191],"Parameterised":[1],"Model":[2],"Checking":[3],"Problem":[4],"asks":[5],"whether":[6],"an":[7],"implementation":[8],"Impl(t)":[9],"satisfies":[10],"a":[11,33,56,83,89,94,145,151,169,182,204,219,245,260,286],"specification":[12],"Spec(t)":[13],"for":[14,88,160,208],"all":[15,99,161],"instantiations":[16,102],"of":[17,29,37,41,47,52,55,58,63,70,104,199,221,244,254,264,268,289],"parameter":[18,62,106],"t.":[19],"In":[20],"general,":[21],"t":[22],"can":[23,136,180],"determine":[24],"numerous":[25],"entities:":[26],"the":[27,35,39,61,64,68,73,105,173,186,255,265,274],"number":[28,69],"processes":[30,71,210],"used":[31,138],"in":[32,72,139,285],"network,":[34],"type":[36,84,110,192,275],"data,":[38],"capacities":[40],"buffers,":[42],"etc.":[43],"main":[45,266],"theme":[46],"this":[48],"paper":[49],"is":[50,120,130,156,278],"automation":[51],"uniform":[53,188],"verification":[54,91,189],"subclass":[57],"PMCP":[59],"with":[60,144,248,259],"first":[65],"kind,":[66],"i.e.":[67],"network.":[74],"We":[75,81,202],"use":[76],"CSP":[77,209],"as":[78],"our":[79,269],"formalism.":[80],"present":[82],"reduction":[85,193,276],"theory,":[86],"which,":[87],"given":[90],"problem,":[92],"establishes":[93],"function":[95],"\\phi":[96],"that":[97,117,149,155,211,224,238],"maps":[98],"(sufficiently":[100],"large)":[101],"T":[103],"to":[107,115,126,185,227,241],"some":[108],"fixed":[109],"T^":[111],"and":[112,216,273],"allows":[113],"us":[114,226,240],"deduce":[116,181],"if":[118,172],"Spec(T^)":[119],"refined":[121,131,157],"by":[122,132,141,158,166],"\\phi(Impl(T)),":[123],"then":[124],"(subject":[125],"certain":[127,213],"assumptions)":[128],"Spec(T)":[129],"Impl(T).":[133],"theory":[135,194,277],"be":[137],"practice":[140],"combining":[142],"it":[143],"suitable":[146],"abstraction":[147],"method":[148],"produces":[150],"t-independent":[152],"process":[153,200,246,257],"Abstr":[154,176],"{\\phi}(Impl(T))":[159],"sufficiently":[162],"large":[163],"T.":[164],"Then,":[165],"testing":[167],"(with":[168],"model":[170,175],"checker)":[171],"abstract":[174],"refines":[177],"Spec(T^),":[178],"we":[179,217,235],"positive":[183],"answer":[184],"original":[187],"problem.":[190],"relies":[195],"on":[196,233],"symbolic":[197,205,229,270],"representation":[198],"behaviour.":[201],"develop":[203],"operational":[206,271],"semantics":[207,272],"satisfy":[212],"normality":[214],"requirements,":[215],"provide":[218],"set":[220],"translation":[222],"rules":[223],"allow":[225,239],"concretise":[228],"transition":[230],"graphs.":[231],"Based":[232],"this,":[234],"prove":[236],"results":[237],"infer":[242],"behaviours":[243,253],"instantiated":[247,258],"uncollapsed":[249],"types":[250],"from":[251],"known":[252],"same":[256],"reduced":[261],"type.":[262],"One":[263],"advantages":[267],"their":[279],"generality,":[280],"which":[281],"makes":[282],"them":[283],"applicable":[284],"wide":[287],"range":[288],"settings.":[290]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}