9 citations · 17 across the 9 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2017
A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks
Jasine Babu, K. Murali Krishnan, Vineeth Paleri
The problem of determining Herbrand equivalence of terms at each program point in a data flow framework is a central and well studied question in program analysis. Most of the well…
cs.LO2008★ 8 cited
Lower Bound for the Communication Complexity of the Russian Cards Problem
Aiswarya Cyriac, K. Murali Krishnan
In this paper it is shown that no public announcement scheme that can be modeled in Dynamic Epistemic Logic (DEL) can solve the Russian Cards Problem (RCP) in one announcement. Sin…