DFA regular expression library & friends

Efficient C implementation of Differential Fault Analysis on AES (round 8 or 9)

The Abstract Programming Language Interface (APLI) is a framework for generating Abstract Syntax Trees (ASTs) to enable developers to create domain-specific languages faster.

A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as which states the graph sta…

Adaptive side-channel analysis on white-box block cipher implementations

This is about DFA optimization/Minimization in C program

"Testing Static Analyses for Precision and Soundness". This is an artifact of our work accepted at the CGO 2020.

Topologic Python Library. A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as …

An implementation in C of SIMECK lightweight block ciphers and the simulation of Differential Fault Analysis (DFA) attacks against this family of ciphers

An implementation for table redundancy method for protecting against Differential Fault Analysis (DFA) in white-box cryptography

Finite State Machine generator.

REL is a non-backtracking regular expression engine with support for constant lookahead and submatch tracking.

Important C and C++ programs for computer engineers.

A simple free-form interpreted language for building Turing machines and other automata

This project is a Lexical Analyzer (Scanner) implemented in C, designed to tokenize a simple programming language. It processes an input string (source code) and identifies valid tokens such as keywords, identifiers, numbers, operators, and punctuation marks. The analyzer is based on a Deterministic Finite Automaton (DFA).

DFA (Deterministic Finite Automata)

This is a UDP based protocol that works like FTP. Using UDP makes it faster and efficient.

18CSC304J - Compiler Design course