{"id":"https://openalex.org/W2113827727","doi":"https://doi.org/10.1145/1007512.1007544","title":"Faster constraint solving with subtypes","display_name":"Faster constraint solving with subtypes","publication_year":2004,"publication_date":"2004-07-01","ids":{"openalex":"https://openalex.org/W2113827727","doi":"https://doi.org/10.1145/1007512.1007544","mag":"2113827727"},"language":"en","primary_location":{"id":"doi:10.1145/1007512.1007544","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007512.1007544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114251349","display_name":"Jonathan Edwards","orcid":"https://orcid.org/0000-0003-1958-7967"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan Edwards","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101853728","display_name":"Daniel Jackson","orcid":"https://orcid.org/0000-0002-8833-9476"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Jackson","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088791029","display_name":"Emina Torlak","orcid":"https://orcid.org/0000-0002-1155-2711"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emina Torlak","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086886640","display_name":"Vincent Yeung","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vincent Yeung","raw_affiliation_strings":["MIT, Cambridge, MA","MIT, Cambridge, Ma.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0244,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86671147,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"232","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.6884790658950806},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6041464805603027},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5578306913375854},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.516920804977417},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49676424264907837},{"id":"https://openalex.org/keywords/subtyping","display_name":"Subtyping","score":0.4784391224384308},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.476483553647995},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47014787793159485},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4434375464916229},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4380277395248413},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4250294864177704},{"id":"https://openalex.org/keywords/data-type","display_name":"Data type","score":0.41681358218193054},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4125114381313324},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34836453199386597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2388097643852234},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.23382949829101562},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20918336510658264},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12032601237297058}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6884790658950806},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6041464805603027},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5578306913375854},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.516920804977417},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49676424264907837},{"id":"https://openalex.org/C83852419","wikidata":"https://www.wikidata.org/wiki/Q2713292","display_name":"Subtyping","level":2,"score":0.4784391224384308},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.476483553647995},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47014787793159485},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4434375464916229},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4380277395248413},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4250294864177704},{"id":"https://openalex.org/C138958017","wikidata":"https://www.wikidata.org/wiki/Q190087","display_name":"Data type","level":2,"score":0.41681358218193054},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4125114381313324},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34836453199386597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2388097643852234},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.23382949829101562},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20918336510658264},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12032601237297058},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007512.1007544","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007512.1007544","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W68069235","https://openalex.org/W1495605563","https://openalex.org/W1500983737","https://openalex.org/W1503170978","https://openalex.org/W1504504841","https://openalex.org/W1544621933","https://openalex.org/W1569757069","https://openalex.org/W1667362966","https://openalex.org/W1787074469","https://openalex.org/W1943502734","https://openalex.org/W2001289891","https://openalex.org/W2005621693","https://openalex.org/W2025460523","https://openalex.org/W2039906702","https://openalex.org/W2072112548","https://openalex.org/W2074845051","https://openalex.org/W2075959177","https://openalex.org/W2097166325","https://openalex.org/W2116181031","https://openalex.org/W2140595120","https://openalex.org/W2142785340","https://openalex.org/W2145098440","https://openalex.org/W2150871888","https://openalex.org/W2163319971","https://openalex.org/W2167030131","https://openalex.org/W2169102536","https://openalex.org/W2170408876","https://openalex.org/W2173679018","https://openalex.org/W2340735175","https://openalex.org/W2615497679","https://openalex.org/W2913459036","https://openalex.org/W4300021588","https://openalex.org/W6634037432","https://openalex.org/W6636950635","https://openalex.org/W6669778933","https://openalex.org/W6684644128"],"related_works":["https://openalex.org/W2038777323","https://openalex.org/W2529689007","https://openalex.org/W1600869845","https://openalex.org/W4234414781","https://openalex.org/W2111523115","https://openalex.org/W2154853422","https://openalex.org/W4283643926","https://openalex.org/W2994077026","https://openalex.org/W2558119813","https://openalex.org/W4385668771"],"abstract_inverted_index":{"Constraints":[0],"in":[1,32,57,100],"predicate":[2],"or":[3,30,89],"relational":[4],"logic":[5,11],"can":[6,96],"be":[7,98],"translated":[8],"into":[9,70,83],"boolean":[10,39],"and":[12],"solved":[13,99],"with":[14,60,105],"a":[15,58,71],"SAT":[16],"solver.":[17],"For":[18],"faster":[19],"solving,":[20],"it":[21],"is":[22],"common":[23],"to":[24,34,42,50,54],"exploit":[25],"the":[26,36,44,67,101,112],"typing":[27],"of":[28,38,74,108],"predicates":[29,90],"relations,":[31],"order":[33],"reduce":[35],"number":[37],"variables":[40],"needed":[41],"encode":[43],"constraint.":[45],"Here":[46],"we":[47],"show":[48,115],"how":[49],"extend":[51],"this":[52,109],"idea":[53],"constraints":[55,79,85],"expressed":[56],"language":[59],"subtyping.":[61],"Our":[62],"technique,":[63],"called":[64],"atomization,":[65],"refactors":[66],"type":[68],"hierarchy":[69],"flat":[72],"collection":[73],"disjoint":[75],"atomic":[76],"types.":[77],"The":[78],"are":[80],"then":[81,97],"decomposed":[82],"equivalent":[84],"involving":[86],"smaller":[87],"relations":[88],"over":[91],"these":[92],"new":[93],"types,":[94],"which":[95],"normal":[102],"fashion.":[103],"Experiments":[104],"an":[106],"implementation":[107],"technique":[110],"within":[111],"Alloy":[113],"Analyzer":[114],"improved":[116],"performance":[117],"on":[118],"practical":[119],"software":[120],"checking":[121],"problems.":[122]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}