All Stories

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