Extracting non-deterministic concurrent programs

DOI10.4230/LIPICS.CSL.2016.26MaRDI QIDQ5278412zbMATH OpenOpenAlexFDO

Authors

Publication date 19 July 2017

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.CSL.2016.26

zbMATH Keywords

computable analysisproof theoryconcurrencyrealizabilitynon-determinismprogram extraction

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Constructive and recursive analysis (03F60)

Recommendations

• Intuitionistic fixed point logic
• Extraction and verification of programs by analysis of formal proofs
• Proofs and programs: A naïve approach to program extraction
• Proofs, programs, processes
• scientific article; zbMATH DE number 177798

Cited in

(5)

• Extracting total Amb programs from proofs
• Program extraction for mutable arrays
• Intuitionistic fixed point logic
• Extracting efficient exact real number computation from proofs in constructive type theory
• scientific article; zbMATH DE number 7731929 (Why is no real title available?)

This page was built for publication: Extracting non-deterministic concurrent programs

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