All Stories

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