Proving concurrent constraint programming correct, revisited
From MaRDI portal
Publication:530860
DOI10.1016/j.entcs.2015.04.011zbMath1342.68238OpenAlexW2085903839WikidataQ57850737 ScholiaQ57850737MaRDI QIDQ530860
Elaine Pimentel, Carlos Olarte
Publication date: 1 August 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2015.04.011
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) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
On concurrent behaviors and focusing in linear logic, A proof theoretic view of spatial and temporal dependencies in biochemical systems, On subexponentials, focusing and modalities in concurrent systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic spaces in concurrent constraint programming
- Linear logic
- A framework for proof systems
- Focusing and polarization in linear, intuitionistic, and classical logics
- Linear concurrent constraint programming: Operational and phase semantics
- Models and emerging trends of concurrent constraint programming
- A two-level logic approach to reasoning about computations
- A General Proof System for Modalities in Concurrent Constraint Programming
- Observational equivalences for linear logic concurrent constraint languages
- The Abella Interactive Theorem Prover (System Description)
- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
- Logic Programming with Focusing Proofs in Linear Logic
- A foundation for higher-order concurrent constraint programming
- Least and Greatest Fixed Points in Linear Logic
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
