Testing can be formal, too

DOI10.1007/3-540-59293-8_188zbMath1496.68107OpenAlexW1527688737MaRDI QIDQ5096726

Marie-Claude Gaudel

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_188

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)

Related Items (13)

Generation of complete test suites from Mealy input/output transition systems ⋮ Testing conformance of a deterministic implementation against a non-deterministic stream X-machine ⋮ Testing against a non-controllable stream X-machine using state counting ⋮ Passive testing with asynchronous communications and timestamps ⋮ Goodbye ioco ⋮ Removing redundant refusals: minimal complete test suites for failure trace semantics ⋮ On theorem prover-based testing ⋮ Testing restorable systems: formal definition and heuristic solution based on river formation dynamics ⋮ Complete model-based equivalence class testing for nondeterministic systems ⋮ Timed implementation relations for the distributed test architecture ⋮ Checking experiments for stream X-machines ⋮ Formalizing and testing the consistency of DSL transformations ⋮ Introducing complexity to formal testing

Cites Work

• Observational implementation of algebraic specifications
• A contribution to the theory of program testing
• On observational equivalence and algebraic specification
• Partial abstract types
• A Mathematical Framework for the Investigation of Testing

This page was built for publication: Testing can be formal, too