Encoding Circus programs in ProofPower-Z

DOI10.1007/978-3-642-14521-6_13MaRDI QIDQ3585033zbMATH OpenOpenAlexFDO

Authors Frank Zeyda, Ana Cavalcanti

Publication date 31 August 2010

Published in Unifying Theories of Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14521-6_13

zbMATH Keywords

semanticsrefinementtheorem provingZUTP

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Automating refinement of Circus programs
• A UTP semantics for \textsf{Circus}
• Type checking \textsf{Circus} specifications
• Testing for refinement in \textsf{Circus}
• Unifying theories in ProofPower-Z

Cited in

(8)

• Mechanised support for sound refinement tactics
• Angelic processes for CSP via the UTP
• A UTP semantics for \textsf{Circus}
• Automating refinement of Circus programs
• FM 2005: Formal Methods
• Type checking \textsf{Circus} specifications
• The logic of \(U\cdot(TP)^{2}\)
• UTP, \textsf{\textit{Circus}}, and Isabelle

Describes a project that uses

Uses Software

• Circus
• ProofPower
• ArcAngelC

This page was built for publication: Encoding Circus programs in ProofPower-Z

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