• A Lightweight Framework for Regular Expression Verification

  

  psu.edu

  Abstract: “Regular expressions and finite state automata have been widely used in programs for pattern searching and string matching. Unfortunately, despite the popularity, regular expressions are difficult to understand and verify even for experienced programmers. Conventional testing techniques remain a challenge as large regular expressions are constantly used for security purposes such as input validation and network intrusion detection. In this paper, we present a lightweight verification framework for regular expressions. In this framework, instead of a large number of test cases, it takes in requirements in natural language descriptions to automatically synthesize formal specifications. By checking the equivalence between the synthesized specifications and target regular expressions, errors will be detected and counterexamples will be reported. We have built a web application prototype and demonstrated its usability with two case studies.”

          Comments
  

  formalmethods pdf python

  • Add  

  1

More like this (3)

• 

  francisrstokes/super-expressive

  

  github.com

  Super Expressive: Build Regexes in (Almost) Natural Language — A library for building regular expressions (something...

  Super Expressive: Build Regexes in (Almost) Natural Language — A library for building regular expressions (something many developers have a problem with in their native format) using an ‘almost natural language’ approach. It’s not for me but the code examples look interesting.

  • Add  

  
• Data Abstraction and Relational Program Logic

  

  arxiv.org

  Abstract: “In a paper published in 1972 Hoare articulated the fundamental notions of hiding invariants and...

  Abstract: “In a paper published in 1972 Hoare articulated the fundamental notions of hiding invariants and simulations. Hiding: invariants on encapsulated data representations need not be mentioned in specifications that com- prise the API of a module. Simulation: correctness of a new data representation and implementation can be established by proving simulation between the old and new implementations using a coupling relation de- fined...

  • Add  

  
• Grep from First Principles, in Golang

  ghost.io

  Recreating grep from First Principles — I love tutorials like this. Will goes through regular expressions,...

  Recreating grep from First Principles — I love tutorials like this. Will goes through regular expressions, Deterministic Finite Automatons, ending with a grep-like tool written in Go.

  • Read
  • Add