Write a Blog >>
PLDI 2020
Mon 15 - Fri 19 June 2020
Fri 19 Jun 2020 17:00 - 18:00 at Sponsors - Microsoft meeting

Symbolic means that characters are given by predicates instead of concrete symbols and extended means that intersection and complement are supported in regexes. We consider a new match generation algorithm that is based on derivatives of symbolic regexes. The algorithm has been implemented as a tool SRM within the open source Microsoft Automata framework and uses the .NET regex parser as a frontend. We also discuss other uses and work in progress involving analysis with symbolic regexes.

Fri 19 Jun

Displayed time zone: Pacific Time (US & Canada) change

17:00 - 18:00
Microsoft meetingSponsors at Sponsors

Join researchers and interns for an interactive show and tell on the latest PL advances from Microsoft. Join Microsoft’s Zoom meeting

The meeting id and password will be distributed to attendees via the conference Slack workspace.

Symbolic Extended Regular Expressions Matching and Analysis
Margus Veanes Microsoft Research, Caleb Stanford University of Pennsylvania