Raymond McDowell, Dale Miller, Catuscia Palamidessi  Home/Search
Context Related
| kzoo.edu/pub/mcdowell/tcs00b.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: kzoo.edu/~mcdowell/cur...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Intuitionistic and linear logics can be used to specify the operational semantics of transition systems in various ways. We consider here two encodings: one uses linear logic and maps states of the transition system into formulas, and the other uses intuitionistic logic and maps states into terms. In both cases, it is possible to relate transition paths to proofs in sequent calculus. In neither encoding, however, does it seem possible to capture properties, such as simulation and bisimulation,... (Update)
Cited by: More
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006) (Correct)
Automated Protocol Verification in Linear Logic - Bozzano, Delzanno (2002) (Correct)
A Logical Framework For Reasoning About Logical Specifications - Tiu (2004) (Correct)
Similar documents (at the sentence level):
31.7%: Encoding Transition Systems in Sequent Calculus - Raymond Mcdowell (1997) (Correct)
Active bibliography (related documents): More All
0.4: Cut-Elimination for a Logic with Definitions and Induction - Raymond McDowell, Dale.. (1997) (Correct)
0.3: Encoding Generic Judgments - Dale Miller Computer (2001) (Correct)
0.3: January 6, 1998 - Ua Ry (Correct)
Similar documents based on text: More All
0.2: Foundational Aspects of Syntax - Miller, Palamidessi (1999) (Correct)
0.2: Confluence in Concurrent Constraint Programming - Falaschi, Gabbrielli.. (1996) (Correct)
0.2: Embedding as a tool for Language Comparison - de Boer, Palamidessi (1994) (Correct)
Related documents from co-citation: More All
9: Uniform proofs as a foundation for logic programming (context) - Miller, Nadathur et al. - 1991
8: calculus as a theory in linear logic: Preliminary results (context) - Miller - 1992
8: Proof Theoretic Approach to Specification Languages - Chirimar - 1995
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/mcdowell00encoding.html More
@article{ mcdowell03tcs,
author = {Raymond McDowell and Dale Miller and Catuscia Palamidessi},
title = {Encoding transition systems in sequent calculus},
journal = {TCS},
year = 2003,
volume = 294,
number = 3,
pages = {411-437},
url = {citeseer.ist.psu.edu/mcdowell00encoding.html} }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin - 1981
484 A Calculus of Communicating Systems (context) - Milner - 1980
447 Prentice-Hall International (context) - Milner, Concurrency - 1989
419 A formulation of the simple theory of types (context) - Church - 1940
384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
233 Natural semantics (context) - Kahn - 1987
215 Theoretical Computer Science (context) - Girard - 1987
180 Logic programming and negation: a survey - Apt, Bol - 1994
174 A unification algorithm for typed -calculus (context) - Huet - 1975
166 An Overview of Prolog (context) - Nadathur, Miller - 1988
146 Investigations into logical deductions (context) - Gentzen - 1969
145 Isabelle: The next 700 theorem provers (context) - Paulson - 1990
144 Contributions to the theory of logic programming (context) - Apt, van Emden - 1982
81 The linear time -- branching time spectrum (context) - van Glabbeek - 1990
48 From operational semantics to abstract machines (context) - Hannan, Miller - 1992
39 A proof-theoretic approach to logic programming (context) - Hallnas, Schroeder-Heister - 1991
39 Algebraic Theory of Processes (context) - Hennessy - 1988
38 Proof Theoretic Approach to Specification Languages - Chirimar - 1995
35 Normal process representatives (context) - Gehlot, Gunter - 1990
22 Rules of definitional reflection (context) - Schroeder-Heister - 1993
18 Extended natural semantics (context) - Hannan - 1993
16 Reasoning in a Logic with Definitions and Induction (context) - McDowell - 1997
16 Forum: A multiple-conclusion specification language (context) - Miller - 1996
16 Partial inductive definitions (context) - Hallnas - 1991
15 Cut-elimination for a logic with definitions and induction - McDowell, Miller - 2000
13 A complete axiomatization of the three-valued completion of .. - Stark - 1991
6 A finitary version of the calculus of partial inductive defi.. (context) - Eriksson - 1991
6 A natural deduction treatment of operational semantics (context) - Burstall, Honsell - 1988
5 A linear logic framework (context) - Cervesato, Pfenning - 1996
4 mailing-list-traffic/www/07/mail (context) - Girard, theorem et al. - 1992
3 GCLA: a definitional approach to logic programming (context) - Aronsson, Eriksson et al. - 1990
The graph only includes citing articles where the year of publication is known.
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