McDowell, R., D. Miller and C. Palamidessi, Encoding transition systems in sequent calculus, Theoretical Computer Science 294 (2003), pp. 411--437.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....non determinism in the de nition of a process [3, 22] and synchronization. Following the paradigm of proofs as computations proposed in [2, 28] provability in fragments of linear logic can be used then as a formal tool to reason about behavioural aspects of concurrent systems (see e.g. [31]) In other paradigms for concurrency like the theory of Petri Nets there exist however a number of consolidated algorithmic techniques for the validation of system properties. In [5, 6] we made a rst attempt of relating these techniques with propositional fragments of linear logic, and, more ....

R. McDowell, D. Miller, and C. Palamidessi. Encoding Transition Systems in Sequent Calculus. In Proc. of Linear Logic 96 Tokyo Meeting, ENTCS 3, 1996.

.... like locality, recursion, non determinism, and synchronization [3, 32, 26] Following the paradigm of proofs as computations proposed in [2, 33] provability in fragments of linear logic can be used then as a formal tool to reason about behavioural aspects of concurrent systems (see e.g. [36]) In other paradigms for concurrency like the theory of Petri Nets there exist however a number of consolidated algorithmic techniques for the validation of system properties. In [6, 7] we made a rst attempt of relating these techniques with propositional fragments of linear logic, and, more ....

R. McDowell, D. Miller, and C. Palamidessi. Encoding Transition Systems in Sequent Calculus. In Proc. of Linear Logic 96 Tokyo Meeting, ENTCS 3, 1996.

....by [7, 24, 6, 9] in which eigenvariables are intended as variables to be substituted. This enrichment to proof theory (discussed here in Section 4) holds promise for providing proof systems for the direct reasoning of logic specifications (see, for example, the above mentioned papers as well as [10, 11]) These two approaches are, however, at odds with each other. Consider, for example, the problem of representing restriction of names or nonces using 8 quantification. The following example can be dualized in the event that a logical specification uses 9 quantification instead of 8, as in, for ....

....is essentially the backchaining rule found in logic programming, while defL is essentially a case analysis on how an atom can be proved and can be used to establish finite failure. Together, these two rules can be used to encode simulation and bisimulation in certain abstract transition systems [11]. Other uses involve reasoning about computational system [10] The proof system that arises from adding together the inference rules in Figures 2 and 3 is called FO . If we add to FO the rules in Figure 1, the resulting proof system (pronounced fold nabla ) It is this logic that will ....

[Article contains additional citation context not shown here]

R. McDowell, D. Miller, and C. Palamidessi. Encoding transition systems in sequent calculus. Theoretical Computer Science, 294(3):411-437, 2003.

....testing and the Dolev Yao notion of intruder must be formally established. Safety properties One is often interested in safety properties: that is, finding out whether or not an intruder causes a bad behavior. Detailed analysis of reachability is likely to be possible following the approaches in [20, 21] that are intended to work directly on logic specifications of the form given here. Experimentation Of course, serious experimentation with protocols and their formal properties should be explored. Given a modern logic programming language such as #Prolog that incorporates # terms and their ....

R. McDowell, D. Miller, and C. Palamidessi. Encoding transition systems in sequent calculus. TCS, 294(3):411--437, 2003.

.... Specific features have been separately studied in previous works: object orientation and concurrency in LO [3, 2] and ACL [29] deductive databases in [27] logic programming in [25] communicating processes in [35] imperative programming paradigms in [11, 38] and transition systems in [42]. The importance of such works is not limited to the development of new high level languages. In fact, they can help in the analysis of declarative programs properties and in the verification of their correctness. Experimental results in this field have been obtained in the study of logical ....

Raymond McDowell, Dale Miller, and Catuscia Palamidessi. Encoding transition systems in sequent calculus. ENTCS, 3, 1996.

.... Programming, the so called Linear Logic Programming (LLP) paradigm [Mil95] It has been successfully applied to formalize important programming aspects such as data management [HM94,BDM97] object orientation [AP90,DM95,BDLM96] statebased computations [Chi95] and aspects of concurrency [Mil93,MMP96] These features make LLP a suitable framework for specifying distributed systems and agent systems in particular. The notion of state in LLP has a natural correspondence with the notion of state and beliefs of an agent. The possibility of using resources during a computation is a natural means ....

