Play to Test

DOI10.1007/11759744_3zbMATH Open1183.68176OpenAlexW2145226117MaRDI QIDQ3434603FDOQ3434603

Authors: Andreas Blass, Lev Nachmanson, Margus Veanes, Yuri Gurevich 

Publication date: 2 May 2007

Published in: Formal Approaches to Software Testing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11759744_3

Recommendations

• Automata, Languages and Programming
• The complexity of coverage
• Reachability games on automatic graphs
• Information reuse for multi-goal reachability analyses
• A game-theoretic approach for the accuracy of testing

Mathematics Subject Classification ID

Applications of game theory (91A80) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Semantic essence of AsmL
• FM 2005: Formal Methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Evolving Algebras 1993: Lipari Guide
• Title not available (Why is that?)
• Play to Test
• Computer Science Logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Game models for open systems
• Title not available (Why is that?)

Cited In (12)

• A survey of stochastic \(\omega \)-regular games
• Computer Aided Verification
• A game-theoretic approach for the accuracy of testing
• Play to Test
• Complete open-state testing of limitedly nondeterministic systems
• Graph Games and Reactive Synthesis
• P(l)aying for synchronization
• Information reuse for multi-goal reachability analyses
• Strategy logic
• Formalization of test experiments
• Testing probabilistic equivalence through reinforcement learning
• Synthesizing adaptive test strategies from temporal logic specifications

Uses Software

• Spec#
• UniTESK
• TorX
• AsmL
• SpecExplorer
• AGEDIS

This page was built for publication: Play to Test

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