{"id":"https://openalex.org/W4366077073","doi":"https://doi.org/10.1007/978-3-031-30044-8_20","title":"Automatic Alignment in Higher-Order Probabilistic Programming Languages","display_name":"Automatic Alignment in Higher-Order Probabilistic Programming Languages","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4366077073","doi":"https://doi.org/10.1007/978-3-031-30044-8_20"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-30044-8_20","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30044-8_20","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30044-8_20.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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30044-8_20.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017493439","display_name":"Daniel Lund\u00e9n","orcid":"https://orcid.org/0000-0003-3127-5640"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Daniel Lund\u00e9n","raw_affiliation_strings":["EECS and Digital Futures, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-3127-5640","affiliations":[{"raw_affiliation_string":"EECS and Digital Futures, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036434997","display_name":"Gizem \u00c7aylak","orcid":"https://orcid.org/0000-0001-9703-6912"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Gizem \u00c7aylak","raw_affiliation_strings":["EECS and Digital Futures, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-9703-6912","affiliations":[{"raw_affiliation_string":"EECS and Digital Futures, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048208979","display_name":"Fredrik Ronquist","orcid":"https://orcid.org/0000-0002-3929-251X"},"institutions":[{"id":"https://openalex.org/I161593684","display_name":"Stockholm University","ror":"https://ror.org/05f0yaq80","country_code":"SE","type":"education","lineage":["https://openalex.org/I161593684"]},{"id":"https://openalex.org/I2801711128","display_name":"Swedish Museum of Natural History","ror":"https://ror.org/05k323c76","country_code":"SE","type":"archive","lineage":["https://openalex.org/I2801711128"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Fredrik Ronquist","raw_affiliation_strings":["Department of Bioinformatics and Genetics, Swedish Museum of Natural History, Stockholm, Sweden","Department of Zoology, Stockholm University, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-3929-251X","affiliations":[{"raw_affiliation_string":"Department of Bioinformatics and Genetics, Swedish Museum of Natural History, Stockholm, Sweden","institution_ids":["https://openalex.org/I2801711128"]},{"raw_affiliation_string":"Department of Zoology, Stockholm University, Stockholm, Sweden","institution_ids":["https://openalex.org/I161593684"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073873489","display_name":"David Broman","orcid":"https://orcid.org/0000-0001-8457-4105"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"David Broman","raw_affiliation_strings":["EECS and Digital Futures, KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-8457-4105","affiliations":[{"raw_affiliation_string":"EECS and Digital Futures, KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5017493439"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":6.7308,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.96944444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"535","last_page":"563"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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.9984999895095825,"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/T10260","display_name":"Software Engineering Research","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8360987305641174},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7568824887275696},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.7424486875534058},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.7123175859451294},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6077325344085693},{"id":"https://openalex.org/keywords/approximate-inference","display_name":"Approximate inference","score":0.47558867931365967},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.44508054852485657},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4289371073246002},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4190117120742798},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4114641845226288},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25977832078933716},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.18580347299575806}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8360987305641174},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7568824887275696},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.7424486875534058},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.7123175859451294},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6077325344085693},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.47558867931365967},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.44508054852485657},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4289371073246002},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4190117120742798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4114641845226288},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25977832078933716},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.18580347299575806}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-031-30044-8_20","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30044-8_20","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30044-8_20.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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:DiVA.org:kth-324293","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-324293","pdf_url":"https://kth.diva-portal.org/smash/get/diva2:1739445/FULLTEXT02","source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-30044-8_20","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30044-8_20","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30044-8_20.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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/G3111618571","display_name":null,"funder_award_id":"FFL15-0032","funder_id":"https://openalex.org/F4320320940","funder_display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning"},{"id":"https://openalex.org/G3974159853","display_name":null,"funder_award_id":"RIT15-0012","funder_id":"https://openalex.org/F4320322327","funder_display_name":"Knut och Alice Wallenbergs Stiftelse"},{"id":"https://openalex.org/G6535064320","display_name":null,"funder_award_id":"RIT15-0012","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G6685500474","display_name":null,"funder_award_id":"FFL15-","funder_id":"https://openalex.org/F4320320940","funder_display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning"},{"id":"https://openalex.org/G7029356719","display_name":null,"funder_award_id":"2018-04620","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G712881263","display_name":null,"funder_award_id":"2018-","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G7557886664","display_name":null,"funder_award_id":"FFL15","funder_id":"https://openalex.org/F4320320940","funder_display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning"},{"id":"https://openalex.org/G7635396371","display_name":null,"funder_award_id":"RIT15-0012","funder_id":"https://openalex.org/F4320320940","funder_display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning"},{"id":"https://openalex.org/G775740959","display_name":null,"funder_award_id":"2021-04830","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320320940","display_name":"Stiftelsen f\u00f6r\u00a0Strategisk Forskning","ror":"https://ror.org/044wr7g58"},{"id":"https://openalex.org/F4320322327","display_name":"Knut och Alice Wallenbergs Stiftelse","ror":"https://ror.org/004hzzk67"},{"id":"https://openalex.org/F4320322509","display_name":"Kungliga Tekniska H\u00f6gskolan","ror":"https://ror.org/026vcq606"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4366077073.pdf"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1553894716","https://openalex.org/W2001082470","https://openalex.org/W2024355065","https://openalex.org/W2046656770","https://openalex.org/W2122049982","https://openalex.org/W2127779696","https://openalex.org/W2149462580","https://openalex.org/W2206718322","https://openalex.org/W2406252837","https://openalex.org/W2577537660","https://openalex.org/W2624999081","https://openalex.org/W2767781532","https://openalex.org/W2799093299","https://openalex.org/W2808311877","https://openalex.org/W2900404128","https://openalex.org/W2902895875","https://openalex.org/W2947175105","https://openalex.org/W2962837791","https://openalex.org/W2979505726","https://openalex.org/W3012402050","https://openalex.org/W3125832933","https://openalex.org/W3132251092","https://openalex.org/W3140464509","https://openalex.org/W4205334708","https://openalex.org/W4225843881","https://openalex.org/W4249903311","https://openalex.org/W4252567017","https://openalex.org/W4366077073","https://openalex.org/W6969248266"],"related_works":["https://openalex.org/W2163814182","https://openalex.org/W4226287370","https://openalex.org/W2114556850","https://openalex.org/W2159992248","https://openalex.org/W2215785064","https://openalex.org/W1625332390","https://openalex.org/W2142819099","https://openalex.org/W2752328056","https://openalex.org/W2951574453","https://openalex.org/W2963960970"],"abstract_inverted_index":{"Abstract":[0],"Probabilistic":[1],"Programming":[2],"Languages":[3],"(PPLs)":[4],"allow":[5],"users":[6,85],"to":[7,18,165],"encode":[8],"statistical":[9],"inference":[10,16,22,46,140,159],"problems":[11],"and":[12,32,118,145,162,171],"automatically":[13,78],"apply":[14],"an":[15],"algorithm":[17,47,141],"solve":[19,68],"them.":[20],"Popular":[21],"algorithms":[23],"for":[24,44],"PPLs,":[25,63],"such":[26],"as":[27,122],"sequential":[28],"Monte":[29,35],"Carlo":[30,36],"(SMC)":[31],"Markov":[33],"chain":[34],"(MCMC),":[37],"are":[38,106],"built":[39],"around":[40],"checkpoints":[41,59,80,95],"\u2014relevant":[42],"events":[43],"the":[45,49,56,99,113,116,120,125,133],"during":[48],"execution":[50,160],"of":[51,58,86,94,115,124,169],"a":[52,73,92],"probabilistic":[53],"program.":[54],"Deciding":[55],"location":[57],"is,":[60],"in":[61,81,98,102],"current":[62],"not":[64],"done":[65],"optimally.":[66],"To":[67],"this":[69,87],"problem,":[70],"we":[71,136],"present":[72],"static":[74],"analysis":[75,90,121],"technique":[76],"that":[77,96,155],"determines":[79],"programs,":[82],"relieving":[83],"PPL":[84,128,167],"task.":[88],"The":[89],"identifies":[91],"set":[93],"execute":[97],"same":[100],"order":[101],"every":[103],"program":[104],"run\u2014they":[105],"aligned":[107,143,146],".":[108,149],"We":[109,150],"formalize":[110],"alignment,":[111],"prove":[112],"correctness":[114],"analysis,":[117,135],"implement":[119],"part":[123],"higher-order":[126],"functional":[127],"Miking":[129],"CorePPL.":[130],"By":[131],"utilizing":[132],"alignment":[134],"design":[137],"two":[138],"novel":[139],"variants:":[142],"SMC":[144,170],"lightweight":[147],"MCMC":[148],"show,":[151],"through":[152],"real-world":[153],"experiments,":[154],"they":[156],"significantly":[157],"improve":[158],"time":[161],"accuracy":[163],"compared":[164],"standard":[166],"versions":[168],"MCMC.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}