All Stories

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