Symbolic backward reachability with effectively propositional logic. Application to security policy analysis (Q2441771): Difference between revisions

@@ Property / cites work @@
+Q2730725
@@ Property / cites work: Q2730725 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4052071
@@ Property / cites work: Q4052071 / rank @@
+Normal rank
@@ Property / cites work @@
+Access Nets: Modeling Access to Physical Spaces
@@ Property / cites work: Access Nets: Modeling Access to Physical Spaces / rank @@
+Normal rank
@@ Property / cites work @@
+Q4417916
@@ Property / cites work: Q4417916 / rank @@
+Normal rank
@@ Property / cites work @@
+Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
+Normal rank
@@ Property / cites work @@
+MCMT: A Model Checker Modulo Theories
@@ Property / cites work: MCMT: A Model Checker Modulo Theories / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003410
@@ Property / cites work: Q4003410 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for classes of quantificational formulas
+Normal rank
@@ Property / cites work @@
+Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
+Normal rank
@@ Property / cites work @@
+The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
+Normal rank
@@ Property / cites work @@
+Policy analysis for administrative role-based access control
+Normal rank
@@ Property / cites work @@
+Combining nonstably infinite theories
@@ Property / cites work: Combining nonstably infinite theories / rank @@
+Normal rank