The following pages link to CONCUR 2005 – Concurrency Theory (Q5897481):
Displaying 12 items.
- Program verification using symbolic game semantics (Q477213) (← links)
- Quantum Markov chains: description of hybrid systems, decidability of equivalence, and model checking linear-time properties (Q498408) (← links)
- Verifying annotated program families using symbolic game semantics (Q1680558) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- Three tokens in Herman's algorithm (Q1941880) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Refinement algebra for probabilistic programs (Q2268474) (← links)
- (Q3384159) (← links)
- Universal Equivalence and Majority of Probabilistic Programs over Finite Fields (Q5056363) (← links)
- (Q5129945) (← links)
- Approximate Counting in SMT and Value Estimation for Probabilistic Programs (Q5194954) (← links)
- Program equivalence in a typed probabilistic call-by-need functional language (Q6052951) (← links)
