Alan Jeffrey

Proceedings of the 7th Workshop on Programming languages meets program verification, 2013

Dependently Typed Web Client Applications - FRP in Agda in HTML5.

[BibT_eX]

[DOI]

Proceedings of the Practical Aspects of Declarative Languages, 2013

Validation and Interactivity of Web API Documentation.

[BibT_eX]

[DOI]

Peter J. Danielsen

Proceedings of the 2013 IEEE 20th International Conference on Web Services, Santa Clara, CA, USA, June 28, 2013

Functional reactive programming with liveness guarantees.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012

LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs.

[BibT_eX]

[DOI]

Proceedings of the sixth workshop on Programming Languages meets Program Verification, 2012

2011

Robin Milner 1934--2010: verification, languages, and concurrency.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Integrity Constraints for Linked Data.

[BibT_eX]

[DOI]

Peter F. Patel-Schneider

Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

The Lax Braided Structure of Streaming I/O.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2011

2009

Model Checking Firewall Policy Configurations.

[BibT_eX]

[DOI]

Taghrid Samak

Proceedings of the POLICY 2009, 2009

Towards a Theory of Accountability and Audit.

[BibT_eX]

[DOI]

Proceedings of the Computer Security, 2009

2008

Full abstraction for polymorphic pi-calculus.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Lambda-RBAC: Programming with Role-Based Access Control.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Stream firewalling of xml constraints.

[BibT_eX]

[DOI]

Michael Benedikt

Ruy Ley-Wild

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

2007

Efficient and Expressive Tree Filters.

[BibT_eX]

[DOI]

Michael Benedikt

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Typed parametric polymorphism for aspects.

[BibT_eX]

[DOI]

Radha Jagadeesan

James Riely

Sci. Comput. Program., 2006

Pattern-matching spi-calculus.

[BibT_eX]

[DOI]

Christian Haack

Inf. Comput., 2006

lambda-RBAC: Programming with Role-Based Access Control.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

A fully abstract may testing semantics for concurrent objects.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Contextual equivalence for higher-order pi-calculus revisited.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2005

Java Jr: Fully Abstract Trace Semantics for a Core Java Language.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2005

Timed Spi-Calculus with Types for Secrecy and Authenticity.

[BibT_eX]

[DOI]

Christian Haack

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

A theory of bisimulation for a fragment of concurrent ML with local names.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Types and effects for asymmetric cryptographic protocols.

[BibT_eX]

[DOI]

J. Comput. Secur., 2004

µABC: A Minimal Aspect Calculus.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003

Authenticity by Typing for Security Protocols.

[BibT_eX]

[DOI]

J. Comput. Secur., 2003

Contextual Equivalence for Higher-Order π-Calculus Revisited.

[BibT_eX]

[DOI]

Proceedings of 19th Conference on the Mathematical Foundations of Programming Semantics, 2003

A Calculus of Untyped Aspect-Oriented Programs.

[BibT_eX]

[DOI]

Radha Jagadeesan

James Riely

Proceedings of the ECOOP 2003, 2003

2002

Typing One-to-One and One-to-Many Correspondences in Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the Software Security -- Theories and Systems, 2002

2001

Typing Correspondence Assertions for Communication Protocols.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Conference on the Mathematical Foundations of Programming Semantics, 2001

SafetyNet: A language-based approach to programmable networks.

[BibT_eX]

[DOI]

Comput. Networks, 2001

A Type and Effect Analysis of Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 8th International Symposium, 2001

A Symbolic Labelled Transition System for Coinductive Subtyping of Fµ< Types.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000

Preface.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Higher Order Operational Techniques in Semantics, 2000

Combining the typed lambda-calculus with CCS.

[BibT_eX]

William Ferreira

Matthew Hennessy

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

A Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

A Categorical and Graphical Treatment of Closure Conversion.

[BibT_eX]

[DOI]

Ralf Schweimeier

Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

Towards a Theory of Bisimulation for Local Names.

[BibT_eX]

[DOI]

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

A Theory of Weak Bisimulation for Core CML.

[BibT_eX]

[DOI]

William Ferreira

Matthew Hennessy

J. Funct. Program., 1998

1997

Premonoidal categories and flow graphs.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Higher-Order Operational Techniques in Semantics, 1997

1995

A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours.

[BibT_eX]

[DOI]

Luca Aceto

Theor. Comput. Sci., 1995

A fully abstract semantics for a nondeterministic functional language with monadic types.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1995

Handbook of mathematical formulas and integrals.

[BibT_eX]

Academic Press, ISBN: 978-0-12-382580-3, 1995

1994

A Fully Abstract Semantics for Concurrent Graph Reduction

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Allegories of Circuits.

[BibT_eX]

[DOI]

Carolyn Brown

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993

A Chemical Abstract Machine for Graph Reduction.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992

Translating Timed Process Algebra into Prioritized Process Algebra.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1992

1991

Abstract Timed Observation and Process Algebra.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '91, 1991

A Linear Time Process Algebra.

[BibT_eX]

[DOI]