The following pages link to Andrzej S. Murawski (Q388210):
Displaying 26 items.
- Full abstraction for Reduced ML (Q388212) (← links)
- Functions with local state: regularity and undecidability (Q557802) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
- Three tokens in Herman's algorithm (Q1941880) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- Complete trace models of state and control (Q2233464) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- Higher-order linearisability (Q2423744) (← links)
- Third-order Idealized Algol with iteration is decidable (Q2474055) (← links)
- Angelic semantics of fine-grained concurrency (Q2474441) (← links)
- Games for complexity of second-order call-by-name programs (Q2570133) (← links)
- Contextual Approximation and Higher-Order Procedures (Q2811338) (← links)
- On the Complexity of the Equivalence Problem for Probabilistic Automata (Q2892790) (← links)
- Reachability in Pushdown Register Automata (Q2922039) (← links)
- Böhm trees as higher-order recursion schemes (Q2963900) (← links)
- Block structure vs scope extrusion: between innocence and omniscience (Q2974774) (← links)
- Algorithmic Nominal Game Semantics (Q3000592) (← links)
- On Stabilization in Herman’s Algorithm (Q3012941) (← links)
- Algorithmic Games for Full Ground References (Q3167021) (← links)
- Full Abstraction Without Synchronization Primitives (Q3178268) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
- (Q5089308) (← links)
- (Q5092412) (← links)
- (Q5111648) (← links)
- Asymmetric Distances for Approximate Differential Privacy (Q5875371) (← links)
