{"id":"https://openalex.org/W1993644612","doi":"https://doi.org/10.1007/s00165-007-0027-6","title":"Verification of clock synchronization algorithms: experiments on a combination of deductive tools","display_name":"Verification of clock synchronization algorithms: experiments on a combination of deductive tools","publication_year":2007,"publication_date":"2007-05-02","ids":{"openalex":"https://openalex.org/W1993644612","doi":"https://doi.org/10.1007/s00165-007-0027-6","mag":"1993644612"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-007-0027-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-007-0027-6","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-007-0027-6","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-007-0027-6","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003415818","display_name":"Dami\u00e1n Barsotti","orcid":null},"institutions":[{"id":"https://openalex.org/I166401450","display_name":"Universidad Nacional de C\u00f3rdoba","ror":"https://ror.org/056tb7j80","country_code":"AR","type":"education","lineage":["https://openalex.org/I166401450"]}],"countries":["AR"],"is_corresponding":true,"raw_author_name":"Dami\u00e1n Barsotti","raw_affiliation_strings":["Universidad Nacional de C\u00f3rdoba, Ciudad Universitaria, 5000, C\u00f3rdoba, Argentina"],"affiliations":[{"raw_affiliation_string":"Universidad Nacional de C\u00f3rdoba, Ciudad Universitaria, 5000, C\u00f3rdoba, Argentina","institution_ids":["https://openalex.org/I166401450"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063036981","display_name":"Leonor Prensa Nieto","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Leonor Prensa Nieto","raw_affiliation_strings":["LORIA, 54506, Vandoeuvre-l\u00e8s-Nancy, France"],"affiliations":[{"raw_affiliation_string":"LORIA, 54506, Vandoeuvre-l\u00e8s-Nancy, France","institution_ids":["https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071064651","display_name":"Alwen Tiu","orcid":"https://orcid.org/0000-0002-2695-5636"},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]},{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Alwen Tiu","raw_affiliation_strings":["Research School of Information Sciences and Engineering, Australian National University and National ICT Australia, 0200, Canberra, ACT, Australia","Australian National University and National ICT Australia, Research School of Information Sciences and Engineering, 0200, Canberra, ACT, Australia#TAB#"],"affiliations":[{"raw_affiliation_string":"Research School of Information Sciences and Engineering, Australian National University and National ICT Australia, 0200, Canberra, ACT, Australia","institution_ids":["https://openalex.org/I42894916","https://openalex.org/I118347636"]},{"raw_affiliation_string":"Australian National University and National ICT Australia, Research School of Information Sciences and Engineering, 0200, Canberra, ACT, Australia#TAB#","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003415818"],"corresponding_institution_ids":["https://openalex.org/I166401450"],"apc_list":null,"apc_paid":null,"fwci":2.9018,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91152804,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"19","issue":"3","first_page":"321","last_page":"341"},"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.9995999932289124,"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.9995999932289124,"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.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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hol","display_name":"HOL","score":0.9407602548599243},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7506002187728882},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7471264004707336},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7407233119010925},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.6979274749755859},{"id":"https://openalex.org/keywords/clock-synchronization","display_name":"Clock synchronization","score":0.6328593492507935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5524100065231323},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.533564567565918},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.5098332762718201},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5027995109558105},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.47804027795791626},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.4595246911048889},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4434686303138733},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.43286436796188354},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4282161295413971},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3615052103996277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1983039379119873}],"concepts":[{"id":"https://openalex.org/C17435882","wikidata":"https://www.wikidata.org/wiki/Q17030435","display_name":"HOL","level":2,"score":0.9407602548599243},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7506002187728882},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7471264004707336},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7407233119010925},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.6979274749755859},{"id":"https://openalex.org/C129891060","wikidata":"https://www.wikidata.org/wiki/Q1513059","display_name":"Clock synchronization","level":4,"score":0.6328593492507935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5524100065231323},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.533564567565918},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5098332762718201},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5027995109558105},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.47804027795791626},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.4595246911048889},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4434686303138733},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.43286436796188354},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4282161295413971},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3615052103996277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1983039379119873},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s00165-007-0027-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-007-0027-6","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-007-0027-6","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.503.5313","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.503.5313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.loria.fr/equipes/cassis/SYMA/mosel/p2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.516.6275","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.516.6275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.archives-ouvertes.fr/docs/00/04/32/70/PDF/barsotti_prensa_tiu.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.84.8264","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.8264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.rsise.anu.edu.au/~tiu/clocksync.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00000638v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00000638","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Fifth International Workshop on Automated Verification of Critical Systems 2005 - AVoCS '05, Ranko Lazic, Rajagopal Nagarajan, Nikolaos Papanikolaou, Sep 2005, Coventry/UK","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:inria-00097383v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00097383","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Formal Aspects of Computing, 2007, 19 (3), pp.321-341. ⟨10.1007/s00165-007-0027-6⟩","raw_type":"Journal articles"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/39233","is_oa":false,"landing_page_url":"http://hdl.handle.net/1885/39233","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Formal Aspects of Computing","raw_type":"Journal article"}],"best_oa_location":{"id":"doi:10.1007/s00165-007-0027-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-007-0027-6","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-007-0027-6","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1993644612.pdf","grobid_xml":"https://content.openalex.org/works/W1993644612.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W100453477","https://openalex.org/W1527306917","https://openalex.org/W1558939704","https://openalex.org/W1586821729","https://openalex.org/W1598006012","https://openalex.org/W1661119603","https://openalex.org/W1763095070","https://openalex.org/W1903955310","https://openalex.org/W1971108739","https://openalex.org/W2001802828","https://openalex.org/W2021284393","https://openalex.org/W2035289314","https://openalex.org/W2035405585","https://openalex.org/W2078209861","https://openalex.org/W2113241366","https://openalex.org/W2118891797","https://openalex.org/W2149236366","https://openalex.org/W2149479386","https://openalex.org/W2406746068","https://openalex.org/W2725288137","https://openalex.org/W4238176147","https://openalex.org/W4242177437"],"related_works":["https://openalex.org/W2888810578","https://openalex.org/W4289666903","https://openalex.org/W2769609281","https://openalex.org/W2483392883","https://openalex.org/W2809689211","https://openalex.org/W1504680642","https://openalex.org/W2519051298","https://openalex.org/W76860425","https://openalex.org/W2160478595","https://openalex.org/W1909465604"],"abstract_inverted_index":{"Abstract":[0],"We":[1,40,98],"report":[2],"on":[3,20],"an":[4],"experiment":[5,32],"in":[6,51,61,96],"combining":[7],"the":[8,21,31,57,67,78,102],"theorem":[9],"prover":[10],"Isabelle":[11,111],"with":[12,126],"automatic":[13,123],"first-order":[14,124],"arithmetic":[15],"provers":[16,125],"to":[17],"increase":[18],"automation":[19],"verification":[22],"of":[23,44,72,82,101],"distributed":[24],"protocols.":[25],"As":[26],"a":[27,42],"case":[28],"study":[29],"for":[30,89,128],"we":[33,54],"verify":[34,55],"several":[35],"averaging":[36],"clock":[37,47,63],"synchronization":[38,48,64],"algorithms.":[39],"present":[41],"formalization":[43],"Schneider\u2019s":[45,86],"generalized":[46],"protocol":[49],"[Sch87]":[50],"Isabelle/HOL.":[52,97],"Then,":[53],"that":[56,116],"convergence":[58],"functions":[59],"used":[60],"two":[62],"algorithms,":[65],"namely,":[66],"Interactive":[68],"Convergence":[69],"Algorithm":[70],"(ICA)":[71],"Lamport":[73],"and":[74,77,114],"Melliar-Smith":[75],"[LMS85]":[76],"Fault-tolerant":[79],"Midpoint":[80],"algorithm":[81],"Lundelius\u2013Lynch":[83],"[LL84],":[84],"satisfy":[85],"general":[87],"conditions":[88],"correctness.":[90],"The":[91],"proofs":[92,103,118],"are":[93,105],"completely":[94],"formalized":[95],"identify":[99],"parts":[100],"which":[104],"not":[106],"fully":[107],"automatically":[108],"proven":[109],"by":[110,122],"built-in":[112],"tactics":[113],"show":[115],"these":[117],"can":[119],"be":[120],"handled":[121],"support":[127],"arithmetics.":[129]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}