Testing for refinement in \textsf{Circus}

DOI10.1007/S00236-011-0133-ZzbMath1237.68059OpenAlexW1966324913MaRDI QIDQ766162

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

operational semanticsdenotational semantics\textsf{Circus} testing theorysymbolic tests

Mathematics Subject Classification ID

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

Related Items (4)

Testing using CSP Models: Time, Inputs, and Outputs ⋮ Test selection for traces refinement ⋮ Complete model-based equivalence class testing for nondeterministic systems ⋮ Testing for refinement in \textsf{Circus}

Uses Software

• HOL-Z
• csp2B
• Z
• Circus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A refinement strategy for Circus
• Testing for refinement in \textsf{Circus}
• A UTP semantics for \textsf{Circus}
• Testing algebraic data types and processes: A unifying theory
• Testing equivalences for processes
• Specification and (property) inheritance in CSP-OZ
• On the testability of SDL specifications
• On testing UML statecharts
• A Note on Traces Refinement and the conf Relation in the Unifying Theories of Programming
• Testing Software Design Modeled by Finite-State Machines
• Mathematics of Program Construction
• Guided Test Generation from CSP Models
• Theoretical Aspects of Computing - ICTAC 2004
• FM 2005: Formal Methods
• FM 2005: Formal Methods
• csp2B: A practical approach to combining CSP and B

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