Theoretical Computer Science
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Secure information flow in a multi-threaded imperative language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Game-theoretic analysis of call-by-value computation
Theoretical Computer Science
The name discipline of uniform receptiveness
Theoretical Computer Science
Secrecy by typing in security protocols
Journal of the ACM (JACM)
Certification of programs for secure information flow
Communications of the ACM
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
A uniform type structure for secure information flow
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
A Per Model of Secure Information Flow in Sequential Programs
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ECOOP '94 Proceedings of the 8th European Conference on Object-Oriented Programming
Non Interference for the Analysis of Cryptographic Protocols
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Information Flow vs. Resource Access in the Asynchronous Pi-Calculus
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Confluence in the pi-Calculus
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Types and Subtypes for Client-Server Interactions
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Noninterference for Concurrent Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A Simple View of Type-Secure Information Flow in the "-Calculus
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Statically assuring secrecy for dynamic concurrent processes
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Communications of the ACM - Service-oriented computing
Channel dependent types for higher-order mobile processes
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From process logic to program logic
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Strong normalisation in the π-calculus
Information and Computation
Noninterference through flow analysis
Journal of Functional Programming
P-congruences as non-interference for the pi-calculus
Proceedings of the fourth ACM workshop on Formal methods in security
Behavioural Types for Service Integration: Achievements and Challenges
Electronic Notes in Theoretical Computer Science (ENTCS)
A uniform type structure for secure information flow
ACM Transactions on Programming Languages and Systems (TOPLAS)
State-oriented Noninterference for CCS
Electronic Notes in Theoretical Computer Science (ENTCS)
The Calculus of Handshake Configurations
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
A theory of noninterference for the π-calculus
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Bridging language-based and process calculi security
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We introduce a theory of weak bisimilarity for the À-calculus with linear type structure [35] in which we abstract away not only Ä - actions but also non-Ä actions which do not affect well-typed environments. This gives an equivalence far larger than the standard bisimilarity while retaining semantic soundness. The congruency of the bisimilarity relies on a liveness property at linear channels ensured by typing. The theory is consistently extendible to settings which involve nontermination, nondeterminism and state. As an application we develop a behavioural theory of secrecy for the À-calculus which ensures secure information flow for a strictly greater set of processes than the type-based approach in [20][23].