Declassification policy for program complexity analysis
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 445159 (Why is no real title available?)
- scientific article; zbMATH DE number 65741 (Why is no real title available?)
- scientific article; zbMATH DE number 7724208 (Why is no real title available?)
- A new Characterization of Type-2 Feasibility
- A new recursion-theoretic characterization of the polytime functions
- A tier-based typed programming language characterizing Feasible Functionals
- A type-based complexity analysis of object oriented programs
- Adventures in time and space
- An implicit characterization of the polynomial-time decidable sets by cons-free rewriting
- Arithmetical hierarchy and complexity of computation
- Complete and tractable machine-independent characterizations of second-order polytime
- Downgrading policies and relaxed noninterference
- Functional interpretations of feasibly constructive arithmetic
- Levels of undecidability in rewriting
- On basic feasible functionals and the interpretation method
- On characterizations of the basic feasible functionals. I
- Subclasses of \textsc{Ptime} interpreted by programming languages
- The expressive power of higher-order types or, life without CONS
- Theory of higher order interpretations and application to basic feasible functions
- Type-Based Complexity Analysis for Fork Processes
- Type-two polynomial-time and restricted lookahead
- Verifying secrets and relative secrecy
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
This page was built for publication: Declassification policy for program complexity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970235)
