Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Ramanujam, R. - Institute of Mathematical Sciences, Chennai, India
Trace consistency and inevitability R. Ramanujam 1
Viewbased explicit knowledge R. Ramanujam
Decidability of contextexplicit security protocols R. Ramanujam
Locally linear time temporal logic R. Ramanujam
Tagging Makes Secrecy Decidable With Unbounded Nonces As Well ?
Rules for trace consistent reasoning R. Ramanujam
Lecture Notes on Modal Logic in Computer Science
A Local Presentation of Synchronizing R. Ramanujam
Reasoning about layered message passing systems B. Meenakshi and R. Ramanujam
Distributed automata in an Assumption -Commitment framework ?
Knowledge and the ordering of events in distributed systems Extended Abstract
Undecidability of the secrecy problem for security R. Ramanujam and S. P. Suresh
A (restricted) quantifier elimination for security R. Ramanujam
An equivalence on terms for security protocols R. Ramanujam and S. P. Suresh
Axioms for composite strategies R. Ramanujam and Sunil Simon
AssumptionCommitment in Automata Swarup Mohalik and R. Ramanujam
Knowledge-based modelling of voting protocols Chennai Mathematical Institute
R. RAMANUJAM A discussion on explicit knowledge
A Presentation of Regular Languages in the AssumptionCommitment Framework
Local knowledge assertions in a changing world (Extended abstract)
Knowledge based Semantics Messages Rohit Parikh
Deciding knowledge properties of security protocols R. Ramanujam # S. P. Suresh +
A decidable subclass of unbounded security R. Ramanujam and S. P. Suresh
