Skip to main content Accessibility help
×
×
Home

Relating reasoning methodologies in linear logic and process algebra

  • YUXIN DENG (a1), ROBERT J. SIMMONS (a2) and ILIANO CERVESATO (a3)
Abstract

We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of barbed preorder for a CCS-like process calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The argument makes use of other standard notions in process algebra, namely simulation and labelled transition systems. This result establishes a connection between an approach to reason about process specifications, the barbed preorder, and a method to reason about logic specifications, the logical preorder.

Copyright
References
Hide All
Abramsky, S. (1994) Proofs as processes. Theoretical Computer Science 135 59.
Amadio, R., Castellani, I. and Sangiorgi, D. (1998). On bisimulation for the asynchronous pi-calculus. Theoretical Computer Science 195 (2)291324.
Barber, A. (1996) Dual intuitionistic linear logic. Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University of Edinburgh.
Caires, L. and Cardelli, L. (2003) A spatial logic for concurrency (part I). Information and Computation 186 (2)194235.
Caires, L. and Pfenning, F. (2010) Session types as intuitionistic linear propositions. In: Proceedings of the 21st International Conference on Concurrency Theory. Springer Lecture Notes in Computer Science 6269 222236.
Caires, L., Pfenning, F. and Toninho, B. (2012) Towards concurrent type theory. In: Proceedings of the Seventh ACM SIGPLAN Workshop on Types in Languages Design and Implementation, ACM 112.
Cervesato, I., Durgin, N., Kanovich, M. I. and Scedrov, A. (2000) Interpreting strands in linear logic. In: Veith, H., Heintze, N. and Clark, E. (eds.) Workshop on Formal Methods and Computer Security – FMCS'00, Chicago, IL.
Cervesato, I., Pfenning, F., Walker, D. and Watkins, K. (2002) A concurrent logical framework II: Examples and applications. Technical Report CMU-CS-2002-002, Department of Computer Science, Carnegie Mellon University. Revised May 2003.
Cervesato, I. and Scedrov, A. (2009) Relating state-based and process-based concurrency through linear logic. Information and Computation 207 10441077.
Dam, M. (1994) Process-algebraic interpretations of positive linear and relevant logics. Journal of Logic and Computation 4 (6)939973.
Deng, Y. and Du, W. (2011) Logical, metric, and algorithmic characterisations of probabilistic bisimulation. Technical Report CMU-CS-11-110, Carnegie Mellon University.
Deng, Y. and Hennessy, M. (2011) On the semantics of markov automata. In: Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11) Springer Lecture Notes in Computer Science 6756 307318.
Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C. and Zhang, C. (2007) Characterising testing preorders for finite probabilistic processes. In: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society 313325.
Ehrhard, T. and Laurent, O. (2010) Interpreting a finitary pi-calculus in differential interaction nets. Information and Computation 208 (6)606633.
Fournet, C. and Gonthier, G. (2000) The join calculus: A language for distributed mobile programming. Applied Semantics Summer School – APPSEM'00, Caminha. Available at http://research.microsoft.com/~fournet.
Fournet, C. and Gonthier, G. (2005) A hierarchy of equivalences for asynchronous calculi. Journal of Logic and Algebraic Programming 63 (1)131173.
Gentzen, G. (1935) Untersuchungen über das logische schließen. I. Mathematische Zeitschrift 39 (1)176210.
Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50 1102.
Girard, J.-Y., Taylor, P. and Lafont, Y. (1989) Proofs and Types, Cambridge University Press.
Hennessy, M. and Milner, R. (1985) Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32 (1)137161.
Hoare, C. (1985) Communicating Sequential Processes, Prentice Hall.
Honda, K. and Yoshida, N. (1995) On reduction-based process semantics. Theoretical Computer Science 151 (2)437486.
Lincoln, P. and Saraswat, V. (1991) Proofs as concurrent processes: A logical interpretation for concurrent constraint programming. Technical report, Systems Sciences Laboratory, Xerox PARC.
Martin-Löf, P. (1996) On the meanings of the logical constants and the justifications of the logical laws. Nordic Journal of Philosophical Logic 1 (1)1160.
McDowell, R., Miller, D. and Palamidessi, C. (2003) Encoding transition systems in sequent calculus. Theoretical Computer Science 294 (3)411437.
Miller, D. (1992) The π-calculus as a theory in linear logic: Preliminary results. In: Lamma, E. and Mello, P. (eds.) Proceedings of the Workshop on Extensions to Logic Programming – ELP'92. Springer-Verlag Lecture Notes in Computer Science 660 242265.
Milner, R. (1989) Communication and Concurrency, Prentice Hall.
Pfenning, F. (2000) Structural cut elimination I. Intuitionistic and classical logic. Information and Computation 157 (1/2)84141.
Pfenning, F. and Davies, R. (2001) A judgmental reconstruction of modal logic. Mathematical Structures in Computer Science 11 (4)511540. Notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Rathke, J. and Sobocinski, P. (2008) Deriving structural labelled transitions for mobile ambients. In: Proceedings of the 19th International Conference on Concurrency Theory. Springer Lecture Notes in Computer Science 5201 462476.
Sangiorgi, D. and Walker, D. (2001) The π-Calculus: A Theory of Mobile Processes, Cambridge University Press.
Tiu, A. and Miller, D. (2004) A proof search specification of the π-calculus. In: 3rd Workshop on the Foundations of Global Ubiquitous Computing. Electronic Notes in Theoretical Computer Science 138 79101.
Wadler, P. (2012) Propositions as sessions. In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, ACM 273286.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed