Paul Schaub: Implementing Packet Sequence Validation using Pushdown Automata
This is part 2 of a small series on verifying the validity of packet sequences using tools from theoretical computer science. Read part 1 here.

In the previous blog post I discussed how a formal grammar can be transformed into a pushdown automaton in order to check if a sequence of packets or token โ€ฆ โŒ˜ Read more

โค‹ Read More

Participate

Login or Register to join in on this yarn.