Lucid—A Formal System for Writing and Proving Programs

DOI10.1137/0205029zbMATH Open0362.68030OpenAlexW2061121751MaRDI QIDQ4136511FDOQ4136511

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)

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

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)