Riccardo Pucella

Online Research Publications

Publications listed in roughly reverse chronological order of first publication.

• Practical affine types. (with J. A. Tov). In 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'11), 2011.
• Dealing with Logical Omniscience: Expressiveness and Pragmatics. (with J. Halpern). Artificial Intelligence 175 (1), pp. 220-235, 2011.
• Stateful Contracts for Affine Types. (with J. A. Tov). In 19th European Symposium on Programming (ESOP'10), 2010.
• Independence from Obfuscation: A Semantic Framework for Diversity. (with F. B. Schneider). Journal of Computer Security 18 (5), pp. 701-749, 2010.
• Roles, Stacks, Histories: A Triple for Hoare. (with A. D. Gordon and J. Borgstroem). To appear in Festschrift in Honour of C. A. Hoare, F.R.S. on the Occasion of His 85th Birthday.
• Future Contracts. (with C. Dimoulas and M. Felleisen). In 11th International ACM SIGPLAN Symp. on Principles and Practice of Declarative Programming (PPDP'09), 2009.
• Categories of Timed Stochastic Relations. (with D. Brown). In 25th Conf. on the Mathematical Foundations of Programming Semantics (MFPS'09), 2009.
• Evidence with Uncertain Likelihoods. (with J. Halpern). Synthese 171 (1), pp. 111-133, 2009.
• A Runs-and-Systems Semantics for Logics of Announcements. (with M. Sadrzadeh). In 8th Conf. on Logic and the Foundations of Games and Decision Theory (LOFT'08), July 2008.
• Haskell Session Types with (Almost) no Class. (with J. Tov). In 1st SIGPLAN Symp. on Haskell (HASKELL'08), pp. 25-36, 2008.
• Perfect Cryptography, S5 Knowledge, and Algorithmic Knowledge. (with S. Petride). In 11th Conf. on Theoretical Aspects of Rationality and Knowledge (TARK'07), June 2007.
• Characterizing and Reasoning about Probabilistic and Non-Probabilistic Expectation (with J. Y. Halpern). Journal of the ACM 54 (3), 2007.
• Deductive Algorithmic Knowledge. Journal of Logic and Computation 16 (2), pp. 287-309, 2006.
• A Logic for Reasoning about Evidence (with J. Y. Halpern). Journal of Artificial Intelligence Research 26, pp. 1-34, 2006.
• Phantom Types and Subtyping (with M. Fluet). Journal of Functional Programming 16 (6), pp. 751-791, 2006.
• Probabilistic Algorithmic Knowledge (with J. Y. Halpern). Logical Methods in Computer Science 1 (3:1), 2005.
• Practical Datatype Specializations with Phantom Types and Recursion Schemes (with M. Fluet). In 2005 ACM SIGPLAN Workshop on ML, September 2005.
• Validating a Web Service Security Abstraction by Typing (with A. D. Gordon). Formal Aspects of Computing 17 (3), pp. 277-318, 2005.
• On Partially Additive Kleene Algebras. Full version of paper in 8th Int. Conf. on Relational Methods in Computer Science (RelMiCS 8), February 2005.
• TulaFale: A Security Tool for Web Services (with K. Bhargavan, C. Fournet, and A. D. Gordon). In 2nd Int. Symp. on Formal Methods for Components and Objects (FMCO'03), November 2003.
• A Formal Foundation for ODRL (with V. Weissman). Full version of paper in Workshop on Issues in the Theory of Security (WITS'04), April 2004.
• Reasoning about Dynamic Policies (with V. Weissman). In 7th Int. Conf. on Foundations of Software Science and Computation Structures (FOSSACS'04), April 2004.
• A Coalgebraic Approach to Kleene Algebra with Tests (with H. Chen). Theoretical Computer Science 327 (1-2), pp. 23-44, 2004.
• On Equivalences for a Class of Timed Regular Expressions. In 7th Int. Workshop on Coalgebraic Methods in Computer Science (CMCS'04), March 2004.
• A Framework for Creating Natural Language User Interfaces for Action-Based Applications (with S. Chong). Full version of paper in 3rd Int. AMAST Workshop on Algebraic Methods in Language Processing (AMiLP-3), August 2003.
• Modeling Adversaries in a Logic for Security Protocol Analysis (with J. Y. Halpern). Full version of paper in Workshop on Formal Aspects of Security (FASec'02), December 2002.
• Towards a Formalization for COM, Part I: The Primitive Calculus. In 17th ACM Conf. on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'02), November 2002.
• A Logic for Reasoning about Digital Rights (with V. Weissman). In 15th IEEE Computer Security Foundations Workshop (CSFW'02), June 2002.
• A Framework for Interoperability (with K. Fisher and J. Reppy). In 1st Int. Workshop on Multi-Language Infrastructure and Interoperability (BABEL'01), September 2001.
• A Logic for Reasoning about Upper Probabilities (with J. Y. Halpern). Journal of Artificial Intelligence Research 17, pp. 57-81, 2002.
• On the Relationship between Strand Spaces and Multi-Agent Systems (with J. Y. Halpern). ACM Transactions on Information and System Security 6 (1), pp.43-70, 2003.
• On the Expressive Power of First-Order Boolean Functions in PCF (with P. Panangaden). Theoretical Computer Science 266 (1-2), pp. 543-567, 2001.
• An Approach to the Implementation of Overlapping Rules in Standard ML. In 1st Int. Workshop on Rule-Based Programming (RULE'00), September 2000.
• The Design of a COM-Oriented Module System. In Joint Modular Languages Conf. (JMLC'00), September 2000.
• Higher-Order Concurrent Win32 Programming. In 3rd Usenix Windows NT Symp., July 1999.
• Aspects de la Programmation d'Applications Win32 avec un Langage Fonctionnel (with E. Meijer and D. Oliva). In Journées Francophones des Langages Applicatifs (JFLA'99), February 1999.
• Reactive Programming in Standard ML. In IEEE Int. Conf. on Computer Languages (ICCL'98), May 1998.
• An Analysis of Lambek's Production Machines. RAIRO Informatique Théorique et Applications 31 (5), pp. 483-497, 1997.

Other Writing

• Review of Foundations of Cryptography II: Basic Applications July 2005.
• Categories for Imperative Semantics Lecture Notes for PLDG Seminar, September 2004.
• Reasoning about Resource-Bounded Knowledge: Theory and Application to Security Protocol Analysis Ph.D. Thesis, Cornell University, August 2004.
• Review of Logic for Computer Scientists SIGACT News 36 (3), September 2005.
• Review of Foundations of Cryptography: Basic Tools and Modelling and Analysis of Security Protocols SIGACT News 34 (4), December 2003.
• Review of The Pi-Calculus: A Theory of Mobile Processes SIGACT News 34 (1), March 2003.
• Review of Type-Logical Semantics (with S. Chong) SIGACT News 34 (1), March 2003.
• Review of Dynamic Logic SIGACT News 32 (4), December 2001.
• Review of Control Flow Semantics SIGACT News 32 (3), September 2001.
• Review of Proof, Language, and Interaction SIGACT News 32 (1), March 2001.
• Notes on Programming Standard ML of New Jersey January 2001.
• Review of Communicating and Mobile System: the Pi-calculus SIGACT News 31 (4), December 2000.
• Investigations on Relative Definability in PCF M.Sc. Thesis, McGill University, August 1996.
• Locally-Adaptive Grid Generation Using Quadtrees (with C. Verbrugge and P. Panangaden) Technical Report SOCS 95.3, McGill University, June 1995.

Copyright Statement

The documents contained in this list are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are retained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. Unless explicitly noted to the contrary, these works may not be reposted without the explicit permission of the copyright holder.