{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:14:47Z","timestamp":1775873687832,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0304-3975(91)90224-p","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"253-284","source":"Crossref","is-referenced-by-count":518,"title":["The existence of refinement mappings"],"prefix":"10.1016","volume":"82","author":[{"given":"Mart\u00edn","family":"Abadi","sequence":"first","affiliation":[]},{"given":"Leslie","family":"Lamport","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90224-P_BIB1","series-title":"Technical Report TR86-727","article-title":"Recognizing safety and liveness","author":"Alpera","year":"1986"},{"key":"10.1016\/0304-3975(91)90224-P_BIB2","series-title":"Proc. 2nd Symp. on Logic in Computer Science","first-page":"131","article-title":"Proving boolean combinations of deterministic properties","author":"Alpern","year":"1987"},{"key":"10.1016\/0304-3975(91)90224-P_BIB3","series-title":"Proc. 14th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages","first-page":"13","article-title":"Axioms for concurrent objects","author":"Herlihy","year":"1987"},{"key":"10.1016\/0304-3975(91)90224-P_BIB4","series-title":"Ph.D. thesis","article-title":"Compositional verification of distributed systems","author":"Jonsson","year":"1987"},{"key":"10.1016\/0304-3975(91)90224-P_BIB5","series-title":"Fundamental Algorithms. The Art of Computer Programming, Vol. 1","author":"Knuth","year":"1973"},{"issue":"2","key":"10.1016\/0304-3975(91)90224-P_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","article-title":"Proving the correctness of multiprocess programs","volume":"3","author":"Lamport","year":"1977","journal-title":"IEEE Trans. Software Engineering"},{"issue":"2","key":"10.1016\/0304-3975(91)90224-P_BIB7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1145\/69624.357207","article-title":"Specifying concurrent program modules","volume":"5","author":"Lamport","year":"1983","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"4","key":"10.1016\/0304-3975(91)90224-P_BIB8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TSE.1984.5010246","article-title":"Protocol verification via projections","volume":"10","author":"Lam","year":"1984","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0304-3975(91)90224-P_BIB9","series-title":"Proc. 6th Symp. on the Principles of Distributed Computing","first-page":"137","article-title":"Hierarchical correctness proofs for distributed algorithms","author":"Lynch","year":"1987"},{"key":"10.1016\/0304-3975(91)90224-P_BIB10","series-title":"Stepwise Refinement of Distributed Systems: Models, Formalisms, Correctness","first-page":"544","article-title":"Completeness theorems for automata","volume":"430","author":"Merritt","year":"1990"},{"key":"10.1016\/0304-3975(91)90224-P_BIB11","series-title":"Proc. 14th Symp. on the Principles of Programming Languages","first-page":"1","article-title":"Specification and verification of concurrent programs by \u2200-automata","author":"Manna","year":"1987"},{"key":"10.1016\/0304-3975(91)90224-P_BIB12","series-title":"Ph.D. thesis","article-title":"Axiomatic proof techniques for parallel programs","author":"Owicki","year":"1975"},{"issue":"1","key":"10.1016\/0304-3975(91)90224-P_BIB13","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(86)90007-1","article-title":"Proving entailment between conceptual state specifications","volume":"56","author":"Stark","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90224-P_BIB14","series-title":"Proc. 2nd Symp. on Logic in Computer Science","first-page":"167","article-title":"Verification of concurrent programs: the automata-theoretic framework","author":"Vardi","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190224P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190224P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:53:51Z","timestamp":1555113231000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190224P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["030439759190224P"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90224-p","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}