Monadic Sequence Testing and Explicit Test-Refinements
From MaRDI portal
Recommendations
- Monoids of non-halting programs with tests
- scientific article; zbMATH DE number 2086515
- Towards deriving test sequences by model checking
- Logic Programming
- Monotonic abstraction in parameterized verification
- Mathematical Foundations of Computer Science 2003
- A Recursion Theoretic Approach to Program Testing
- MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
- Formal verification of monad transformers
Cites work
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 938070 (Why is no real title available?)
- scientific article; zbMATH DE number 3254909 (Why is no real title available?)
- A formulation of the simple theory of types
- An introduction to mathematical logic and type theory: To truth through proof.
- Comprehending monads
- Conformance relations for labeled event structures
- FM 2005: Formal Methods
- Foundations of set theory
- Minimization of symbolic automata
- On theorem prover-based testing
- Symbolic Model-based Test Selection
- Symbolic automata: the toolkit
- Test-Sequence Generation with Hol-TestGen with an Application to Firewall Testing
Cited in
(2)
This page was built for publication: Monadic Sequence Testing and Explicit Test-Refinements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827440)
