Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Iliano Cervesato
2010 – today
- 2013
[b1]Iliano Cervesato: The Deductive Spreadsheet. Cognitive Technologies, Springer 2013, ISBN 978-3-642-37746-4, pp. 1-374
[c37]Edmund S. L. Lam, Iliano Cervesato: Decentralized execution of constraint handling rules for ensembles. PPDP 2013: 205-216
[i4]Iliano Cervesato, Jorge Luis Sacchini: Towards Meta-Reasoning in the Concurrent Logical Framework CLF. CoRR abs/1307.7440 (2013)- 2012
[j22]Iliano Cervesato: An Improved Proof-Theoretic Compilation of Logic Programs. TPLP 12(4-5): 639-657 (2012)
[c36]Edmund Soon Lee Lam, Iliano Cervesato: Modeling datalog fact assertion and retraction in linear logic. PPDP 2012: 67-78
[c35]Yuxin Deng, Iliano Cervesato, Robert J. Simmons: Relating Reasoning Methodologies in Linear Logic and Process Algebra. LINEARITY 2012: 50-60
[i3]Iliano Cervesato: An Improved Proof-Theoretic Compilation of Logic Programs. CoRR abs/1210.1653 (2012)- 2011
[j21]Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically sound security proofs for basic and public-key Kerberos. Int. J. Inf. Sec. 10(2): 107-134 (2011)
[c34]
[c33]Andreas Karatsolis, Iliano Cervesato, Khaled A. Harras, Yonina Cooper, Kemal Oflazer, Nael B. Abu-Ghazaleh, Thierry Sans: Getting CS undergraduates to communicate effectively. ITiCSE 2011: 283-287
2000 – 2009
- 2009
[j20]Iliano Cervesato, Andre Scedrov: Relating state-based and process-based concurrency through linear logic (full-version). Inf. Comput. 207(10): 1044-1077 (2009)- 2008
[j19]Kevin Watkins, Iliano Cervesato, Frank Pfenning, David Walker: Specifying Properties of Concurrent Computations in CLF. Electr. Notes Theor. Comput. Sci. 199: 67-87 (2008)
[j18]Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and fixing public-key Kerberos. Inf. Comput. 206(2-4): 402-424 (2008)
[e2]Iliano Cervesato, Helmut Veith, Andrei Voronkov (Eds.): Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings. Lecture Notes in Computer Science 5330, Springer 2008, ISBN 978-3-540-89438-4- 2007
[j17]
[j16]Iliano Cervesato, Mark-Oliver Stehr: Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types. Higher-Order and Symbolic Computation 20(1-2): 3-35 (2007)
[j15]Iliano Cervesato, Catherine Meadows: One Picture Is Worth a Dozen Connectives: A Fault-Tree Representation of NPATRL Security Requirements. IEEE Trans. Dependable Sec. Comput. 4(3): 216-227 (2007)
[e1]Iliano Cervesato (Ed.): Advances in Computer Science - ASIAN 2007. Computer and Network Security, 12th Asian Computing Science Conference, Doha, Qatar, December 9-11, 2007, Proceedings. Lecture Notes in Computer Science 4846, Springer 2007, ISBN 978-3-540-76927-9- 2006
[j14]Iliano Cervesato, Andre Scedrov: Relating State-Based and Process-Based Concurrency through Linear Logic. Electr. Notes Theor. Comput. Sci. 165: 145-176 (2006)
[j13]Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Formal analysis of Kerberos 5. Theor. Comput. Sci. 367(1-2): 57-87 (2006)
[c32]Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. ASIAN 2006: 167-181
[c31]Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. ESORICS 2006: 362-383
[p1]Iliano Cervesato: Towards a Notion of Quantitative Security Analysis. Quality of Protection 2006: 131-143
[i2]Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad: Breaking and Fixing Public-Key Kerberos. IACR Cryptology ePrint Archive 2006: 9 (2006)
[i1]Michael Backes, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay: Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos. IACR Cryptology ePrint Archive 2006: 219 (2006)- 2005
[j12]Iliano Cervesato, Mark-Oliver Stehr: Representing the MSR Cryptoprotocol Specification Language in an Extension of Rewriting Logic with Dependent Types. Electr. Notes Theor. Comput. Sci. 117: 183-207 (2005)
[j11]Serge Autexier, Iliano Cervesato, Heiko Mantel: Preface to the special issue of selected papers from FCS/VERIFY 2002. Int. J. Inf. Sec. 4(1-2): 1 (2005)
[j10]Stefano Bistarelli, Iliano Cervesato, Gabriele Lenzini, Fabio Martinelli: Relating multiset rewriting and process algebras for security protocol analysis. Journal of Computer Security 13(1): 3-47 (2005)
[j9]Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln: A comparison between strand spaces and multiset rewriting for security protocol analysis. Journal of Computer Security 13(2): 265-316 (2005)
[c30]Iliano Cervesato, Catherine Meadows, Dusko Pavlovic: An Encapsulated Authentication Logic for Reasoning about Key Distribution Protocols. CSFW 2005: 48-61
[c29]Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Christopher Walstad: Specifying Kerberos 5 cross-realm authentication. WITS 2005: 12-26- 2004
[j8]Catherine Meadows, Paul F. Syverson, Iliano Cervesato: Formal specification and analysis of the Group Domain Of Interpretation Protocol using NPATRL and the NRL Protocol Analyzer. Journal of Computer Security 12(6): 893-931 (2004)- 2003
[j7]
[c28]Stefano Bistarelli, Iliano Cervesato, Gabriele Lenzini, Roberto Marangoni, Fabio Martinelli: On Representing Biological Systems through Multiset Rewriting. EUROCAST 2003: 415-426
[c27]Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: Verifying Confidentiality and Authentication in Kerberos 5. ISSS 2003: 1-24
[c26]Stefano Bistarelli, Iliano Cervesato, Gabriele Lenzini, Fabio Martinelli: Relating Process Algebras and Multiset Rewriting for Immediate Decryption Protocols. MMM-ACNS 2003: 86-99
[c25]Kevin Watkins, Iliano Cervesato, Frank Pfenning, David Walker: A Concurrent Logical Framework: The Propositional Fragment. TYPES 2003: 355-377- 2002
[j6]
[c24]Frederick Butler, Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov: A Formal Analysis of Some Properties of Kerberos 5 Using MSR. CSFW 2002: 175-
[c23]Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov: A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis. ISSS 2002: 356-383
[c22]Iliano Cervesato: Data Access Specification and the Most Powerful Symbolic Attacker in MSR. ISSS 2002: 384-416- 2001
[c21]- 2000
[j5]Iliano Cervesato, Massimo Franceschet, Angelo Montanari: A Guided Tour through Some Extensions of the Event Calculus. Computational Intelligence 16(2): 307-347 (2000)
[j4]Iliano Cervesato: Typed Multiset Rewriting Specifications of Security Protocols. Electr. Notes Theor. Comput. Sci. 40: 8-51 (2000)
[j3]Iliano Cervesato, Joshua S. Hodas, Frank Pfenning: Efficient resource management for linear logic proof search. Theor. Comput. Sci. 232(1-2): 133-163 (2000)
[c20]Iliano Cervesato, Nancy A. Durgin, John C. Mitchell, Patrick Lincoln, Andre Scedrov: Relating Strands and Multiset Rewriting for Security Protocol Analysis. CSFW 2000: 35-51
[c19]
[c18]
1990 – 1999
- 1999
[j2]Iliano Cervesato, Angelo Montanari: A General Modal Framework for the Event Calculus and Its Skeptical and Credulous Variants. J. Log. Program. 38(2): 111-164 (1999)
[c17]Iliano Cervesato, Nancy A. Durgin, Patrick Lincoln, John C. Mitchell, Andre Scedrov: A Meta-Notation for Protocol Analysis. CSFW 1999: 55-69- 1998
[j1]Iliano Cervesato, Massimo Franceschet, Angelo Montanari: The Complexity of Model Checking in Modal Event Calculi with Quantifiers. Electron. Trans. Artif. Intell. 2: 1-23 (1998)
[c16]Iliano Cervesato: Proof-Theoretic Foundation of Compilation in Logic Programming. IJCSLP 1998: 115-129
[c15]Iliano Cervesato, Massimo Franceschet, Angelo Montanari: The Complexity of Model Checking in Modal Event Calculi with Quantifiers. KR 1998: 368-379
[c14]Iliano Cervesato, Massimo Franceschet, Angelo Montanari: Event Calculus with Explicit Quantifiers. TIME 1998: 81-88- 1997
[c13]Iliano Cervesato, Massimo Franceschet, Angelo Montanari: The Complexity of Model Checking in Modal Event Calculi. ICLP 1997: 419
[c12]
[c11]Iliano Cervesato, Massimo Franceschet, Angelo Montanari: Modal Event Calculi with Preconditions. TIME 1997: 38-45- 1996
[c10]Angelo Montanari, Luca Chittaro, Iliano Cervesato: A General Modal Framework for the Event Calculus and its Skeptical and Credulous Variants. ECAI 1996: 33-37
[c9]Iliano Cervesato, Joshua S. Hodas, Frank Pfenning: Efficient Resource Management for Linear Logic Proof Search. ELP 1996: 67-81
[c8]- 1995
[c7]Iliano Cervesato: Petri Nets and Linear Logic: a Case Study for Logic Programming. GULP-PRODE 1995: 313-320
[c6]Iliano Cervesato, Luca Chittaro, Angelo Montanari: A Modal Calculus of Partially Ordered Events in a Logic Programming Framework. ICLP 1995: 299-313- 1994
[c5]Iliano Cervesato, Luca Chittaro, Angelo Montanari: What the Event Calculus actually does, and how to do it efficiently. GULP-PRODE (2) 1994: 336-350
[c4]- 1993
[c3]Iliano Cervesato, Gianfranco Rossi: A WAM Implementation for the Logic Meta Programming Language 'Log. GULP 1993: 203-214
[c2]Iliano Cervesato, Christoph F. Eick: Expression and Enforcement of Dynamic Integrity Constraints. SEBD 1993: 283-298- 1992
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:55 CEST by the dblp team



