Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction

DOI10.1007/978-3-319-17822-6_2MaRDI QIDQ2949697zbMATH OpenOpenAlexFDO

Authors Danny De Schreye, Vincent Nys, C. Nicholson

Publication date 2 October 2015

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://lirias.kuleuven.be/handle/123456789/487002

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Abstract conjunctive partial deduction for the analysis and compilation of coroutines
• Program analysis to support concurrent programming in declarative languages
• Compositional reasoning for shared-variable concurrent programs
• Abstract interpretation of trace semantics for concurrent calculi
• scientific article; zbMATH DE number 1927413
• Applying abstract acceleration to (co-)reachability analysis of reactive programs
• Automata, Languages and Programming

Cited in

(5)

• A calculus of coroutines
• Using coroutines in pascal
• Incorporating static analysis in a combinator-based compiler
• Abstract conjunctive partial deduction for the analysis and compilation of coroutines
• Guarded and unguarded coroutines: An implementation in BCPL

This page was built for publication: Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction

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