{"id":"https://openalex.org/W125106562","doi":null,"title":"Verifying network protocols using temporal logic","display_name":"Verifying network protocols using temporal logic","publication_year":1980,"publication_date":"1980-06-01","ids":{"openalex":"https://openalex.org/W125106562","mag":"125106562"},"language":"en","primary_location":{"id":"mag:125106562","doi":null,"is_oa":false,"landing_page_url":"http://i.stanford.edu/pub/cstr/reports/csl/tr/80/192/CSL-TR-80-192.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5010121241","display_name":"Brent T. Hailpern","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brent Hailpern","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027346454","display_name":"Susan S. Owicki","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Susan Owicki","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.9652,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.98576123,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.7265999913215637,"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.7265999913215637,"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/T10126","display_name":"Logic, programming, and type systems","score":0.2694999873638153,"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"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.0012000000569969416,"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/network-protocol-verification","display_name":"network protocol verification","score":0.8389999866485596},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"temporal logic","score":0.9739999771118164},{"id":"https://openalex.org/keywords/program-verification","display_name":"program verification","score":0.8009999990463257},{"id":"https://openalex.org/keywords/concurrent-program-verification","display_name":"concurrent program verification","score":0.8019999861717224},{"id":"https://openalex.org/keywords/history-variables","display_name":"history variables","score":0.9950000047683716},{"id":"https://openalex.org/keywords/module-specification","display_name":"module specification","score":0.6259999871253967},{"id":"https://openalex.org/keywords/module-composition","display_name":"module composition","score":0.6510000228881836},{"id":"https://openalex.org/keywords/data-transfer-protocols","display_name":"data transmission protocols","score":0.8510000109672546},{"id":"https://openalex.org/keywords/protocol-correctness","display_name":"protocol correctness","score":0.6340000033378601}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8171583414077759},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7891651391983032},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6860661506652832},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.579871654510498},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5740480422973633},{"id":"https://openalex.org/C11648818","wikidata":"https://www.wikidata.org/wiki/Q2403081","display_name":"Temporal logic of actions","level":4,"score":0.5635417103767395},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5403528213500977},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5098044276237488},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48545557260513306},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4832104444503784},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.45712512731552124},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.4534495174884796},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4240453243255615},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.4105070233345032},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.35186243057250977},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3423428237438202},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11607915163040161},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:125106562","doi":null,"is_oa":false,"landing_page_url":"http://i.stanford.edu/pub/cstr/reports/csl/tr/80/192/CSL-TR-80-192.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1509226754","https://openalex.org/W1597456533","https://openalex.org/W1855301476","https://openalex.org/W1970603830","https://openalex.org/W2011399941","https://openalex.org/W2023808162","https://openalex.org/W2029990039","https://openalex.org/W2066125335","https://openalex.org/W2078782651","https://openalex.org/W2101604841","https://openalex.org/W2130140280","https://openalex.org/W2157319504","https://openalex.org/W2340595401"],"related_works":["https://openalex.org/W2165373889","https://openalex.org/W1599562229","https://openalex.org/W100688335","https://openalex.org/W94602661","https://openalex.org/W1514236884","https://openalex.org/W2118956525","https://openalex.org/W7101257711","https://openalex.org/W4248293877","https://openalex.org/W2139930485","https://openalex.org/W7099943749"],"abstract_inverted_index":{"Programs":[0],"that":[1,56,79,89,102],"implement":[2],"computer":[3],"communications":[4],"protocols":[5,84],"can":[6],"exhibit":[7],"extremely":[8],"complicated":[9],"behavior,":[10],"and":[11,94,117,120],"neither":[12],"informal":[13,43],"reasoning":[14,51],"nor":[15],"testing":[16],"is":[17,39,128],"reliable":[18,41],"enough":[19],"to":[20,35],"establish":[21],"their":[22],"correctness.":[23],"In":[24],"this":[25],"paper":[26],"we":[27],"discuss":[28],"the":[29,47,57,60,67,70,138],"application":[30],"of":[31,59,69,75,92,114,125],"program":[32,71,77],"verification":[33,78],"techniques":[34,127],"protocols.":[36],"This":[37],"approach":[38],"more":[40],"than":[42],"reasoning,":[44],"but":[45],"has":[46],"advantage":[48],"over":[49],"formal":[50],"based":[52],"on":[53],"finite-state":[54],"models":[55],"complexity":[58],"proof":[61],"does":[62],"not":[63],"grow":[64],"unmanageably":[65],"as":[66,111],"size":[68],"increases.":[72],"Certain":[73],"tools":[74],"concurrent":[76],"are":[80,85],"especially":[81],"useful":[82],"for":[83,99],"presented:":[86],"history":[87],"variables":[88],"record":[90],"sequences":[91],"input":[93],"output":[95],"values,":[96],"temporal":[97],"logic":[98],"expressing":[100],"properties":[101],"must":[103],"hold":[104],"in":[105],"a":[106,115,132],"future":[107],"system":[108],"state":[109],"(such":[110],"eventual":[112],"receipt":[113],"message),":[116],"module":[118],"specification":[119],"composition":[121],"rules.":[122],"The":[123],"use":[124],"these":[126],"illustrated":[129],"by":[130],"verifying":[131],"simple":[133],"data":[134],"transfer":[135],"protocol":[136],"from":[137],"literature.":[139]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}