Synthesis of large concurrent programs via pairwise composition

DOI10.1007/3-540-48320-9_11MaRDI QIDQ4270054zbMATH OpenFDO

Authors Paul C. Attie

Publication date 10 November 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48320-9_11

zbMATH Keywords

concurrent programs

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Synthesis of large dynamic concurrent programs from dynamic specifications
• An algorithmic framework for synthesis of concurrent programs
• Synthesizing concurrent programs using answer set programming
• Synthesis of a system composed by many similar objects
• Synthesis of asynchronous reactive programs from temporal specifications

Cited in

(10)

• An algorithmic framework for synthesis of concurrent programs
• scientific article; zbMATH DE number 3868590 (Why is no real title available?)
• Synthesis of a system composed by many similar objects
• scientific article; zbMATH DE number 5149070 (Why is no real title available?)
• Synthesis of large dynamic concurrent programs from dynamic specifications
• scientific article; zbMATH DE number 3976309 (Why is no real title available?)
• scientific article; zbMATH DE number 3982421 (Why is no real title available?)
• scientific article; zbMATH DE number 1830933 (Why is no real title available?)
• Synthesizing concurrent programs using answer set programming
• Finite-state concurrent programs can be expressed in pairwise normal form

This page was built for publication: Synthesis of large concurrent programs via pairwise composition

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