Chronos - A static race detector for the go language

HTTP/2 Last Frame Synchronization (also known as Single Packet Attack) low Level Library / Tool based on Scapy‌ + Exploit Timing Attacks

OS-Programs related to System Call, Process Creation, Threading, Synchronization, Race condition, Semaphores, Inter-Process-Communication, Pipes, Shared memory, message passing & further more.

Libraries to help with frontend development

Dirty COW restricted to shmem in linux kernel

Pentesting challenges

✨ setInterval for promises and async/sync functions. Support graceful shutdown and prevent multiple executions from overlapping in time.

Its a basic level repo for getting started with go lang and its concepts.

Course project: Multithreading (Python) ➟ Thread, daemon thread, join(), ThreadPoolExecutor, race conditions, synchronization, deadlock, producer-consumer

Example programs for illustration of Race Condition and Deadlock for Teaching Operating Systems

Library of Exploiting Last Frame Synchronization (also know as Single Packet Attack) on HTTP/3 - Manipulated version of quic-go lib

A simple project to implement optimistic locking (using versioning) on DynamoDB.

An efficient Promise lock for Node.js projects, ensuring mutually exclusive execution of asynchronous tasks. Key features include a backpressure indicator and the ability to gracefully await the completion of all currently executing or pending tasks, making it ideal for robust production applications requiring smooth teardown.

단국대학교 운영체제보안 과제

Explore diverse Linux Kernel Thread examples demonstrating race conditions, parallel executions, processor ID retrievals, and more, with structured subdirectories containing explanatory READMEs, source code, and Makefiles.

Producer - Consumer problem in C.

In this project, you will learn the basics of threading a process. You will see how to create threads and you will discover mutexes

Repository contenente l'esame e la simulazione del corso Sistemi Operativi.

Educational race condition attack scripts for Burp Suite laboratories - Master's Degree in Cybersecurity exercise

🍝 A concurrent solution to the classic Dining Philosophers problem using threads and mutexes in C. Includes a bonus version using processes and semaphores for advanced synchronization. Built as part of the 42 school curriculum to explore multithreading, inter-process communication, race conditions, and deadlock prevention.