Python Test Concurrent Code for Race Conditions

Concurrent bugs may appear only under certain timing.

Understanding the Concept

Concurrent bugs may appear only under certain timing. Tests should repeatedly exercise invariants, use barriers to coordinate interesting interleavings and enforce timeouts to detect hangs.

A deterministic invariant is stronger than a test that assumes a specific scheduling order.

How to reason about concurrent execution

Workers may start and finish in a different order on every run. Focus on ownership of data, how work and errors move between workers, and what happens when one worker stops early. Locks protect invariants, queues exchange messages, and explicit shutdown logic prevents blocked or orphaned workers.

Concurrency adds overhead and failure modes. Begin with a working sequential solution, choose bounded worker counts and explicit timeouts, then measure whether overlap or parallel execution improves the target workload.

Worked Example

Read the code from the first line to the last. Identify which values are inputs, which operation is being demonstrated and what should happen before running it.

from threading import Lock, Thread
lock = Lock()
results = []
def worker(number):
    with lock:
        results.append(number)
threads = [Thread(target=worker, args=(n,)) for n in range(8)]
for t in threads: t.start()
for t in threads: t.join(timeout=1)
assert sorted(results) == list(range(8))
print("Invariant holds")

Walkthrough: What Each Part Does

• The imports make threading available. These are standard-library building blocks unless the example explicitly names an external tool.
• The definition worker creates reusable behavior. Its body runs when called, awaited or instantiated; defining it alone does not run the body of an ordinary function.
• The with or async with scope controls lifetime. Setup takes place on entry, and cleanup runs on exit even when an exception interrupts the body.
• The loop repeats one well-defined unit of work. Check termination, ordering and whether an item may be processed more than once.
• The coordination call waits for a result or a completion condition. Predict what would happen if the worker failed or never became ready.

This demonstration focuses on one practical behavior. Before changing several lines, vary one input or one configuration choice and check whether the result changes for the reason you expected.

Example Output

Invariant holds

The output above was captured by running the example in the available Python environment. The order of concurrent events, durations and platform-dependent values can legitimately differ on your computer.

Important Behavior and Edge Cases

Assuming ten passing stress runs formally prove a shared-state operation has no race.

A deterministic invariant is stronger than a test that assumes a specific scheduling order.

Practice Exercise

Write a test for a shared counter with synchronization and assert its final value.

Write down the result you expect before running your changed code. Check at least one normal case and one boundary or failure case. If your example starts workers or opens resources, verify how they are cleaned up.

Further reading: official documentation and API reference.

Common Beginner Mistakes

• Assuming ten passing stress runs formally prove a shared-state operation has no race.
• Forgetting to handle worker errors and shutdown, even when the normal completion path appears correct.

Key Takeaways

• Concurrent bugs may appear only under certain timing.
• A deterministic invariant is stronger than a test that assumes a specific scheduling order.
• Practice: Write a test for a shared counter with synchronization and assert its final value.