Analysis and Exploration of Vulnerabilities

Applied Cryptography Robust Software Quantum Safety Machine Learning Applied to Security Analysis and Exploration of Vulnerabilities Computer Systems Forensic Analysis Reverse Engineering Identification, Authentication and Authorization Secure Execution Environments Direito da Organização e da Segurança

Analysis and Exploration of Vulnerabilities
Vulnerabilities
Vulnerability Assessment of Networked Systems
Enumeration and Information Leakage
Injection
Broken Authentication
XSS Cross Site Scripting
Concurrency
Buffers

Powered by GitBook

On this page

Serializability

PreviousCWE-362 – Race Condition NextDatabase ACID characteristic

Last updated 10 months ago

Serializability is the classical concurrency scheme.

It ensures that a schedule for executing concurrent transactions is equivalent to one that executes the transactions serially in some order.
- It assumes that all accesses to the database are done using read and write operations.
A schedule is called "correct" if we can find a serial schedule that is "equivalent'' to it.

Given a set of transactions, two schedules of these transactions are equivalent if the following conditions are satisfied:

Read-Write Synchronization: If a transaction reads a value written by another transaction in one schedule, then it also does so in the other schedule.
Write-Write Synchronization: If a transaction overwrites the value of another transaction in one schedule, it also does so in the other schedule.