Taming the Length Field in Binary Data - Calc-Regular Languages

Explore a 22-minute IEEE conference talk that delves into the challenges of handling length fields in binary data serialization languages. Learn about the concept of calc-regular languages, a proposed extension of regular languages designed to handle length-prefix formats efficiently. Discover why length-prefix languages are not context-free and how calc-regular expressions offer a solution for parsing these languages using finite-state machines with accumulators. Gain insights into the security implications of mismatched data serialization languages between senders and receivers, and understand the importance of proper message validation in preventing potential security compromises.