Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Lean Formalization of Extended Regular Expression Matching with Lookarounds

ACM SIGPLAN via YouTube

Start learning Write review
Boot.dev Ad

The Most Addictive Python and SQL Courses

Learn More → TrainSec Ad

Master Windows Internals - Kernel Programming, Debugging & Architecture

Learn More →

Overview

Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a 28-minute conference talk from CPP 2024 that delves into the Lean formalization of extended regular expression matching with lookarounds. Learn about an algorithm for matching extended regular expressions based on locations and symbolic derivatives, supporting intersection, complement, and lookarounds. Discover how this implementation mirrors an extension of the .NET NonBacktracking regular expression engine. Understand the formalization process using the Lean 4 proof assistant and the proof of correctness with respect to standard matching semantics. Gain insights from researchers Ekaterina Zhuchko, Margus Veanes, and Gabriel Ebner as they present their work on this advanced topic in regular expression matching and formal verification.

Syllabus

[CPP'24] Lean Formalization of Extended Regular Expression Matching with Lookarounds

Taught by

ACM SIGPLAN

Reviews

Start your review of Lean Formalization of Extended Regular Expression Matching with Lookarounds

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.