All Stories

  1. Dynamic Race Detection with O(1) Samples
  2. State Space Estimation for DPOR-Based Model Checkers
  3. Anvil: A General-Purpose Timing-Safe Hardware Description Language
  4. Counting and Sampling Traces in Regular Languages
  5. The Complexity of Testing Message-Passing Concurrency
  6. Efficient Decrease-and-Conquer Linearizability Monitoring
  7. Efficient Timestamping for Sampling-Based Race Detection
  8. Program Skeletons for Automated Program Translation
  9. Selectively Uniform Concurrency Testing
  10. The Decision Problem for Regular First Order Theories
  11. Fully Polynomial Time Randomized Approximation Scheme for Counting the number of words of an NFA
  12. Concurrent Program Testing for Everyone via "Fuzzing"
  13. Optimistic Prediction of Synchronization-Reversal Data Races
  14. Rooting for Efficiency: Mechanised Reasoning about Array-Based Trees in Separation Logic
  15. Predictive Monitoring against Pattern Regular Languages
  16. Coarser Equivalences for Causal Concurrency
  17. How Hard Is Weak-Memory Testing?
  18. Optimal Reads-From Consistency Checking for C11-Style Memory Models
  19. Sound Dynamic Deadlock Prediction in Linear Time
  20. Dynamic Race Detection with O(1) Samples
  21. Dynamic data race prediction: fundamentals, theory, and practice (tutorial)
  22. A tree clock data structure for causal orderings in concurrent executions