{"id":"https://openalex.org/W2117444225","doi":"https://doi.org/10.1109/ispass.2008.4510741","title":"Performance Analysis of ARQ Protocols using a Theorem Prover","display_name":"Performance Analysis of ARQ Protocols using a Theorem Prover","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2117444225","doi":"https://doi.org/10.1109/ispass.2008.4510741","mag":"2117444225"},"language":"en","primary_location":{"id":"doi:10.1109/ispass.2008.4510741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispass.2008.4510741","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software","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/A5066768973","display_name":"Osman Hasan","orcid":"https://orcid.org/0000-0003-2562-2669"},"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":"Osman Hasan","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Concordia University, Montreal, QUE, Canada","Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, QC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, QC","institution_ids":["https://openalex.org/I60158472"]}]},{"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":"Sofiene Tahar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Concordia University, Montreal, QUE, Canada","Dept. of Electrical and Computer Engineering, Concordia University, Montreal, Quebec, Canada, tahar@ece.concordia.ca"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Concordia University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I60158472"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Concordia University, Montreal, Quebec, Canada, tahar@ece.concordia.ca","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":null,"apc_paid":null,"fwci":1.1423,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.75521921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"94"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994000196456909,"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/computer-science","display_name":"Computer science","score":0.7890589833259583},{"id":"https://openalex.org/keywords/automatic-repeat-request","display_name":"Automatic repeat request","score":0.7116857767105103},{"id":"https://openalex.org/keywords/hol","display_name":"HOL","score":0.7091805934906006},{"id":"https://openalex.org/keywords/selective-repeat-arq","display_name":"Selective Repeat ARQ","score":0.6436353325843811},{"id":"https://openalex.org/keywords/sliding-window-protocol","display_name":"Sliding window protocol","score":0.5611448287963867},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.4879266917705536},{"id":"https://openalex.org/keywords/hybrid-automatic-repeat-request","display_name":"Hybrid automatic repeat request","score":0.4315512180328369},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.4314824342727661},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.42503881454467773},{"id":"https://openalex.org/keywords/go-back-n-arq","display_name":"Go-Back-N ARQ","score":0.42461490631103516},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3262282609939575},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3202148377895355},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14216789603233337},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.13531416654586792},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08561241626739502}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7890589833259583},{"id":"https://openalex.org/C171952454","wikidata":"https://www.wikidata.org/wiki/Q29522","display_name":"Automatic repeat request","level":4,"score":0.7116857767105103},{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.7091805934906006},{"id":"https://openalex.org/C91739489","wikidata":"https://www.wikidata.org/wiki/Q7447752","display_name":"Selective Repeat ARQ","level":5,"score":0.6436353325843811},{"id":"https://openalex.org/C102392041","wikidata":"https://www.wikidata.org/wiki/Q592860","display_name":"Sliding window protocol","level":3,"score":0.5611448287963867},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4879266917705536},{"id":"https://openalex.org/C118437007","wikidata":"https://www.wikidata.org/wiki/Q1017139","display_name":"Hybrid automatic repeat request","level":3,"score":0.4315512180328369},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.4314824342727661},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.42503881454467773},{"id":"https://openalex.org/C175850338","wikidata":"https://www.wikidata.org/wiki/Q1709294","display_name":"Go-Back-N ARQ","level":5,"score":0.42461490631103516},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3262282609939575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3202148377895355},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14216789603233337},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.13531416654586792},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08561241626739502},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ispass.2008.4510741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispass.2008.4510741","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.329.4813","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.4813","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/ISPASS'07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W564199388","https://openalex.org/W1485063743","https://openalex.org/W1489119587","https://openalex.org/W1519298802","https://openalex.org/W1563533791","https://openalex.org/W1601195943","https://openalex.org/W1863642815","https://openalex.org/W1864574667","https://openalex.org/W1896373471","https://openalex.org/W1963581710","https://openalex.org/W1988873236","https://openalex.org/W2027134188","https://openalex.org/W2051277798","https://openalex.org/W2065534115","https://openalex.org/W2070609206","https://openalex.org/W2076420000","https://openalex.org/W2114158268","https://openalex.org/W2120926795","https://openalex.org/W2125659750","https://openalex.org/W2140597298","https://openalex.org/W2141881497","https://openalex.org/W2142185825","https://openalex.org/W2159828302","https://openalex.org/W2166822586","https://openalex.org/W2331722735","https://openalex.org/W2340735175","https://openalex.org/W2487908531","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W2913459036","https://openalex.org/W4245800583","https://openalex.org/W4254297739","https://openalex.org/W4254911368","https://openalex.org/W6633870999"],"related_works":["https://openalex.org/W1704230881","https://openalex.org/W25248209","https://openalex.org/W2025662109","https://openalex.org/W1983542444","https://openalex.org/W2114206850","https://openalex.org/W2141879265","https://openalex.org/W1517398983","https://openalex.org/W2122398137","https://openalex.org/W2169076848","https://openalex.org/W2167587238"],"abstract_inverted_index":{"Automatic-repeat-request":[0],"(ARQ)":[1],"protocols":[2,74,96,144],"are":[3],"widely":[4],"used":[5,36],"in":[6,55,75,104,145],"modern":[7],"data":[8],"communications":[9],"to":[10,57,67,88],"guarantee":[11],"reliable":[12],"transmission":[13],"over":[14],"imperfect":[15],"physical":[16],"links.":[17],"The":[18,129],"behavior":[19,116],"of":[20,29,52,72,78,94,100,117,121,135],"an":[21,86],"ARQ":[22,73,95,122],"protocol":[23],"largely":[24],"depends":[25],"on":[26],"a":[27,79,98],"number":[28],"network":[30],"parameters":[31],"and":[32,47,127],"traditionally":[33],"simulation":[34,42],"is":[35],"for":[37,141],"their":[38],"performance":[39,70],"analysis.":[40],"However,":[41],"provides":[43],"less":[44],"accurate":[45],"results":[46],"usually":[48],"requires":[49],"enormous":[50],"amount":[51],"CPU":[53],"time":[54],"order":[56],"attain":[58],"reasonable":[59],"estimates.":[60],"To":[61],"overcome":[62],"these":[63,142],"limitations,":[64],"we":[65,108],"propose":[66],"conduct":[68],"the":[69,76,91,114,133,136],"analysis":[71],"environment":[77],"higher-order-logic":[80,110],"theorem":[81],"prover":[82],"(HOL).":[83],"We":[84],"present":[85],"approach":[87],"formally":[89],"model":[90],"delay":[92,115,139],"characteristics":[93],"as":[97],"function":[99],"geometric":[101],"random":[102],"variable":[103],"higher-order-logic.":[105],"In":[106],"particular,":[107],"develop":[109],"models":[111],"that":[112],"describe":[113],"three":[118,143],"basic":[119],"types":[120],"protocols,":[123],"i.e.,":[124],"Stop-and-Wait,":[125],"Go-Back-N":[126],"Selective-Repeat.":[128],"paper":[130],"also":[131],"includes":[132],"verification":[134],"average":[137],"message":[138],"relations":[140],"HOL.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}