Noninterference under Weak Memory Models (Progress Report)

[1]  Pierre Wolper,et al.  A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems , 2013, TACAS.

[2]  Jade Alglave,et al.  A formal hierarchy of weak memory models , 2012, Formal Methods in System Design.

[3]  Bernard P. Serpette,et al.  Relaxed Operational Semantics of Concurrent Programming Languages , 2012, EXPRESS/SOS.

[4]  Heiko Mantel,et al.  Scheduler-Independent Declassification , 2012, MPC.

[5]  Todd D. Millstein,et al.  Secure Information Flow for Concurrent Programs under Total Store Order , 2012, 2012 IEEE 25th Computer Security Foundations Symposium.

[6]  Jade Alglave,et al.  Stability in Weak Memory Models , 2011, CAV.

[7]  Pierre Wolper,et al.  A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems , 2011, SPIN.

[8]  David Sands,et al.  Assumptions and Guarantees for Compositional Noninterference , 2011, 2011 IEEE 24th Computer Security Foundations Symposium.

[9]  Jade Alglave,et al.  Understanding POWER multiprocessors , 2011, PLDI '11.

[10]  Eran Yahav,et al.  Automatic inference of memory fences , 2010, Formal Methods in Computer Aided Design.

[11]  Heiko Mantel,et al.  Flexible Scheduler-Independent Security , 2010, ESORICS.

[12]  Jade Alglave,et al.  Fences in Weak Memory Models , 2010, CAV.

[13]  Peter Sewell,et al.  A Better x86 Memory Model: x86-TSO , 2009, TPHOLs.

[14]  Sebastian Burckhardt,et al.  CheckFence: checking consistency of concurrent data types on relaxed memory models , 2007, PLDI '07.

[15]  Heiko Mantel,et al.  Transformational typing and unification for automatically correcting insecure programs , 2007, International Journal of Information Security.

[16]  Alejandro Russo,et al.  Securing interaction between threads and the scheduler , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).

[17]  Igor Siveroni,et al.  Filling Out the Gaps: A Padding Algorithm for Transforming Out Timing Leaks , 2006, QAPL.

[18]  David Sands,et al.  Dimensions and principles of declassification , 2005, 18th IEEE Computer Security Foundations Workshop (CSFW'05).

[19]  Jaejin Lee,et al.  Automatic fence insertion for shared memory multiprocessing , 2003, ICS '03.

[20]  Ilaria Castellani,et al.  Noninterference for concurrent programs and thread systems , 2002, Theor. Comput. Sci..

[21]  Geoffrey Smith,et al.  A new type system for secure information flow , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[22]  David Sands,et al.  Probabilistic noninterference for multi-threaded programs , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[23]  Johan Agat,et al.  Transforming out timing leaks , 2000, POPL '00.

[24]  Geoffrey Smith,et al.  Probabilistic noninterference in a concurrent language , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).

[25]  Sarita V. Adve,et al.  Shared Memory Consistency Models: A Tutorial , 1996, Computer.

[26]  Geoffrey Smith,et al.  A Sound Type System for Secure Flow Analysis , 1996, J. Comput. Secur..

[27]  Dennis Shasha,et al.  Efficient and correct execution of parallel programs that share memory , 1988, TOPL.

[28]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[29]  John M. Rushby,et al.  Design and verification of secure systems , 1981, SOSP.

[30]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[31]  Gregory R. Andrews,et al.  Certifying information flow properties of programs: an axiomatic approach , 1979, POPL '79.

[32]  Dorothy E. Denning,et al.  A lattice model of secure information flow , 1976, CACM.

[33]  Butler W. Lampson,et al.  A note on the confinement problem , 1973, CACM.