• Publications
  • Influence
Linear logic
  • P. Lincoln
  • Computer Science, Philosophy
  • 1 May 1992
This column presents an intuitive overview of linear logic, some recent theoretical results, and summarizes several applications oflinear logic to computer science.
All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic
This chapter discusses core Maude, a Hierarchy of Data Types: From Trees to Sets to Sets, and Object-Based Programming, which specifies Parameterized Data Structures in Maude.
Maude: specification and programming in rewriting logic
Architectural support for copy and tamper resistant software
The hardware implementation of a form of execute-only memory (XOM) that allows instructions stored in memory to be executed but not otherwise manipulated is studied, indicating that it is possible to create a normal multi-tasking machine where nearly all applications can be run in XOM mode.
The Maude 2.0 System
This paper gives an overviewof the Maude 2.0 system. We emphasize the full generality with which rewriting logic and membership equational logic are supported, operational semantics issues, the new
Decision problems for propositional linear logic
It is shown that, unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable and, provided that without the model storage operator, the decision problem becomes PSPACE-complete.
Multiset rewriting and the complexity of bounded security protocols
It is proved that, even for the case where the authors restrict the size of messages and the depth of message encryption, the secrecy problem is undecidable for the cases of an unrestricted number of protocol roles and an unbounded number of new nonces.
Le Fun: Logic, Equations and Functions
This work proposes a computation delaying mechanism called residuation that allows a clear distinction between functional evaluation and logical deduction, and describes an implementation of the residuation paradigm as a prototype language called Le Fun—Logic, equations, and Functions.
A meta-notation for protocol analysis
This paper uses a multiset rewriting formalism, based on linear logic, to state the basic assumptions of this model, and defines a class of theories that correspond to finite-length protocols, with a bounded initialization phase but allowing unboundedly many instances of each protocol role.