{"id":"https://openalex.org/W4399889863","doi":"https://doi.org/10.1145/3661814.3662103","title":"Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence","display_name":"Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence","publication_year":2024,"publication_date":"2024-06-21","ids":{"openalex":"https://openalex.org/W4399889863","doi":"https://doi.org/10.1145/3661814.3662103"},"language":"en","primary_location":{"id":"doi:10.1145/3661814.3662103","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3661814.3662103","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3661814.3662103?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3661814.3662103?download=true","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012184818","display_name":"Vasileios Koutavas","orcid":"https://orcid.org/0000-0002-3970-2486"},"institutions":[{"id":"https://openalex.org/I168346926","display_name":"Science Foundation Ireland","ror":"https://ror.org/0271asj38","country_code":"IE","type":"nonprofit","lineage":["https://openalex.org/I168346926"]},{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Vasileios Koutavas","raw_affiliation_strings":["Lero -- Science Foundation Ireland Research Centre for Software, Limerick, Ireland","Trinity College Dublin, Dublin, Ireland"],"raw_orcid":"https://orcid.org/0000-0002-3970-2486","affiliations":[{"raw_affiliation_string":"Lero -- Science Foundation Ireland Research Centre for Software, Limerick, Ireland","institution_ids":["https://openalex.org/I168346926"]},{"raw_affiliation_string":"Trinity College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056217023","display_name":"Yu-Yang Lin","orcid":"https://orcid.org/0000-0001-5783-9454"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Yu-Yang Lin","raw_affiliation_strings":["Trinity College Dublin, Dublin, Ireland"],"raw_orcid":"https://orcid.org/0000-0001-5783-9454","affiliations":[{"raw_affiliation_string":"Trinity College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041266426","display_name":"Nikos Tzevelekos","orcid":"https://orcid.org/0000-0001-8509-8059"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nikos Tzevelekos","raw_affiliation_strings":["EECS, Queen Mary University of London, London, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-8509-8059","affiliations":[{"raw_affiliation_string":"EECS, Queen Mary University of London, London, United Kingdom","institution_ids":["https://openalex.org/I166337079"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3055,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62005894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"15"},"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.9990000128746033,"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.9990000128746033,"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.9990000128746033,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/bisimulation","display_name":"Bisimulation","score":0.8958449959754944},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6956161260604858},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5968756675720215},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5554015636444092},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.49910473823547363},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.49105310440063477},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.4178960919380188},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3798961043357849},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3535435199737549},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3378821015357971},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.318106472492218},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13695532083511353},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.08253362774848938},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.07180964946746826},{"id":"https://openalex.org/keywords/history","display_name":"History","score":0.0701589286327362}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.8958449959754944},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6956161260604858},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5968756675720215},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5554015636444092},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.49910473823547363},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.49105310440063477},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.4178960919380188},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3798961043357849},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3535435199737549},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3378821015357971},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.318106472492218},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13695532083511353},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.08253362774848938},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.07180964946746826},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0701589286327362},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.0},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.0},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3661814.3662103","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3661814.3662103","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3661814.3662103?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3661814.3662103","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3661814.3662103","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3661814.3662103?download=true","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2103026125","display_name":null,"funder_award_id":"13/RC/2094_2","funder_id":"https://openalex.org/F4320320847","funder_display_name":"Science Foundation Ireland"},{"id":"https://openalex.org/G6088502587","display_name":null,"funder_award_id":"2023-324819 (3696)","funder_id":"https://openalex.org/F4320306192","funder_display_name":"Silicon Valley Community Foundation"},{"id":"https://openalex.org/G8515955051","display_name":null,"funder_award_id":"13/RC/2094_P2","funder_id":"https://openalex.org/F4320320847","funder_display_name":"Science Foundation Ireland"}],"funders":[{"id":"https://openalex.org/F4320306192","display_name":"Silicon Valley Community Foundation","ror":"https://ror.org/001ader08"},{"id":"https://openalex.org/F4320307791","display_name":"Cisco Systems","ror":"https://ror.org/03yt1ez60"},{"id":"https://openalex.org/F4320320847","display_name":"Science Foundation Ireland","ror":"https://ror.org/0271asj38"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399889863.pdf","grobid_xml":"https://content.openalex.org/works/W4399889863.grobid-xml"},"referenced_works_count":58,"referenced_works":["https://openalex.org/W45878689","https://openalex.org/W825122159","https://openalex.org/W1491719272","https://openalex.org/W1495872178","https://openalex.org/W1513445195","https://openalex.org/W1537995368","https://openalex.org/W1545038039","https://openalex.org/W1589224558","https://openalex.org/W1655777796","https://openalex.org/W1709253165","https://openalex.org/W1712407203","https://openalex.org/W1847465957","https://openalex.org/W1855476678","https://openalex.org/W1877442346","https://openalex.org/W1905205673","https://openalex.org/W1915934711","https://openalex.org/W1973030866","https://openalex.org/W1975082667","https://openalex.org/W1994458424","https://openalex.org/W1996612506","https://openalex.org/W2009226222","https://openalex.org/W2009566061","https://openalex.org/W2013885073","https://openalex.org/W2023149698","https://openalex.org/W2024189573","https://openalex.org/W2039222548","https://openalex.org/W2041192515","https://openalex.org/W2045982128","https://openalex.org/W2067871120","https://openalex.org/W2083896385","https://openalex.org/W2085080904","https://openalex.org/W2096216741","https://openalex.org/W2097920868","https://openalex.org/W2100559921","https://openalex.org/W2124580491","https://openalex.org/W2125379835","https://openalex.org/W2152787740","https://openalex.org/W2153128836","https://openalex.org/W2160668778","https://openalex.org/W2165407648","https://openalex.org/W2165446401","https://openalex.org/W2209684412","https://openalex.org/W2290178294","https://openalex.org/W2293092623","https://openalex.org/W2487055703","https://openalex.org/W2927607934","https://openalex.org/W2952100912","https://openalex.org/W2992113395","https://openalex.org/W3103744781","https://openalex.org/W3103813054","https://openalex.org/W3111047563","https://openalex.org/W3209583808","https://openalex.org/W4229692082","https://openalex.org/W4230665378","https://openalex.org/W4239690658","https://openalex.org/W4248968782","https://openalex.org/W4384297629","https://openalex.org/W6930114643"],"related_works":["https://openalex.org/W1584306444","https://openalex.org/W1536687913","https://openalex.org/W2044199853","https://openalex.org/W2089141720","https://openalex.org/W1602383402","https://openalex.org/W2067895928","https://openalex.org/W3037972106","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W1530104041"],"abstract_inverted_index":{"We":[0,99,123],"propose":[1],"Pushdown":[2],"Normal":[3,24],"Form":[4,25],"(PDNF)":[5],"Bisimulation":[6,29,45],"to":[7,20,36,93,132],"verify":[8,133],"contextual":[9,37],"equivalence":[10],"in":[11,80,102],"higher-order":[12],"functional":[13],"programming":[14],"languages":[15],"with":[16,34,110],"local":[17],"state.":[18],"Similar":[19],"previous":[21,150],"work":[22],"on":[23,76],"(NF)":[26],"bisimulation,":[27],"PDNF":[28,44],"is":[30,46,69,121],"sound":[31],"and":[32,127,138],"complete":[33],"respect":[35],"equivalence.":[38],"However,":[39],"unlike":[40],"traditional":[41],"NF":[42],"Bisimulation,":[43],"also":[47],"decidable":[48],"for":[49,82,115,149],"a":[50,103,128],"class":[51],"of":[52,59,67,147],"program":[53],"terms":[54],"that":[55],"can":[56,86],"reach":[57,148],"configurations":[58],"unbounded":[60],"size,":[61],"so":[62],"long":[63],"as":[64],"the":[65,70,77,136],"source":[66],"unboundedness":[68],"call":[71,116],"stack.":[72],"Our":[73],"approach":[74],"relies":[75],"principle":[78],"that,":[79],"model-checking":[81],"reachability,":[83],"pushdown":[84],"systems":[85],"be":[87],"simulated":[88],"by":[89,141],"finite-state":[90],"automata":[91],"designed":[92],"accept":[94],"their":[95],"initial/final":[96],"stack":[97],"content.":[98],"embody":[100],"this":[101],"stack-less":[104],"Labelled":[105],"Transition":[106],"System":[107],"(LTS),":[108],"together":[109],"an":[111],"on-the-fly":[112],"saturation":[113],"procedure":[114],"stacks,":[117],"upon":[118],"which":[119,144],"bisimulation":[120],"defined.":[122],"develop":[124],"up-to":[125],"techniques":[126],"prototype":[129],"implementation":[130],"able":[131],"equivalences":[134],"from":[135],"literature":[137],"others":[139],"inspired":[140],"real":[142],"code,":[143],"were":[145],"out":[146],"work.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}