Lucid—A Formal System for Writing and Proving Programs

DOI10.1137/0205029MaRDI QIDQ4136511zbMATH OpenOpenAlexFDO

Authors E. A. Ashcroft, W. W. Wadge

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0205029

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(12)

• Design and correctness of a compiler for a non-procedural language
• Recursion equation sets computing logic programs
• Semantics of algorithmic languages
• Semantic properties of Lucid's compute clause and its compilation
• scientific article; zbMATH DE number 3558921 (Why is no real title available?)
• A graphic language based on timing diagrams
• A denotational semantics and dataflow construction for logic programs
• Multidimensional infinite data in the language Lucid
• An operator net model for distributed systems
• Correctness of a lucid interpreter based on linked forest manipulation systems
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
• A denotational theory of synchronous reactive systems

Describes a project that uses

Uses Software

• LCF

This page was built for publication: Lucid—A Formal System for Writing and Proving Programs

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