Synthesizing concurrent programs using answer set programming

DOI10.3233/FI-2012-758MaRDI QIDQ4902316zbMATH OpenOpenAlexFDO

Authors Emanuele De Angelis, Alberto Pettorossi, Maurizio Proietti

Publication date 14 January 2013

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2012-758

zbMATH Keywords

automatic synthesis of concurrent programscomputation tree logic

Mathematics Subject Classification ID

Logic programming (68N17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Theoretical Computer Science
• An algorithmic framework for synthesis of concurrent programs
• scientific article; zbMATH DE number 1361120
• Synthesis of large dynamic concurrent programs from dynamic specifications
• Synthesizing Imperative Code from Answer Set Programming Specifications

Cited in

(8)

• Automatic synthesis of optimal-size concentrators by answer set programming
• An algorithmic framework for synthesis of concurrent programs
• Synthesis of large dynamic concurrent programs from dynamic specifications
• scientific article; zbMATH DE number 177266 (Why is no real title available?)
• scientific article; zbMATH DE number 1361120 (Why is no real title available?)
• Optimal scheduling for exposed datapath architectures with buffered processing units by ASP
• Synthesizing Imperative Code from Answer Set Programming Specifications
• Synthesising reward machines for cooperative multi-agent reinforcement learning

Describes a project that uses

Uses Software

• Smodels
• Lparse

This page was built for publication: Synthesizing concurrent programs using answer set programming

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