M. Abadi, B. Blanchet & C. Fournet (2018):
The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication.
Journal of the ACM 65(1),
pp. 1:1–1:41,
doi:10.1145/3127586.
A. Aldini & M. Bernardo (2009):
A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference.
In: Foundations and Applications of Security Analysis, Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, (ARSPA-WITS),
pp. 18–33,
doi:10.1007/978-3-642-03459-6_2.
C. Baier, J.-P. Katoen, H. Hermanns & V. Wolf (2005):
Comparative branching-time semantics for Markov chains.
Information and Computation 200(2),
pp. 149–214,
doi:10.1016/j.ic.2005.03.001.
A. Bossi, R. Focardi, C. Piazza & S. Rossi (2004):
Verifying Persistent Security Properties.
Computer Languages, Systems and Structures 30(3-4),
pp. 231–258,
doi:10.1016/j.cl.2004.02.005.
H. Boudali, P. Crouzen & M. Stoelinga (2007):
A compositional semantics for dynamic fault trees in terms of interactive Markov chains.
In: Proc. of (ATVA'07.
Springer-Verlag,
pp. 441–456.
Available at https://doi.org/10.1007/978-3-540-75596-8_31.
S. Crafa & S. Rossi (2006):
P-congruences as non-interference for the pi-calculus.
In: Proceedings of the 2006 ACM workshop on Formal methods in security engineering, (FMSE'06),
pp. 13–22,
doi:10.1145/1180337.1180339.
S. Crafa & S. Rossi (2007):
Controlling information release in the pi-calculus.
Information and Computation 205(8),
pp. 1235–1273,
doi:10.1016/j.ic.2007.01.001.
Y. Deng & M. Hennessy (2013):
On the semantics of Markov automata.
Inf. Comput. 222,
pp. 139–168,
doi:10.1016/j.ic.2012.10.010.
A. Di Pierro, C. Hankin & H.Wiklicky (2002):
Approximate Non-Interference.
In: Proc. of the IEEE Computer Security Foundations Workshop (CSFW'02).
IEEE Computer Society Press,
pp. 3–17,
doi:10.1109/CSFW.2002.1021803.
R. Focardi & R. Gorrieri (1994/1995):
A Classification of Security Properties for Process Algebras.
Journal of Computer Security 3(1),
pp. 5–33,
doi:10.3233/JCS-1994/1995-3103.
R. Focardi & R. Gorrieri (2000):
Classification of Security Properties (Part I: Information Flow).
In: R. Focardi & R. Gorrieri: Proc. of Foundations of Security Analysis and Design (FOSAD'00),
LNCS 2171.
Springer-Verlag,
pp. 331–396,
doi:10.1007/3-540-45608-2_6.
R. Focardi, R. Gorrieri & F. Martinelli (2000):
Non Interference for the Analysis of Cryptographic Protocols.
In: U. Montanari, J. D. P. Rolim & E. Welzl: Proc. of Int. Colloquium on Automata, Languages and Programming (ICALP'00),
LNCS 1853.
Springer-Verlag,
pp. 744–755,
doi:10.1007/3-540-45022-X_31.
R. Focardi, R. Gorrieri & F. Martinelli (2003):
Real-Time Information Flow Analysis.
IEEE Journal on Selected Areas in Communications 21(1),
doi:10.1109/JSAC.2002.806122.
R. Focardi, S. Rossi & A. Sabelfeld (2005):
Bridging Language-Based and Process Calculi Security.
In: Foundations of Software Science and Computational Structures, 8th International Conference, (FOSSACS'05),
pp. 299–315,
doi:10.1007/978-3-540-31982-5_19.
J. A. Goguen & J. Meseguer (1982):
Security Policy and Security Models.
In: Proc. of the Symposium on Security and Privacy.
IEEE Computer Society Press,
pp. 11–20,
doi:10.1109/SP.1982.10014.
R. Gorrieri, E. Locatelli & F. Martinelli (2003):
A Simple Language for Real-Time Cryptographic Protocol Analysis.
In: P. Degano: Proc. of European Symposium on Programming (ESOP'03),
LNCS 2618.
Springer-Verlag,
pp. 114–128,
doi:10.1007/3-540-36575-3_9.
M. Hennessy & J. Riely (2002):
Information Flow vs. Resource Access in the Asynchronous Pi-calculus.
ACM Transactions on Programming Languages and Systems (TOPLAS) 24(5),
pp. 566–591,
doi:10.1145/570886.570890.
J. Hillston (1996):
A Compositional Approach to Performance Modelling.
Cambridge Press,
doi:10.1017/CBO9780511569951.
J. Hillston, A. Marin, C. Piazza & S. Rossi (2013):
Contextual Lumpability.
In: Proc. of Valuetools 2013.
ACM Press,
pp. 194–203,
doi:10.4108/icst.valuetools.2013.254408.
H. Mantel (2000):
Unwinding Possibilistic Security Properties.
In: Proc. of the European Symposium on Research in Computer Security (ESoRiCS'00),
LNCS 2895.
Springer-Verlag,
pp. 238–254,
doi:10.1007/10722599_15.
A. Marin & S. Rossi (2014):
On the Relations between Lumpability and Reversibility.
In: Proc. of MASCOTS 2014,
pp. 427–432,
doi:10.1109/MASCOTS.2014.59.
A. Marin & S. Rossi (2017):
On the relations between Markov chain lumpability and reversibility.
Acta Informatica 54(5),
pp. 447–485,
doi:10.1007/s00236-016-0266-1.
J. McLean (1994):
A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions.
In: Proc. of the IEEE Symposium on Security and Privacy (SSP'94).
IEEE Computer Society Press,
pp. 79–93,
doi:10.1109/RISP.1994.296590.
J. K. Millen (1994):
Unwinding Forward Correctability.
In: Proc. of the IEEE Computer Security Foundations Workshop (CSFW'94).
IEEE Computer Society Press,
pp. 2–10,
doi:10.1109/CSFW.1994.315952.
C. Piazza, E. Pivato & S. Rossi (2004):
CoPS - Checker of Persistent Security.
In: Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference (TACAS'04),
pp. 144–152,
doi:10.1007/978-3-540-24730-2_11.
A. Sabelfeld & A. C. Myers (2003):
Language-Based Information-Flow Security.
IEEE Journal on Selected Areas in Communication 21(1),
pp. 5–19,
doi:10.1109/JSAC.2002.806121.
G. Smith & D. M. Volpano (1998):
Secure Information Flow in a Multi-threaded Imperative Language.
In: Proc. of POPL'98.
ACM Press,
pp. 355–364,
doi:10.1145/268946.268975.