A formal abstract framework for modelling and testing complex software systems

DOI10.1016/j.tcs.2011.12.072zbMath1279.68193OpenAlexW2150690459MaRDI QIDQ714878

Frédéric Boulanger, Bilal Kanso, Marc Aiguier

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.072

zbMATH Keywords

coalgebratransfer functionmonadconformance testingintegration operatorscomponent based systemcompositional testingtrace semantics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Modeling of complex systems. II: A minimalist and unified semantics for heterogeneous integrated systems
• Refusal testing
• Notions of computation and monads
• Components as coalgebras: the refinement dimension
• Testing equivalences for processes
• Universal coalgebra: A theory of systems
• Terminal coalgebras in well-founded set theory
• Proof of correctness of data representations
• Coalgebraic Components in a Many-Sorted Microcosm
• Symbolic Execution Techniques for Test Purpose Definition
• Testing of Abstract Components
• Communicating sequential processes
• Institutions: abstract model theory for specification and programming
• The Microcosm Principle and Concurrency in Coalgebra
• Guided Test Generation from CSP Models
• Tools and Algorithms for the Construction and Analysis of Systems
• Formal Approaches to Software Testing
• Formal Approaches to Software Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item