The following pages link to S. Purushothaman Iyer (Q1126265):
Displaying 10 items.
- An operational semantics of sharing in lazy evaluation (Q1126266) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Simulating perfect channels with probabilistic lossy channels (Q1776399) (← links)
- SAT-solving the coverability problem for Petri nets (Q1878911) (← links)
- Unreliable channels are easier to verify than perfect channels (Q1908353) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- (Q2754109) (← links)
- (Q4422084) (← links)
- A NEW TYPE OF PUSHDOWN AUTOMATA ON INFINITE TREES (Q4853336) (← links)
- FM 2005: Formal Methods (Q5716887) (← links)
