Sökning: "Random Testing"
Visar resultat 1 - 5 av 121 avhandlingar innehållade orden Random Testing.
1. Testing for ASP—ASP for Testing
Sammanfattning : Answer-set programming (ASP) is a prominent approach for declarative problem solving with roots in non-monotonic reasoning, knowledge representation, and logic programming. As a problem solving paradigm, it means that properties of problem solutions are modelled using declarative rules so that an ASP solver can then be used to search for solutions which are referred to as answer sets. LÄS MER
2. Testing an Optimising Compiler by Generating Random Lambda Terms
Sammanfattning : This thesis tries to improve on the relatively uncommon practice of random testing of compilers.Random testing of compilers is difficult and not widespread for two reasons. First, it is hard to come up with a generator of valid test data for compilers, that is a generator of programs. LÄS MER
3. Model-Based Protocol Testing in an Erlang Environment
Sammanfattning : Testing is the dominant technique for quality assurance of software systems. It typically consumes considerable resources in development projects, and is often performed in an ad hoc manner. This thesis is concerned with model-based testing, which is an approach to make testing more systematic and more automated. LÄS MER
4. Targeted Property-Based Testing with Applications in Sensor Networks
Sammanfattning : Testing is a fundamental part of modern software development, as it unveils bugs in the system under test and gives confidence in their correctness. Testing is often a laborious task as it typically requires to write by hand a plethora of test cases to test a system thoroughly. LÄS MER
5. On Degree Variance in Random Graphs
Sammanfattning : This thesis is concerned with degree moments and degree variance in random graphs. The degree of vertex i in a graph is the number of edges incident to vertex i.In the first paper, degree moments and functions of degree moments are investigated for three random graph models. LÄS MER