Tests and proofs for custom data generators

We address automated testing and interactive proving of properties involving complex data structures with constraints, like the ones studied in enumerative combinatorics, e.g., permutations and maps. In this paper we show testing techniques to check properties of custom data generators for these str...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Formal aspects of computing Ročník 30; číslo 6; s. 659 - 684
Hlavní autoři:	Dubois, Catherine, Giorgetti, Alain
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	London Springer London 01.11.2018 Association for Computing Machinery Springer Verlag
Témata:	Combinatorial analysis Combinatorics Computer Science Cryptography and Security Data structures Debugging Distributed, Parallel, and Cluster Computing Emerging Technologies Generators Logic programming Math Applications in Computer Science Modeling and Simulation Multiagent Systems Original Article Permutations Properties (attributes) Software Engineering Theory of Computation Ubiquitous Computing Random testing Bounded-exhaustive testing Permutations Logic programming Combinatorial enumeration Interactive theorem proving Rooted maps nteractive theorem proving rooted maps bounded-exhaustive testing logic programming combinatorial enumeration permutations random testing
ISSN:	0934-5043, 1433-299X
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!