{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:18:23Z","timestamp":1726409903483},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540781622"},{"type":"electronic","value":"9783540781639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78163-9_16","type":"book-chapter","created":{"date-parts":[[2008,2,29]],"date-time":"2008-02-29T10:30:06Z","timestamp":1204281006000},"page":"157-171","source":"Crossref","is-referenced-by-count":0,"title":["Deriving Bisimulations by Simplifying Partitions"],"prefix":"10.1007","author":[{"given":"Isabella","family":"Mastroeni","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","series-title":"ENTCS","volume-title":"Proc. of MFPS 2007","author":"A. Banerjee","year":"2007","unstructured":"Banerjee, A., Giacobazzi, R., Mastroeni, I.: What you lose is what you leak: Information leakage in declassification policies. In: Proc. of MFPS 2007. ENTCS, vol.\u00a01514, Elsevier, Amsterdam (2007)"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11679219_7","volume-title":"Formal Aspects in Security and Trust","author":"J.W. Bryans","year":"2006","unstructured":"Bryans, J.W., et al.: Opacity generalized to transition systems. In: Dimitrakos, T., et al. (eds.) FAST 2005. LNCS, vol.\u00a03866, pp. 81\u201395. Springer, Heidelberg (2006)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., et al.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 154\u2013169. Springer, Heidelberg (2000)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/268946.268962","volume-title":"Proc. of POPL 1998","author":"C. Collberg","year":"1998","unstructured":"Collberg, C., Thomborson, C., Low, D.: Manufactoring cheap, resilient, and stealthy opaque constructs. In: Proc. of POPL 1998, pp. 184\u2013196. ACM Press, New York (1998)"},{"key":"16_CR5","first-page":"238","volume-title":"Proc. of POPL 1977","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. of POPL 1977, pp. 238\u2013252. ACM Press, New York (1977)"},{"key":"16_CR6","first-page":"269","volume-title":"Proc. of POPL 1979","author":"P. Cousot","year":"1979","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Proc. of POPL 1979, pp. 269\u2013282. ACM Press, New York (1979)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11784180_9","volume-title":"Algebraic Methodology and Software Technology","author":"M. Preda Dalla","year":"2006","unstructured":"Dalla Preda, M., et al.: Opaque predicates detection by abstract interpretation. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol.\u00a04019, pp. 81\u201395. Springer, Heidelberg (2006)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1145\/964001.964017","volume-title":"Proc. of POPL 2004","author":"R. Giacobazzi","year":"2004","unstructured":"Giacobazzi, R., Mastroeni, I.: Abstract non-interference: Parameterizing non-interference by abstract interpretation. In: Proc. of POPL 2004, pp. 186\u2013197. ACM Press, New York (2004)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/3-540-47764-0_20","volume-title":"Static Analysis","author":"R. Giacobazzi","year":"2001","unstructured":"Giacobazzi, R., Quintarelli, E.: Incompleteness, counterexamples and refinements in abstract model-checking. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 356\u2013373. Springer, Heidelberg (2001)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/3-540-63165-8_230","volume-title":"Automata, Languages and Programming","author":"R. Giacobazzi","year":"1997","unstructured":"Giacobazzi, R., Ranzato, F.: Refining and compressing abstract domains. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 771\u2013781. Springer, Heidelberg (1997)"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/333979.333989","volume":"47","author":"R. Giacobazzi","year":"2000","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making abstract interpretations complete. J. of the ACM\u00a047(2), 361\u2013416 (2000)","journal-title":"J. of the ACM"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11547662_13","volume-title":"Static Analysis","author":"S. Hunt","year":"2005","unstructured":"Hunt, S., Mastroeni, I.: The PER model of abstract non-interference. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, pp. 171\u2013185. Springer, Heidelberg (2005)"},{"key":"16_CR13","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"issue":"6","key":"16_CR14","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing\u00a016(6), 977\u2013982 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-540-31980-1_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F. Ranzato","year":"2005","unstructured":"Ranzato, F., Tapparo, F.: An abstract interpretation-based refinement algorithm for strong preservation. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 140\u2013156. Springer, Heidelberg (2005)"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1093\/logcom\/exl035","volume":"17","author":"F. Ranzato","year":"2007","unstructured":"Ranzato, F., Tapparo, F.: Generalized strong preservation by abstract interpretation. Journal of Logic and Computation\u00a017(1), 157\u2013197 (2007)","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1011553200337","volume":"14","author":"A. Sabelfeld","year":"2001","unstructured":"Sabelfeld, A., Sands, D.: A PER model of secure information flow in sequential programs. Higher-Order and Symbolic Computation\u00a014(1), 59\u201391 (2001)","journal-title":"Higher-Order and Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78163-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:34Z","timestamp":1619521234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78163-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540781622","9783540781639"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78163-9_16","relation":{},"subject":[]}}