A General Proof System for Modalities in Concurrent Constraint Programming

DOI10.1007/978-3-642-40184-8_29zbMath1390.68485DBLPconf/concur/NigamOP13OpenAlexW87267104WikidataQ57850801 ScholiaQ57850801MaRDI QIDQ2842123

Vivek Nigam, Carlos Olarte, Elaine Pimentel

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40184-8_29

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (17)

On concurrent behaviors and focusing in linear logic ⋮ Dynamic spaces in concurrent constraint programming ⋮ A proof theoretic view of spatial and temporal dependencies in biochemical systems ⋮ On subexponentials, focusing and modalities in concurrent systems ⋮ Foundations for Reliable and Flexible Interactive Multimedia Scores ⋮ Subexponential concurrent constraint programming ⋮ Unnamed Item ⋮ A framework for linear authorization logics ⋮ Expressing additives using multiplicatives and subexponentials ⋮ Kleene star, subexponentials without contraction, and infinite computations ⋮ Hybrid and subexponential linear logics ⋮ Proving concurrent constraint programming correct, revisited ⋮ Verification of spatial and temporal modalities in biochemical systems ⋮ Proof search and certificates for evidential transactions ⋮ Hybrid linear logic, revisited ⋮ Subexponentials in non-commutative linear logic ⋮ Mechanizing focused linear logic in Coq

This page was built for publication: A General Proof System for Modalities in Concurrent Constraint Programming