Testing for refinement in \textsf{Circus}

DOI10.1007/S00236-011-0133-ZMaRDI QIDQ766162zbMATH OpenOpenAlexFDO

Authors Ana Cavalcanti, Marie-Claude Gaudel

Publication date 23 March 2012

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-011-0133-z

zbMATH Keywords

denotational semanticsoperational semantics\textsf{Circus} testing theorysymbolic tests

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Type checking \textsf{Circus} specifications
• A UTP semantics for \textsf{Circus}
• A refinement strategy for Circus
• On Testing the Extent of Noncircularity
• A simulation technique for checking the circle criterion

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 48630 (Why is no real title available?)
• scientific article; zbMATH DE number 605806 (Why is no real title available?)
• scientific article; zbMATH DE number 605917 (Why is no real title available?)
• scientific article; zbMATH DE number 2013582 (Why is no real title available?)
• scientific article; zbMATH DE number 1487746 (Why is no real title available?)
• scientific article; zbMATH DE number 1519981 (Why is no real title available?)
• scientific article; zbMATH DE number 2086955 (Why is no real title available?)
• scientific article; zbMATH DE number 938070 (Why is no real title available?)
• scientific article; zbMATH DE number 1409638 (Why is no real title available?)
• A UTP semantics for \textsf{Circus}
• A note on traces refinement and the conf relation in the unifying theories of programming
• A refinement strategy for Circus
• FM 2005: Formal Methods
• FM 2005: Formal Methods
• Guided Test Generation from CSP Models
• Mathematics of Program Construction
• On testing UML statecharts
• On the testability of SDL specifications
• Specification and (property) inheritance in CSP-OZ
• Testing Software Design Modeled by Finite-State Machines
• Testing algebraic data types and processes: A unifying theory
• Testing equivalences for processes
• Testing for refinement in \textsf{Circus}
• Theoretical Aspects of Computing - ICTAC 2004
• Unifying theories for logic programming
• csp2B: A practical approach to combining CSP and B

Cited in

(14)

• Testing using CSP Models: Time, Inputs, and Outputs
• A refinement strategy for Circus
• A UTP semantics for \textsf{Circus}
• Automating refinement of Circus programs
• Encoding Circus programs in ProofPower-Z
• FM 2005: Formal Methods
• Test selection for traces refinement
• Testing for refinement in \textsf{Circus}
• Type checking \textsf{Circus} specifications
• \textit{\textsf{Circus2CSP}}: a tool for model-checking \textit{\textsf{Circus}} using FDR
• UTP, \textsf{\textit{Circus}}, and Isabelle
• Towards a model-checker for \textit{\textsf{Circus}}
• Complete model-based equivalence class testing for nondeterministic systems
• Specification coverage for testing in Circus

Describes a project that uses

Uses Software

• Circus
• Z
• csp2B
• HOL-Z

This page was built for publication: Testing for refinement in \textsf{Circus}

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