Research topics in functional programming
On the equivalence of data representations
Artificial intelligence and mathematical theory of computation
HOPL-II The second ACM SIGPLAN conference on History of programming languages
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
Proving congruence of bisimulation in functional programming languages
Information and Computation
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Principals in programming languages: a syntactic proof technique
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Abstract types have existential types
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Using encryption for authentication in large networks of computers
Communications of the ACM
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modules, abstract types, and distributed versioning
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Protection in programming languages
Communications of the ACM
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A type system for higher-order modules
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Bisimulation Method for Cryptographic Protocols
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
On Bisimulations for the Spi Calculus
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Existential Types: Logical Relations and Operational Equivalence
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Proof Techniques for Cryptographic Processes
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Towards a Theory of Bisimulation for Local Names
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Generativity and dynamic opacity for abstract types
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Global abstraction-safe marshalling with hash types
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Logical relation for encryption
Journal of Computer Security - Special issue on CSFW14
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
Translating dependency into parametricity
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
A bisimulation for type abstraction and recursion
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Small bisimulations for reasoning about higher-order imperative programs
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
Verified interoperable implementations of security protocols
ACM Transactions on Programming Languages and Systems (TOPLAS)
Operational semantics for multi-language programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Theory of Non-monotone Memory (Or: Contexts for free)
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The Higher-Order, Call-by-Value Applied Pi-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Logical bisimulations and functional languages
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Parametric polymorphism through run-time sealing or, theorems for low, low prices!
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
The essence of compiling with traces
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
AuraConf: a unified approach to authorization and confidentiality
Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Sound bisimulations for higher-order distributed process calculus
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
From Applicative to Environmental Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulations for untyped imperative objects
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Gradual typing for first-class classes
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
| Hi-index | 0.00 |
We define λseal, an untyped call-by-value λ-calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with respect to contextual equivalence. This provides a formal basis for reasoning about data abstraction in open, dynamic settings where static techniques such as type abstraction and logical relations are not applicable.