{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T23:03:06Z","timestamp":1770418986559,"version":"3.49.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030310370","type":"print"},{"value":"9783030310387","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31038-7_3","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"39-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Whither Specifications as Programs"],"prefix":"10.1007","author":[{"given":"David A.","family":"Naumann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minh","family":"Ngo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(94)00195-5","volume":"53","author":"C Aarts","year":"1995","unstructured":"Aarts, C., et al.: Fixed-point calculus. Inf. Process. Lett. 53(3), 131\u2013136 (1995)","journal-title":"Inf. Process. Lett."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Assaf, M., Naumann, D.A.: Calculational design of information flow monitors. In: Computer Security Foundations (2016)","DOI":"10.1109\/CSF.2016.22"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Assaf, M., Naumann, D.A., Signoles, J., Totel, \u00c9., Tronel, F.: Hypercollecting semantics and its application to static analysis of information flow. In: POPL (2017)","DOI":"10.1145\/3009837.3009889"},{"key":"3_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1674-2","volume-title":"Refinement Calculus: A Systematic Introduction","author":"RJ Back","year":"1998","unstructured":"Back, R.J., von Wright, J.: Refinement Calculus: A Systematic Introduction. Springer, New York (1998). \n                      https:\/\/doi.org\/10.1007\/978-1-4612-1674-2"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Balliu, M., Dam, M., Guernic, G.L.: Epistemic temporal logic for information flow security. In: Programming Languages and Analysis for Security (2011)","DOI":"10.1145\/2166956.2166962"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-16690-7_5","volume-title":"Unifying Theories of Programming","author":"MJ Banks","year":"2010","unstructured":"Banks, M.J., Jacob, J.L.: Unifying theories of confidentiality. In: Qin, S. (ed.) UTP 2010. LNCS, vol. 6445, pp. 120\u2013136. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16690-7_5"},{"issue":"5","key":"3_CR7","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1007\/s00165-013-0285-4","volume":"26","author":"MJ Banks","year":"2014","unstructured":"Banks, M.J., Jacob, J.L.: On integrating confidentiality and functionality in a formal method. Formal Aspects Comput. 26(5), 963\u2013992 (2014)","journal-title":"Formal Aspects Comput."},{"key":"3_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61455-2_12","volume-title":"Algebra of Programming","author":"R Bird","year":"1996","unstructured":"Bird, R., de Moor, O.: Algebra of Programming. Prentice-Hall, Upper Saddle River (1996)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-54792-8_15","volume-title":"Principles of Security and Trust","author":"MR Clarkson","year":"2014","unstructured":"Clarkson, M.R., Finkbeiner, B., Koleini, M., Micinski, K.K., Rabe, M.N., S\u00e1nchez, C.: Temporal logics for hyperproperties. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 265\u2013284. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-642-54792-8_15"},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"key":"3_CR11","series-title":"NATO ASI Series F","volume-title":"Calculational System Design","author":"P Cousot","year":"1999","unstructured":"Cousot, P.: The calculational design of a generic abstract interpreter. In: Broy, M., Steinbr\u00fcggen, R. (eds.) Calculational System Design. NATO ASI Series F, vol. 173. IOS Press, Amsterdam (1999)"},{"issue":"1\u20132","key":"3_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0304-3975(00)00313-3","volume":"277","author":"P Cousot","year":"2002","unstructured":"Cousot, P.: Constructive design of a hierarchy of semantics of a transition system by abstract interpretation. Theor. Comput. Sci. 277(1\u20132), 47\u2013103 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL (1979)","DOI":"10.1145\/567752.567778"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0167-6423(94)90006-X","volume":"22","author":"PH Gardiner","year":"1994","unstructured":"Gardiner, P.H., Martin, C.E., de Moor, O.: An algebraic construction of predicate transformers. Sci. Comput. Program. 22, 21\u201344 (1994)","journal-title":"Sci. Comput. Program."},{"key":"3_CR15","unstructured":"Gotliboym, M., Naumann, D.A.: Some observations on hypercollecting semantics and subset closed hyperproperties. \n                      https:\/\/www.cs.stevens.edu\/~naumann\/pub\/noteSSC.pdf"},{"key":"3_CR16","volume-title":"Reasoning About Knowledge","author":"JY Halpern","year":"1995","unstructured":"Halpern, J.Y., Fagin, R., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-16442-1_14","volume-title":"ESOP 86","author":"J He","year":"1986","unstructured":"He, J., Hoare, C.A.R., Sanders, J.W.: Data refinement refined resume. In: Robinet, B., Wilhelm, R. (eds.) ESOP 1986. LNCS, vol. 213, pp. 187\u2013196. Springer, Heidelberg (1986). \n                      https:\/\/doi.org\/10.1007\/3-540-16442-1_14"},{"key":"3_CR18","first-page":"135","volume":"3","author":"CAR Hoare","year":"1974","unstructured":"Hoare, C.A.R., Lauer, P.E.: Consistent and complementary formal theories of the semantics of programming languages. Acta Inf. 3, 135\u2013153 (1974)","journal-title":"Acta Inf."},{"key":"3_CR19","volume-title":"Unifying Theories of Programming","author":"C Hoare","year":"1998","unstructured":"Hoare, C., He, J.: Unifying Theories of Programming. Prentice-Hall, Upper Saddle River (1998)"},{"issue":"6","key":"3_CR20","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.jlap.2011.04.005","volume":"80","author":"T Hoare","year":"2011","unstructured":"Hoare, T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra and its foundations. J. Log. Algebr. Program. 80(6), 266\u2013296 (2011)","journal-title":"J. Log. Algebr. Program."},{"key":"3_CR21","unstructured":"Jacob, J.: Security specifications. In: IEEE Symposium on Security and Privacy (1988)"},{"issue":"1\u20133","key":"3_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0167-6423(99)00024-6","volume":"37","author":"R Joshi","year":"2000","unstructured":"Joshi, R., Leino, K.R.M.: A semantic approach to secure information flow. Sci. Comput. Program. 37(1\u20133), 113\u2013138 (2000)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/343369.343378","volume":"1","author":"D Kozen","year":"2000","unstructured":"Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Log. 1(1), 60\u201376 (2000)","journal-title":"ACM Trans. Comput. Log."},{"key":"3_CR24","unstructured":"Mantel, H.: On the composition of secure systems. In: IEEE Symposium on Security and Privacy (2002)"},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.scico.2006.01.007","volume":"65","author":"CE Martin","year":"2007","unstructured":"Martin, C.E., Curtis, S.A., Rewitzky, I.: Modelling angelic and demonic nondeterminism with multirelations. Sci. Comput. Program. 65(2), 140\u2013158 (2007)","journal-title":"Sci. Comput. Program."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-319-66706-5_12","volume-title":"Static Analysis","author":"I Mastroeni","year":"2017","unstructured":"Mastroeni, I., Pasqua, M.: Hyperhierarchy of semantics - a formal framework for hyperproperties verification. In: Ranzato, F. (ed.) SAS 2017. LNCS, vol. 10422, pp. 232\u2013252. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66706-5_12"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-319-99725-4_17","volume-title":"Static Analysis","author":"I Mastroeni","year":"2018","unstructured":"Mastroeni, I., Pasqua, M.: Verifying bounded subset-closed hyperproperties. In: Podelski, A. (ed.) SAS 2018. LNCS, vol. 11002, pp. 263\u2013283. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-99725-4_17"},{"key":"3_CR28","volume-title":"Programming from Specifications","author":"C Morgan","year":"1994","unstructured":"Morgan, C.: Programming from Specifications, 2nd edn. Prentice Hall, Upper Saddle River (1994)","edition":"2"},{"issue":"8","key":"3_CR29","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.scico.2007.09.003","volume":"74","author":"C Morgan","year":"2009","unstructured":"Morgan, C.: The shadow knows: refinement and security in sequential programs. Sci. Comput. Program. 74(8), 629\u2013653 (2009)","journal-title":"Sci. Comput. Program."},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BF00277386","volume":"27","author":"C Morgan","year":"1990","unstructured":"Morgan, C., Gardiner, P.: Data refinement by calculation. Acta Inf. 27, 481\u2013503 (1990)","journal-title":"Acta Inf."},{"issue":"4","key":"3_CR31","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1516507.1516511","volume":"31","author":"JM Morris","year":"2009","unstructured":"Morris, J.M., Bunkenburg, A., Tyrrell, M.: Term transformers: a new approach to state. ACM Trans. Program. Lang. Syst. 31(4), 16 (2009)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BF01210999","volume":"7","author":"DA Naumann","year":"1995","unstructured":"Naumann, D.A.: Data refinement, call by value, and higher order programs. Formal Aspects Comput. 7, 652\u2013662 (1995)","journal-title":"Formal Aspects Comput."},{"issue":"4","key":"3_CR33","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0960129598002552","volume":"8","author":"DA Naumann","year":"1998","unstructured":"Naumann, D.A.: A categorical model for higher order imperative programming. Math. Struct. Comput. Sci. 8(4), 351\u2013399 (1998)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"5","key":"3_CR34","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.jlamp.2015.10.008","volume":"85","author":"DA Naumann","year":"2016","unstructured":"Naumann, D.A.: Towards patterns for heaps and imperative lambdas. J. Log. Algebraic Methods Program. 85(5), 1038\u20131056 (2016)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-58618-0_55","volume-title":"Computer Security \u2014 ESORICS 94","author":"AW Roscoe","year":"1994","unstructured":"Roscoe, A.W., Woodcock, J.C.P., Wulf, L.: Non-interference through determinism. In: Gollmann, D. (ed.) ESORICS 1994. LNCS, vol. 875, pp. 31\u201353. Springer, Heidelberg (1994). \n                      https:\/\/doi.org\/10.1007\/3-540-58618-0_55"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"517","DOI":"10.3233\/JCS-2009-0352","volume":"17","author":"A Sabelfeld","year":"2007","unstructured":"Sabelfeld, A., Sands, D.: Dimensions and principles of declassification. J. Comput. Secur. 17, 517\u2013548 (2007)","journal-title":"J. Comput. Secur."},{"key":"3_CR37","series-title":"AMAST Series in Computing","doi-asserted-by":"publisher","DOI":"10.1142\/2870","volume-title":"An Algebraic Approach to Compiler Design","author":"A Sampaio","year":"1997","unstructured":"Sampaio, A.: An Algebraic Approach to Compiler Design. AMAST Series in Computing, vol. 4. World Scientific, Singapore (1997)"},{"issue":"4","key":"3_CR38","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.ipl.2015.11.007","volume":"116","author":"G Struth","year":"2016","unstructured":"Struth, G.: On the expressive power of Kleene algebra with domain. Inf. Process. Lett. 116(4), 284\u2013288 (2016)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Unifying Theories of Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31038-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:22:49Z","timestamp":1569194569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31038-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030310370","9783030310387"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31038-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UTP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Unifying Theories of Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"utp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.york.ac.uk\/circus\/utp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}