A general proof system for modalities in concurrent constraint programming

DOI10.1007/978-3-642-40184-8_29MaRDI QIDQ2842123zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

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

Recommendations

• On subexponentials, focusing and modalities in concurrent systems
• Subexponential concurrent constraint programming
• A proof theoretic study of soft concurrent constraint programming
• scientific article; zbMATH DE number 3898221
• scientific article; zbMATH DE number 2087421

Cited in

(20)

• Proving concurrent constraint programming correct, revisited
• Subexponentials in non-commutative linear logic
• On subexponentials, focusing and modalities in concurrent systems
• Dynamic spaces in concurrent constraint programming
• Hybrid and subexponential linear logics
• Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs
• Foundations for reliable and flexible interactive multimedia scores
• scientific article; zbMATH DE number 4037170 (Why is no real title available?)
• Expressing additives using multiplicatives and subexponentials
• Hybrid linear logic, revisited
• On concurrent behaviors and focusing in linear logic
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• Verification of spatial and temporal modalities in biochemical systems
• Proof search and certificates for evidential transactions
• Mechanizing focused linear logic in Coq
• Subexponential concurrent constraint programming
• Undecidability of multiplicative subexponential logic
• Programming Languages and Systems
• A framework for linear authorization logics
• Kleene star, subexponentials without contraction, and infinite computations

This page was built for publication: A general proof system for modalities in concurrent constraint programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842123)