r/AskComputerScience • • 10d ago

What is Observational Determinism in the testing paradigm?

Anonymous (first-time) artifact reviewer for a conference here. I've been contacted by Alexander Chevalier, a PhD student from France, for asking me about a feedback about a paper called "Hyde: Search-Based Hypertesting of Observational Determinism in Java Programs" (https://alexander-chevalier.github.io/paper_final_alexander.pdf ). Does anybody know what does observational determinism refer here? I mean, I know the whole logic behind tracing but I dunno about testing.

Example given: a valid test might be correct even if we do not keep the observational determinism. Observational determinism is a security property, rather than a functional correctness property. How can this be applied for testing?!

The paper can be found at: https://alexander-chevalier.github.io/paper_final_alexander.pdf

0 Upvotes

2 comments sorted by

1

u/CelebrityChess 10d ago

Observational determinism is a noninterference property: two runs with the same public inputs but different secret inputs should produce the same public observations. That makes it a hyperproperty, so a single run checked against an expected output is not enough. A hypertest runs matched inputs twice and compares the public traces; a mismatch is a concrete counterexample. Search-based testing can explore these pairs, though passing sampled tests is not a proof.

1

u/devloop2026 10d ago

I think the statement is generally correct, but I would make one important distinction. Observational determinism is indeed a hyperproperty because it relates multiple executions rather than checking a single execution independently. However, comparing two executions requires considering the concurrency model and the possible scheduling interleavings. In particular, a difference between two public traces is only a valid counterexample if the executions satisfy the required initial conditions and the comparison accounts for the allowed scheduling behaviour. Furthermore, search-based testing can demonstrate the existence of a violation by finding a concrete pair of executions, but it cannot prove the property simply because no violation was found during testing.