Hyper Partial Order Logic
暂无分享,去创建一个
[1] Sylvain Schmitz,et al. The Complexity of Diagnosability and Opacity Verification for Petri Nets , 2017, Petri Nets.
[2] Swarat Chaudhuri,et al. Model Checking on Trees with Path Equivalences , 2007, TACAS.
[3] Benoît Caillaud,et al. Concurrent Secrets , 2007, 2006 8th International Workshop on Discrete Event Systems.
[4] Clemens Lautemann,et al. Tree Automata, Tree Decomposition and Hyperedge Replacement , 1990, Graph-Grammars and Their Application to Computer Science.
[5] Andrew C. Myers,et al. Language-based information-flow security , 2003, IEEE J. Sel. Areas Commun..
[6] Loïc Hélouët,et al. Non-interference in Partial Order Models , 2015, ACSD.
[7] P. S. Thiagarajan,et al. The MSO Theory of Connectedly Communicating Processes , 2005, FSTTCS.
[8] Bernd Finkbeiner,et al. Temporal Logics for Hyperproperties , 2013, POST.
[9] Paul D. Seymour,et al. Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.
[10] C. Aiswarya,et al. MSO Decidability of Multi-Pushdown Systems via Split-Width , 2012, CONCUR.
[11] J. Meseguer,et al. Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.
[12] Walter Vogler,et al. An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..
[13] Doron A. Peled,et al. Specification and Verification of Message Sequence Charts , 2000, FORTE.
[14] Sarah Winter,et al. Trees over Infinite Structures and Path Logics with Synchronization , 2011, INFINITY.
[15] Benedikt Bollig,et al. Propositional Dynamic Logic for Message-Passing Systems , 2010, Log. Methods Comput. Sci..
[16] Heiko Mantel,et al. Possibilistic definitions of security-an assembly kit , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.
[17] Joost Engelfriet,et al. Branching processes of Petri nets , 1991, Acta Informatica.
[18] P. Madhusudan,et al. Beyond Message Sequence Graphs , 2001, FSTTCS.
[19] Paolo Baldan,et al. Unfolding-Based Diagnosis of Systems with an Evolving Topology , 2008, CONCUR.
[20] Ramaswamy Ramanujam,et al. Reasoning about Layered Message Passing Systems , 2003, VMCAI.
[21] Roberto Gorrieri,et al. On the Decidability of Non Interference over Unbounded Petri Nets , 2010, SecCo.
[22] Bruno Courcelle,et al. Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach , 2012, Encyclopedia of mathematics and its applications.
[23] Kenneth L. McMillan,et al. A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..
[24] Bruno Courcelle,et al. The Monadic Second-Order Logic of Graphs X: Linear Orderings , 1996, Theor. Comput. Sci..
[25] Annegret Habel,et al. Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.