Relational Methods in Computer Science
From MaRDI portal
Publication:5899318
DOI10.1007/11734673zbMath1185.68227OpenAlexW2482623798MaRDI QIDQ5899318
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11734673
Specification and verification (program logics, model checking, etc.) (68Q60) Other algebras related to logic (03G25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (10)
Normal design algebra ⋮ Abstract representation theorems for demonic refinement algebras ⋮ Defense in Depth Formulation and Usage in Dynamic Access Control ⋮ Fixing Zeno gaps ⋮ Algebraic separation logic ⋮ Fixpoints for general correctness ⋮ Building program construction and verification tools from algebraic principles ⋮ Modal algebra and Petri nets ⋮ Infinite executions of lazy and strict computations ⋮ Completeness results for omega-regular algebras
This page was built for publication: Relational Methods in Computer Science
