{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:25:30Z","timestamp":1726043130035},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030302801"},{"type":"electronic","value":"9783030302818"}],"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-30281-8_13","type":"book-chapter","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T23:03:14Z","timestamp":1567551794000},"page":"222-238","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Process Algebra for (Delimited) Persistent Stochastic Non-Interference"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Marin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"Piazza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,4]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ic.2018.04.002","volume":"260","author":"G Alzetta","year":"2018","unstructured":"Alzetta, G., Marin, A., Piazza, C., Rossi, S.: Lumping-based equivalences in markovian automata: algorithms and applications to product-form analyses. Inf. Comput. 260, 99\u2013125 (2018)","journal-title":"Inf. Comput."},{"unstructured":"Backes, M., Pfitzmann, B.: Intransitive non-interference for cryptographic purposes. In Proceedings of the IEEE Symposium on Security and Privacy (SSP 2003), IEEE, pp. 140\u2013152 (2003)","key":"13_CR2"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44743-1_3","volume-title":"Parallel Computing Technologies","author":"C Bodei","year":"2001","unstructured":"Bodei, C., Degano, P., Nielson, F., Nielson, H.R.: Static analysis for secrecy and non-interference in networks of processes. In: Malyshkin, V. (ed.) PaCT 2001. LNCS, vol. 2127, pp. 27\u201341. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44743-1_3"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.entcs.2004.02.006","volume":"99","author":"A Bossi","year":"2004","unstructured":"Bossi, A., Focardi, R., Macedonio, D., Piazza, C., Rossi, S.: Unwinding in information flow security. Electron. Notes Theor. Comput. Sci. 99, 127\u2013154 (2004)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-36384-X_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Bossi","year":"2003","unstructured":"Bossi, A., Focardi, R., Piazza, C., Rossi, S.: Bisimulation and unwinding for verifying possibilistic security properties. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 223\u2013237. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36384-X_19"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45013-0_16","volume-title":"Logic Based Program Synthesis and Transformation","author":"A Bossi","year":"2003","unstructured":"Bossi, A., Focardi, R., Piazza, C., Rossi, S.: A proof system for information flow security. In: Leuschel, M. (ed.) LOPSTR 2002. LNCS, vol. 2664, pp. 199\u2013218. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45013-0_16"},{"issue":"3\u20134","key":"13_CR7","first-page":"231","volume":"30","author":"A Bossi","year":"2004","unstructured":"Bossi, A., Focardi, R., Piazza, C., Rossi, S.: Verifying persistent security properties. Comput. Lang. Syst. Struct. 30(3\u20134), 231\u2013258 (2004)","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.3233\/JCS-2005-13303","volume":"13","author":"A Bossi","year":"2005","unstructured":"Bossi, A., Macedonio, D., Piazza, C., Rossi, S.: Information flow in secure contexts. J. Comput. Secur. 13(3), 391\u2013422 (2005)","journal-title":"J. Comput. Secur."},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.3233\/JCS-2007-15303","volume":"15","author":"A Bossi","year":"2007","unstructured":"Bossi, A., Piazza, C., Rossi, S.: Compositional information flow security for concurrent programs. J. Comput. Secur. 15(3), 373\u2013416 (2007)","journal-title":"J. Comput. Secur."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/3-540-48224-5_32","volume-title":"Automata, Languages and Programming","author":"G Boudol","year":"2001","unstructured":"Boudol, G., Castellani, I.: Noninterference for concurrent programs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 382\u2013395. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_32"},{"doi-asserted-by":"crossref","unstructured":"Braghin, C., Cortesi, A., Focardi, R.: Control flow analysis of mobile ambients with security boundaries. In: Proceedings of IFIPM International Conference on Formal Methods for Open Object-Based Distributed Systems, Kluwer, pp. 197\u2013212 (2002)","key":"13_CR11","DOI":"10.1007\/978-0-387-35496-5_14"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-66335-7_17","volume-title":"Quantitative Evaluation of Systems","author":"C Cheh","year":"2017","unstructured":"Cheh, C., Chen, B., Temple, W.G., Sanders, W.H.: Data-driven model-based detection of malicious insiders via physical access logs. In: Bertrand, N., Bortolussi, L. (eds.) QEST 2017. LNCS, vol. 10503, pp. 275\u2013291. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66335-7_17"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-47813-2_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R Focardi","year":"2002","unstructured":"Focardi, R., Piazza, C., Rossi, S.: Proofs methods for bisimulation based information flow security. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, pp. 16\u201331. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47813-2_2"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3233\/JCS-2006-14103","volume":"14","author":"R Focardi","year":"2006","unstructured":"Focardi, R., Rossi, S.: Information flow security in dynamic contexts. J. Comput. Secur. 14(1), 65\u2013110 (2006)","journal-title":"J. Comput. Secur."},{"doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP 1982), pp. 11\u201320 (1982)","key":"13_CR15","DOI":"10.1109\/SP.1982.10014"},{"doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Unwinding and inference control. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP 1984), pp. 75\u201386 (1984)","key":"13_CR16","DOI":"10.1109\/SP.1984.10019"},{"unstructured":"Hedin, D., Sabelfeld, A.: A perspective on information-flow control. In: Software Safety and Security - Tools for Analysis and Verification, IOS Press, pp. 319\u2013347 (2012)","key":"13_CR17"},{"issue":"5","key":"13_CR18","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1145\/570886.570890","volume":"24","author":"M Hennessy","year":"2002","unstructured":"Hennessy, M., Riely, J.: Information flow vs. resource access in the asynchronous pi-calculus. ACM Trans. Program. Lang. Syst. (TOPLAS) 24(5), 566\u2013591 (2002)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"13_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569951","volume-title":"A Compositional Approach to Performance Modelling","author":"J Hillston","year":"1996","unstructured":"Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge Press, Cambridge (1996)"},{"doi-asserted-by":"crossref","unstructured":"Hillston, J., Marin, A., Piazza, C., Rossi, S.: Contextual lumpability. In: Proceedings of Valuetools 2013 Conference, ACM Press, pp. 194\u2013203 (2013)","key":"13_CR20","DOI":"10.4108\/icst.valuetools.2013.254408"},{"doi-asserted-by":"crossref","unstructured":"Hillston, J., Marin, A., Piazza, C., Rossi, S.: Information flow security for stochastic processes. In: Computer Performance Engineering - 15th European Workshop, EPEW, pp. 142\u2013156 (2018)","key":"13_CR21","DOI":"10.1007\/978-3-030-02227-3_10"},{"doi-asserted-by":"crossref","unstructured":"Hillston, J., Marin, A., Piazza, C., Rossi, S.: Delimited persistent stochastic non-interference. In: Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2019, pp. 135\u2013142 (2019)","key":"13_CR22","DOI":"10.1145\/3306309.3306329"},{"doi-asserted-by":"crossref","unstructured":"Hillston, J., Marin, A., Piazza, C., Rossi, S.: Persistent stochastic non-interference. Information and Computation (2019, Submitted)","key":"13_CR23","DOI":"10.1145\/3306309.3306329"},{"unstructured":"Hillston, J., Piazza, C., Rossi, S.: Persistent stochastic non-interference. In: Proceedings of Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics and 15th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2018, pp. 53\u201368 (2018)","key":"13_CR24"},{"unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. D. Van Nostrand Company Inc. (1960)","key":"13_CR25"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0661(04)00311-1","volume":"61","author":"S Lafrance","year":"2002","unstructured":"Lafrance, S., Mullins, J.: Bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols. Electron. Notes Theor. Comput. Sci. 61, 1\u201324 (2002)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"unstructured":"Mantel, H.: Possibilistic definitions of security - an assembly kit -. In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW 2000), IEEE Computer Society Press, pp. 185\u2013199 (2000)","key":"13_CR27"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/10722599_15","volume-title":"Computer Security - ESORICS 2000","author":"H Mantel","year":"2000","unstructured":"Mantel, H.: Unwinding possibilistic security properties. In: Cuppens, F., Deswarte, Y., Gollmann, D., Waidner, M. (eds.) ESORICS 2000. LNCS, vol. 1895, pp. 238\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722599_15"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-45251-6_9","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity","author":"H Mantel","year":"2001","unstructured":"Mantel, H.: Information flow control and applications \u2014 bridging a gap \u2014. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 153\u2013172. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45251-6_9"},{"unstructured":"Martinelli, F.: Partial model checking and theorem proving for ensuring security properties. In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW 1998), IEEE Computer Society Press, pp. 44\u201352 (1998)","key":"13_CR30"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1109\/32.55085","volume":"16","author":"D McCullough","year":"1990","unstructured":"McCullough, D.: A hookup theorem for multilevel security. IEEE Trans. Software Eng. 16, 563\u2013568 (1990)","journal-title":"IEEE Trans. Software Eng."},{"unstructured":"McLean, J.: A general theory of composition for trace sets closed under selective interleaving functions. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP 1994), IEEE Computer Society Press, pp. 79\u201393 (1994)","key":"13_CR32"},{"unstructured":"Millen, J.K.: Unwinding forward correctability. In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW 1994), IEEE Computer Society Press, pp. 2\u201310 (1994)","key":"13_CR33"},{"key":"13_CR34","first-page":"1054","volume":"11","author":"J Mullins","year":"2000","unstructured":"Mullins, J.: Nondeterministic admissible interference. J. Univers. Comput. Sci. 11, 1054\u20131070 (2000)","journal-title":"J. Univers. Comput. Sci."},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-24730-2_11","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Carla Piazza","year":"2004","unstructured":"Piazza, C., Pivato, E., Rossi, S.: Cops - checker of persistent security. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004), pp. 144\u2013152 (2004)"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-319-99154-2_23","volume-title":"Quantitative Evaluation of Systems","author":"M Rausch","year":"2018","unstructured":"Rausch, M., Fawaz, A., Keefe, K., Sanders, W.H.: Modeling humans: a general agent model for the evaluation of security. In: McIver, A., Horvath, A. (eds.) QEST 2018. LNCS, vol. 11024, pp. 373\u2013388. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99154-2_23"},{"unstructured":"Roscoe, A.W., Goldsmith, M.H.: What is intransitive noninterference? In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW 1999), pp. 228\u2013238 (1999)","key":"13_CR37"},{"unstructured":"Rushby, J.: Noninterference, transitivity, and channel-control security policies. Technical Report CSL-92-02, SRI International, December 1992","key":"13_CR38"},{"unstructured":"Ryan, P.Y.A.: A CSP Formulation of Non-Interference and Unwinding. Cipher, pp. 19\u201327 (1991)","key":"13_CR39"},{"issue":"1\/2","key":"13_CR40","doi-asserted-by":"publisher","first-page":"75","DOI":"10.3233\/JCS-2001-91-204","volume":"9","author":"PYA Ryan","year":"2001","unstructured":"Ryan, P.Y.A., Schneider, S.: Process algebra and non-interference. J. Comput. Secur. 9(1\/2), 75\u2013103 (2001)","journal-title":"J. Comput. Secur."},{"unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW 2000), IEEE Computer Society Press, pp. 200\u2013215 (2000)","key":"13_CR41"},{"doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.M.: Secure information flow in a multi-threaded imperative language. In: Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1998), ACM Press, pp. 355\u2013364 (1998)","key":"13_CR42","DOI":"10.1145\/268946.268975"},{"doi-asserted-by":"crossref","unstructured":"von Oheimb, D.: Information flow control revisited: noninfluence = noninterference + nonleakage. In: Computer Security (ESORICS 2004), pp. 225\u2013243 (2004)","key":"13_CR43","DOI":"10.1007\/978-3-540-30108-0_14"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30281-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T10:33:45Z","timestamp":1664274825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30281-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030302801","9783030302818"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30281-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"10 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.qest.org\/qest2019\/","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":"40","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":"17","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":"2","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":"43% - 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":"3","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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}