Pex–White Box Test Generation for .NET. Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution, similar to path-bounded model-checking) to determine test inputs for Parameterized Unit Tests. Pex learns the program behavior by monitoring execution traces. Pex uses a constraint solver to produce new test inputs which exercise different program behavior. The result is an automatically generated small test suite which often achieves high code coverage. In one case study, we applied Pex to a core component of the .NET runtime which had already been extensively tested over several years. Pex found errors, including a serious issue.

References in zbMATH (referenced in 22 articles )

Showing results 1 to 20 of 22.
Sorted by year (citations)

1 2 next

  1. Cavalcanti, Ana; Gaudel, Marie-Claude: Test selection for traces refinement (2015)
  2. Xie, Tao; Zhang, Lu; Xiao, Xusheng; Xiong, Ying-Fei; Hao, Dan: Cooperative software testing and analysis: advances and challenges (2014)
  3. Brucker, Achim D.; Wolff, Burkhart: On theorem prover-based testing (2013)
  4. Amato, Gianluca; Parton, Maurizio; Scozzari, Francesca: Discovering invariants via simple component analysis (2012)
  5. Carlier, Matthieu; Dubois, Catherine; Gotlieb, Arnaud: A first step in the design of a formally verified constraint-based testing tool: FocalTest (2012)
  6. Christakis, Maria; Müller, Peter; Wüstholz, Valentin: Collaborative verification and testing with explicit assumptions (2012)
  7. Janičić, Predrag: URSA: a system for uniform reduction to SAT (2012)
  8. Kosmatov, Nikolai; Williams, Nicky; Botella, Bernard; Roger, Muriel; Chebaro, Omar: A lesson on structural testing with (2012)
  9. Vanoverberghe, Dries; de Halleux, Jonathan; Tillmann, Nikolai; Piessens, Frank: State coverage: Software validation metrics beyond code coverage (2012)
  10. Yang, Guowei; Khurshid, Sarfraz; Kim, Miryung: Specification-based test repair using a lightweight formal method (2012)
  11. Fähndrich, Manuel; Logozzo, Francesco: Static contract checking with abstract interpretation (2011)
  12. Giannakopoulou, Dimitra; Bushnell, David H.; Schumann, Johann; Erzberger, Heinz; Heere, Karen: Formal testing for separation assurance (2011)
  13. Hooimeijer, Pieter; Veanes, Margus: An evaluation of automata algorithms for string analysis (2011)
  14. Obdržálek, Jan; Trtík, Marek: Efficient loop navigation for symbolic execution (2011)
  15. Tschannen, Julian; Furia, Carlo A.; Nordio, Martin; Meyer, Bertrand: Usable verification of object-oriented programs by combining static and dynamic techniques (2011)
  16. Alshraideh, Mohammad; Bottaci, Leonardo; Mahafzah, Basel A.: Using program data-state scarcity to guide automatic test data generation (2010)
  17. Angeletti, Damiano; Giunchiglia, Enrico; Narizzano, Massimo; Puddu, Alessandra; Sabina, Salvatore: Using bounded model checking for coverage analysis of safety-critical software in an industrial setting (2010)
  18. Bubel, Richard; Hähnle, Reiner; Ji, Ran: Interleaving symbolic execution and partial evaluation (2010)
  19. Gómez-Zamalloa, Miguel; Albert, Elvira; Puebla, Germán: Test case generation for object-oriented imperative languages in CLP (2010)
  20. Bjørner, Nikolaj; Tillmann, Nikolai; Voronkov, Andrei: Path feasibility analysis for string-manipulating programs (2009)

1 2 next