From Security Protocols to Pushdown Automata (Q5277904): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1145/2811262
@@ Property / full work available at URL: https://doi.org/10.1145/2811262 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2102565724
@@ Property / OpenAlex ID: W2102565724 / rank @@
+Normal rank
@@ Property / cites work @@
+Automated verification of selected equivalences for security protocols
+Normal rank
@@ Property / cites work @@
+Proving More Observational Equivalences with ProVerif
+Normal rank
@@ Property / cites work @@
+Decidability of equivalence of symbolic derivations
+Normal rank
@@ Property / cites work @@
+Q4447230
@@ Property / cites work: Q4447230 / rank @@
+Normal rank
@@ Property / cites work @@
+The inclusion problem for simple languages
@@ Property / cites work: The inclusion problem for simple languages / rank @@
+Normal rank
@@ Property / cites work @@
+LALBLC A Program Testing the Equivalence of dpda’s
+Normal rank
@@ Property / cites work @@
+Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
+Normal rank
@@ Property / cites work @@
+The equivalence problem for deterministic pushdown automata is decidable
+Normal rank
@@ Property / cites work @@
+Q4737211
@@ Property / cites work: Q4737211 / rank @@
+Normal rank