Automatic binding time analysis for a typed &lgr;-calculus
Science of Computer Programming
Notions of computation and monads
Information and Computation
The type and effect discipline
Information and Computation
A type system equivalent to flow analysis
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Analysis and caching of dependencies
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Region-based memory management
Information and Computation
The SLam calculus: programming with secrecy and integrity
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A sound type system for secure flow analysis
Journal of Computer Security
Principles of Program Analysis
Principles of Program Analysis
Proceedings of the Second International Symposium on Static Analysis
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Polymorphic Binding-Time Analysis
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
A Type-Based Approach to Program Security
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Polymorphic Subtyping for Effect Analysis: The Static Semantics
Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Binding-Time Analysis for Both Static and Dynamic Expressions
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Control-Flow Analysis and Type Systems
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Region Analysis and the Polymorphic Lambda Calculus
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Journal of Functional Programming
Polymorphic specialization for ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Dependency has been identified as the main ingredient underlying many program analyses, in particular flow analysis, secrecy and integrity analysis and binding-time analysis. Driven by that insight, Abadi, Banerjee, Heintze, and Riecke [1] have defined a dependency core calculus (DCC). DCC serves as a common target language for defining the above analyses by translation to DCC.The present work considers the opposite direction. We define a Prototype Dependency Calculus (PDC) and define flow analysis, secrecy analysis and region analysis by translation from PDC.