R. McDowell, D. Miller, and C. Palamidessi. Encoding transition systems in sequent calculus. ENTCS, 3, 1996.

....The advantages of using linear logic derive from its being a general purpose logic whose relationships with computational paradigms for imperative and concurrent programming are well known. In fact, Forum has successfully been applied to formalize important programming aspects as shown in [33, 15, 13, 26, 30]. In particular, our previous work on object oriented languages [15, 14, 8] has shown that specifications in Forum can be considered as logic programs, thus allowing verification and experiments over the encoded languages. Furthermore, Forum is a well founded extensions of logic programming in the ....

R. McDowell, D. Miller, and C. Palamidessi. Encoding transition systems in sequent calculus. ENTCS, 3, 1996.

.... (it works entirely within the multiplicative fragment) We will extend the treatment to support a much larger fragment of linear logic, which will handle, for example, the Stolen Car Problem (for which one needs additive connectives) Furthermore, we can also, by using Girard s Fixed Point Theorem [8, 17], handle ramification in a principled way (this will be described in a subsequent paper) previous work on ramification using linear reasoning for example, 26] has been somewhat ad hoc. 2 Examples We first discuss several standard AI examples, and show how they can be handled using ....

Raymond McDowell, Dale Miller and Catuscia Palamidessi, "Encoding Transition Systems in Sequent Calculus", Theoretical Computer Science, Theoretical Computer Science 1997.

No context found.

Raymond McDowell, Dale Miller, and Catuscia Palamidessi. Encoding transition systems in sequent calculus. Theoretical Computer Science, 197(1-2), 2001. To appear.

....above. We first convert the two Horn clauses representing the evaluation rules for the conditional into the following definition clauses. #V. #V. This sequent then has the following simple and immediate proof. true, M false, M defL In the paper [MMP01], the expressive strength of definitions was studied in greater depth. One example considered there involved attempting to capture the notion of simulation and bisimulation for labeled transition systems. In particular, assume that P P # is defined via clauses to which are added the two 3 sim ....

....bisimulation as definitions. clauses in Figure 1. These two clauses are a direct encoding of the closure conditions for simulation and bisimulation. To satisfy the restrictions on levels, the level given to the predicate must be less than the level given to either predicate sim or bisim. In [MMP01] it was proved that if the labeled transition system is finite (noetherian) then simulation and bisimulation coincided exactly with provability of sim P Q and bisim P Q. Since provability characterizes the least fixed point and simulation and bisimulation are characterized using the greatest fixed ....

[Article contains additional citation context not shown here]

Raymond McDowell, Dale Miller, and Catuscia Palamidessi. Encoding transition systems in sequent calculus. TCS, 197(1-2), 2001. To appear.

....we shall see, the integration of definitions into sequent calculus makes it possible to perform a case analysis on possible ways that a specified computation can progress. If exploited properly, it is possible to capture notions such as simulation and bisimulation between two processes. The paper [16] shows how this can be accomplished in abstract transition systems and CCS. A final area where FO DeltaIN has been used to reason about specifications is in the area of logical frameworks and higher order abstract syntax. Logical frameworks have been successfully used to give high level, ....

Raymond McDowell, Dale Miller, and Catuscia Palamidessi. Encoding transition systems in sequent calculus. Draft manuscript submitted to Theoretical Computer Science. Preliminary version appeared as [15], April 1997.

No context found.

McDowell, R., D. Miller and C. Palamidessi, Encoding transition systems in sequent calculus, Theoretical Computer Science 294 (2003), pp. 411--437.

No context found.

R. McDowell, D. Miller, and C. Palamidessi. Encoding Transition Systems in Sequent Calculus. In Proc. of Linear Logic 96 Tokyo Meeting, ENTCS 3, 1996.

No context found.

Raymond McDowell, Dale Miller, and Catuscia Palamidessi. Encoding transition systems in sequent calculus. TCS, 294(3):411--437, 2003.

No context found.

R. McDowell, D. Miller, and C. Palamidessi. Encoding transition systems in sequent calculus. TCS, 294(3):411--437, 2003.

No context found.

R. McDowell, D. Miller, and C. Palamidessi. Encoding transition systems in sequent calculus. TCS, 294(3):411-437, 2003.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC