Lucid—A Formal System for Writing and Proving Programs
From MaRDI portal
Publication:4136511
DOI10.1137/0205029zbMath0362.68030OpenAlexW2061121751MaRDI QIDQ4136511
E. A. Ashcroft, William 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
Related Items
Unnamed Item, An operator net model for distributed systems, Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic, Recursion equation sets computing logic programs, A denotational theory of synchronous reactive systems, Multidimensional infinite data in the language Lucid, Correctness of a lucid interpreter based on linked forest manipulation systems, A graphic language based on timing diagrams, Design and correctness of a compiler for a non-procedural language, Semantic properties of Lucid's compute clause and its compilation, Semantics of algorithmic languages, A denotational semantics and dataflow construction for logic programs
Uses Software