Program composition via unification

DOI10.1016/0304-3975(94)90093-0zbMATH Open0822.68061OpenAlexW1998032456MaRDI QIDQ1331925FDOQ1331925

Nissim Francez, Orna Grumberg, Limor Fix

Publication date: 29 August 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90093-0

zbMATH Keywords

verification of programscompositional proof systemsjigsaw operator

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Program development by stepwise refinement
• Communicating sequential processes
• Specifying Concurrent Program Modules
• Predicative programming Part II
• Program composition via unification

Cited In (3)

• Reasoning about programs by exploiting the environment
• Title not available (Why is that?)
• Program composition via unification

Uses Software

• UNITY

   Recommendations

• Program composition via unification 👍 👎
• Unifying program construction and modification 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Compositional programming: theory and practice 👍 👎
• Synthesis of rewrite programs by higher-order and semantic unification 👍 👎
• Semantic synthesis of programs by matching compositions 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Program composition via unification

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