247 results on '"Andre Scedrov"'
Search Results
2. Explorations in Subexponential Non-associative Non-commutative Linear Logic.
3. On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems.
4. Non-associative, Non-commutative Multi-modal Linear Logic.
5. On the Complexity of Verification of Time-Sensitive Distributed Systems.
6. On Security Analysis of Periodic Systems: Expressiveness and Complexity.
7. Soft Subexponentials and Multiplexing.
8. A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols.
9. L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit.
10. The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later.
11. Undecidability of a Newly Proposed Calculus for CatLog3.
12. Resource-Bounded Intruders in Denial of Service Attacks.
13. A Logical Framework with Commutative and Non-commutative Subexponentials.
14. Bracket Induction for Lambek Calculus with Bracket Modalities.
15. Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols.
16. Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities.
17. A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order.
18. On Lambek's Restriction in the Presence of Exponential Modalities.
19. Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems.
20. Undecidability of the Lambek Calculus with a Relevant Modality.
21. Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols.
22. Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds.
23. When Not All Bits Are Equal: Worth-Based Information Flow.
24. A reduction-based approach towards scaling up formal analysis of internet configurations.
25. Automated Analysis of Cryptographic Assumptions in Generic Group Models.
26. Automated synthesis of reactive controllers for software-defined networks.
27. Bounded Memory Protocols and Progressing Collaborative Systems.
28. Towards an automated assistant for clinical investigations.
29. Declarative privacy policy: finite models and attribute-based encryption.
30. A Rewriting Framework for Activities Subject to Regulations.
31. Reduction-Based Formal Analysis of BGP Instances.
32. Maintaining distributed logic programs incrementally.
33. Analyzing BGP Instances in Maude.
34. Bounded Memory Dolev-Yao Adversaries in Collaborative Systems.
35. An Operational Semantics for Network Datalog.
36. Policy Compliance in Collaborative Systems.
37. Analysis of EAP-GPSK Authentication Protocol.
38. Computationally sound mechanized proofs for basic and public-key Kerberos.
39. The work of Dean Rosenzweig: a tribute to a scientist and an innovator.
40. Collaborative Planning With Privacy.
41. Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles.
42. Breaking and Fixing Public-Key Kerberos.
43. Games and the Impossibility of Realizable Ideal Functionality.
44. Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos.
45. Computational and Information-Theoretic Soundness and Completeness of Formal Encryption.
46. Soundness of Formal Encryption in the Presence of Key-Cycles.
47. Specifying Kerberos 5 cross-realm authentication.
48. Resource and timing aspects of security protocols
49. Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols.
50. Verifying Confidentiality and Authentication in Kerberos 5.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.