Pages that link to "Item:Q4134927"
From MaRDI portal
The following pages link to Certification of programs for secure information flow (Q4134927):
Displaying 48 items.
- Content dependent information flow control (Q511927) (← links)
- The spirit of ghost code (Q518394) (← links)
- A unifying theory of control dependence and its application to arbitrary program structures (Q650921) (← links)
- Fast computation of strong control dependencies (Q832318) (← links)
- Securing interaction between threads and the scheduler in the presence of synchronization (Q843217) (← links)
- Type systems equivalent to data-flow analyses for imperative languages (Q860844) (← links)
- Combining behavioural types with security analysis (Q890614) (← links)
- Formalizing non-interference for a simple bytecode language in Coq (Q931434) (← links)
- Cryptographically-masked flows (Q935463) (← links)
- Dynamic program slicing (Q1110308) (← links)
- A security flow control algorithm and its denotational semantics correctness proof (Q1203126) (← links)
- The enforcement of security policies for computation (Q1248369) (← links)
- Automated enforcement for relaxed information release with reference points (Q1616187) (← links)
- A secrecy-preserving language for distributed and object-oriented systems (Q1648643) (← links)
- Efficient static checker for tainted variable attacks (Q1651020) (← links)
- An alternative characterization of weak order dependence (Q1675759) (← links)
- Controlling file access with types (Q1744439) (← links)
- Abstract interpretation of operational semantics for secure information flow. (Q1853040) (← links)
- Stepwise refinement of heap-manipulating code in Chalice (Q1941869) (← links)
- A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
- Secure information flow connections (Q2141283) (← links)
- Information flow control in software DB units based on formal verification (Q2172738) (← links)
- Safe functional systems through integrity types and verified assembly (Q2220814) (← links)
- System-level non-interference of constant-time cryptography. II: Verified static analysis and stealth memory (Q2228439) (← links)
- Simple and efficient computation of minimal weak control closure (Q2233536) (← links)
- Instruction-level security analysis for information flow in stack-based assembly languages (Q2381502) (← links)
- Survey on JavaScript security policies and their enforcement mechanisms in a web browser (Q2436507) (← links)
- Formal verification of side-channel countermeasures using self-composition (Q2442950) (← links)
- Optimality and condensing of information flow through linear refinement (Q2464935) (← links)
- Type-based information flow analysis for the \(\pi\)-calculus (Q2581011) (← links)
- Information Flow Analysis for Valued-Indexed Data Security Compartments (Q2830034) (← links)
- From Exponential to Polynomial-Time Security Typing via Principal Types (Q3000586) (← links)
- Abstract Certification of Global Non-interference in Rewriting Logic (Q3066121) (← links)
- Non-termination and secure information flow (Q3103612) (← links)
- Secure information flow by self-composition (Q3103613) (← links)
- Efficient Information-Flow Verification Under Speculative Execution (Q3297608) (← links)
- Secure Guarded Commands (Q3297842) (← links)
- Hoare Logic for Disjunctive Information Flow (Q3460862) (← links)
- Providing fine-grained access control for Java programs via binary editing (Q4790905) (← links)
- Combining slicing and constraint solving for validation of measurement software (Q5030203) (← links)
- Can you trust your data (Q5096755) (← links)
- Model-Driven Information Flow Security for Component-Based Systems (Q5170740) (← links)
- Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness (Q5262979) (← links)
- Flexible dynamic information flow control in the presence of exceptions (Q5371997) (← links)
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption (Q5458849) (← links)
- Securing a compiler transformation (Q5916265) (← links)
- Efficient computation of arbitrary control dependencies (Q6165552) (← links)
- Abstract semantic dependency (Q6536297) (← links)