{"id":"https://openalex.org/W1509427512","doi":"https://doi.org/10.1007/978-3-540-30494-4_4","title":"A Methodology for the Formal Verification of FFT Algorithms in HOL","display_name":"A Methodology for the Formal Verification of FFT Algorithms in HOL","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1509427512","doi":"https://doi.org/10.1007/978-3-540-30494-4_4","mag":"1509427512"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-30494-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30494-4_4","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081784184","display_name":"Behzad Akbarpour","orcid":null},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Behzad Akbarpour","raw_affiliation_strings":["Dept. of Electrical & Computer Engineering, Concordia University, 1455 de Maisonneuve W., Montreal, Quebec, H3G 1M8, Canada","Concordia University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Engineering, Concordia University, 1455 de Maisonneuve W., Montreal, Quebec, H3G 1M8, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Concordia University,","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007159598","display_name":"Sofi\u00e8ne Tahar","orcid":"https://orcid.org/0000-0002-5537-104X"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sofi\u00e8ne Tahar","raw_affiliation_strings":["Dept. of Electrical & Computer Engineering, Concordia University, 1455 de Maisonneuve W., Montreal, Quebec, H3G 1M8, Canada","Concordia University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Engineering, Concordia University, 1455 de Maisonneuve W., Montreal, Quebec, H3G 1M8, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Concordia University,","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8261,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.72432905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998999834060669,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998999834060669,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11417","display_name":"Advancements in PLL and VCO Technologies","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hol","display_name":"HOL","score":0.9801931977272034},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"Fast Fourier transform","score":0.7560824155807495},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6993280053138733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5796650648117065},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5501570701599121},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5082783102989197},{"id":"https://openalex.org/keywords/split-radix-fft-algorithm","display_name":"Split-radix FFT algorithm","score":0.5055553913116455},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.47026094794273376},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.45746901631355286},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4170975685119629},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3690592348575592},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34288907051086426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3266952633857727},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2185261845588684},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.13867920637130737},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.10416257381439209}],"concepts":[{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.9801931977272034},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.7560824155807495},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6993280053138733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5796650648117065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5501570701599121},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5082783102989197},{"id":"https://openalex.org/C103755468","wikidata":"https://www.wikidata.org/wiki/Q17103599","display_name":"Split-radix FFT algorithm","level":5,"score":0.5055553913116455},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.47026094794273376},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.45746901631355286},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4170975685119629},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3690592348575592},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34288907051086426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3266952633857727},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2185261845588684},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.13867920637130737},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.10416257381439209},{"id":"https://openalex.org/C166386157","wikidata":"https://www.wikidata.org/wiki/Q1477735","display_name":"Short-time Fourier transform","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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-540-30494-4_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30494-4_4","pdf_url":null,"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.530.6587","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.530.6587","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hvg.ece.concordia.ca/Publications/Conferences/37_FMCAD%2704.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1274803","https://openalex.org/W1521083034","https://openalex.org/W1559568018","https://openalex.org/W1561663152","https://openalex.org/W1584721038","https://openalex.org/W1588212183","https://openalex.org/W1594381772","https://openalex.org/W1601188317","https://openalex.org/W1670181694","https://openalex.org/W1766888123","https://openalex.org/W1778289469","https://openalex.org/W1966287322","https://openalex.org/W1967240890","https://openalex.org/W2013712888","https://openalex.org/W2022261955","https://openalex.org/W2022765508","https://openalex.org/W2027237622","https://openalex.org/W2040815697","https://openalex.org/W2051150863","https://openalex.org/W2055893308","https://openalex.org/W2061171222","https://openalex.org/W2069441027","https://openalex.org/W2071999708","https://openalex.org/W2081720252","https://openalex.org/W2106445473","https://openalex.org/W2129905147","https://openalex.org/W2151047202","https://openalex.org/W2166026358","https://openalex.org/W2170142399","https://openalex.org/W2331226313","https://openalex.org/W2612719351","https://openalex.org/W3022893215","https://openalex.org/W4249492500"],"related_works":["https://openalex.org/W2888810578","https://openalex.org/W4289666903","https://openalex.org/W2534028225","https://openalex.org/W2483392883","https://openalex.org/W1522873391","https://openalex.org/W2519051298","https://openalex.org/W1504680642","https://openalex.org/W2116128044","https://openalex.org/W1515169568","https://openalex.org/W1598338394"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}