Parametricity and local variables
Journal of the ACM (JACM)
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Denotational semantics using an operationally-based term model
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algebraic methods for specification and formal development of programs
ACM Computing Surveys (CSUR)
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
A fully abstract denotational semantics for the π-calculus
Theoretical Computer Science
Higher-Order and Symbolic Computation
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
Petri nets in cryptographic protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
HOPLA-A Higher-Order Process Language
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Observable Sharing for Functional Circuit Description
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Logical Relations for Monadic Types
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
A fully abstract model for the π-calculus
Information and Computation
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Fully Abstract Domain Model for the p-Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th 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
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A bisimulation for dynamic sealing
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ML with Concurrency by Flemming Nielson (ed.), Springer-Verlag, 1997.
Journal of Functional Programming
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science
Staged computation with names and necessity
Journal of Functional Programming
ACM SIGACT News
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
A bisimulation for dynamic sealing
Theoretical Computer Science
A fibrational framework for possible-world semantics of Algol-like languages
Theoretical Computer Science
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
Imperative self-adjusting computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Free-algebra models for the π -calculus
Theoretical Computer Science
Cryptographic logical relations
Theoretical Computer Science
An Algebra for Directed Bigraphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Interpreting Localized Computational Effects Using Operators of Higher Type
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Pure Pointer Programs with Iteration
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Global State Considered Helpful
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational parametricity for references and recursive types
Proceedings of the 4th international workshop on Types in language design and implementation
Electronic Notes in Theoretical Computer Science (ENTCS)
Logical relations for monadic types†
Mathematical Structures in Computer Science
Monoidal Indeterminates and Categories of Possible Worlds
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic foundations for typed assembly languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ott: Effective tool support for the working semanticist
Journal of Functional Programming
Pure pointer programs with iteration
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Freshness and name-restriction in sets of traces with names
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
Electronic Notes in Theoretical Computer Science (ENTCS)
From Applicative to Environmental Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Object connectivity and full abstraction for a concurrent calculus of classes
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Journal of Functional Programming - Dedicated to ICFP 2009
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Relational reasoning in a nominal semantics for storage
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A generic model for analyzing security protocols
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
Local variable scoping and kleene algebra with tests
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Relational semantics for higher-order programs
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Relational reasoning for recursive types and references
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Block structure vs. scope extrusion: between innocence and omniscience
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Completeness for algebraic theories of local state
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Monoidal indeterminates and categories of possible worlds
Theoretical Computer Science
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
On nominal regular languages with binders
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Capsules and closures: a small-step approach
Logic and Program Semantics
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Names, Equations, Relations: Practical Ways to Reason about new
Fundamenta Informaticae
Electronic Notes in Theoretical Computer Science (ENTCS)
Full abstraction for nominal Scott domains
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Towards nominal context-free model-checking
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Abstract effects and proof-relevant logical relations
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.01 |