Eike Ritter - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2018

A Protocol for Preventing Insider Attacks in Untrusted Infrastructure-as-a-Service CloudsImran Khan, Zahid Anwar, Behzad Bordbar, Eike Ritter, Habib-ur Rehman. tcc, 6(4):942-954, 2018. [doi]

2017

2016

Fibrational Modal Type TheoryValeria de Paiva, Eike Ritter. ENTCS, 323:143-161, 2016. [doi]

2014

2013

Model Checking Agent Knowledge in Dynamic Access Control PoliciesMasoud Koleini, Eike Ritter, Mark Ryan. TACAS 2013: 448-462 [doi]

2012

2011

StatVerif: Verification of Stateful ProcessesMyrto Arapinis, Eike Ritter, Mark Dermot Ryan. csfw 2011: 33-47 [doi]

True Trustworthy Elections: Remote Electronic Voting Using Trusted ComputingMatt Smart, Eike Ritter. ATC 2011: 187-202 [doi]

2010

Analysing Unlinkability and Anonymity Using the Applied Pi CalculusMyrto Arapinis, Tom Chothia, Eike Ritter, Mark Ryan. csfw 2010: 107-121 [doi]

An Authentication Framework for Wireless Sensor Networks using Identity-Based SignaturesRehana Yasmin, Eike Ritter, Guilin Wang. IEEEcit 2010: 882-889 [doi]

2009

2005

Relating Categorical Semantics for Intuitionistic Linear LogicMaria Emilia Maietti, Paola Maneggia, Valeria de Paiva, Eike Ritter. acs, 13(1):1-36, 2005. [doi]

Analysis of a Multi-party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space ModelAybek Mukhamedov, Steve Kremer, Eike Ritter. fc 2005: 255-269 [doi]

A games semantics for reductive logic and proof-searchDavid J. Pym, Eike Ritter. galop 2005: 107-123

2004

Reductive logic and proof-search - proof theory, semantics, and controlDavid J. Pym, Eike Ritter. Volume 45 of Oxford logic guides, Oxford University Press, 2004.

2001

Categorical and Kripke Semantics for Constructive S4 Modal LogicNatasha Alechina, Michael Mendler, Valeria de Paiva, Eike Ritter. csl 2001: 292-307 [doi]

2000

Linear Explicit SubstitutionsNeil Ghani, Valeria de Paiva, Eike Ritter. igpl, 8(1):7-31, 2000. [doi]

Categorical Models for Intuitionistic and Linear Type TheoryMaria Emilia Maietti, Valeria de Paiva, Eike Ritter. fossacs 2000: 223-237 [doi]

On the intuitionistic force of classical searchEike Ritter, David J. Pym, Lincoln A. Wallen. TCS, 232(1-2):299-333, 2000. [doi]

Proof-terms for classical and intuitionistic resolutionEike Ritter, David J. Pym, Lincoln A. Wallen. logcom, 10(2):173-207, 2000.

1999

Categorical Models of Explicit SubstitutionsNeil Ghani, Valeria de Paiva, Eike Ritter. fossacs 1999: 197-211

Characterising Explicit Substitutions which Preserve TerminationEike Ritter. tlca 1999: 325-339 [doi]

1998

Explicit Substitutions for Constructive NecessityNeil Ghani, Valeria de Paiva, Eike Ritter. icalp 1998: 743-754 [doi]

1997

On Explicit Substitution and Names (Extended Abstract)Eike Ritter, Valeria de Paiva. icalp 1997: 248-258

1996

On the Intuitionistic Force of Classical Search (Extended Abstract)Eike Ritter, David J. Pym, Lincoln A. Wallen. tableaux 1996: 295-311

Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract)Eike Ritter, David J. Pym, Lincoln A. Wallen. cade 1996: 17-31

1995

A Fully Abstract Translation between a Lambda-Calculus with Reference Types and Standard MLEike Ritter, Andrew M. Pitts. tlca 1995: 397-413

1994

Categorical Abstract Machines for Higher-Order Typed lambda-CalculiEike Ritter. TCS, 136(1):125-162, 1994.

1993

Rewriting Properties of Combinators for Rudimentary Linear LogicMonica Nesi, Valeria de Paiva, Eike Ritter. hoa 1994: 256-275

A Generic Strong Normalization Argument: Application to the Calculus of ConstructionsC.-H. Luke Ong, Eike Ritter. csl 1994: 261-279

Normalization for Typed Lambda Calculi with Explicit SubstitutionEike Ritter. csl 1994: 295-304

Sign in or sign up to see more results.

runs on WebDSL