3 papers
cs.LO2024★ 1 cited
A proof theory of (omega-)context-free languages, via non-wellfounded proofs
Anupam Das, Abhishek De
We investigate the proof theory of regular expressions with fixed points, construed as a notation for (omega-)context-free grammars. Starting with a hypersequential system for regu…
cs.LO2024★ 2 cited
A proof theory of right-linear (omega-)grammars via cyclic proofs
Anupam Das, Abhishek De
Right-linear (or left-linear) grammars are a well-known class of context-free grammars computing just the regular languages. They may naturally be written as expressions with (leas…
cs.CR2014
Defending Tor from Network Adversaries: A Case Study of Network Path Prediction
Joshua Juen, Aaron Johnson, Anupam Das +2
The Tor anonymity network has been shown vulnerable to traffic analysis attacks by autonomous systems and Internet exchanges, which can observe different overlay hops belonging to…