A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract)
No abstract available.
Related papers
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic ESOP 2016
- A theory of higher-order subtyping with type intervals ICFP 2021
- Higher-order bialgebraic semantics JFP 2026
- Partial type constructors in practice Haskell 2022
- Extended Natural Semantics JFP 1993
- Modular, higher order cardinality analysis in theory and practice JFP 2017
- Probabilistic relational verification for cryptographic implementations POPL 2014
- Augmenting Model-Based Instantiation with Fast Enumeration TACAS 2025