TAP 2019: 13TH INTERNATIONAL CONFERENCE ON TESTS AND PROOFS

This page contains an index consisting of author-provided keywords.

A
Abstract Interpretation	Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods
active inference	Learning Communicating State Machines
adaptive testing	Learning Communicating State Machines
Automatic stub generation	Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods
B
B Method	BTestBox - A Tool for Testing B Translators and Coverage of B Models
Bounded Model Checking	Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods
C
Code coverage	BTestBox - A Tool for Testing B Translators and Coverage of B Models
communicating FSMs	Learning Communicating State Machines
component-based systems	Learning Communicating State Machines
Concolic test generation	Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods
conformance testing	Learning Communicating State Machines
Constraint Logic Programming	Property-Based Test-Case Generators for Free
constraint solving	Constraints in Dynamic Symbolic Execution: Bitvectors or Integers?
D
deductive verification	Tame Your Annotations with MetAcsl: Specifying, Testing, and Proving High-Level Properties
dynamic verification	Tame Your Annotations with MetAcsl: Specifying, Testing, and Proving High-Level Properties
E
EMQ	Predicting and Testing Latencies with Deep Learning: An IoT Case Study
Erlang	Property-Based Test-Case Generators for Free
F
Formal verification	Proving a Non-Blocking Algorithm for Process Renaming with TLA+
Frama-C	Tame Your Annotations with MetAcsl: Specifying, Testing, and Proving High-Level Properties
FSM learning	Learning Communicating State Machines
G
Genetic algorithms	Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods
I
IMITATOR	Repairing Timed-Automata Clock Guards through Abstraction and Testing
Internet of things	Predicting and Testing Latencies with Deep Learning: An IoT Case Study
L
latency	Predicting and Testing Latencies with Deep Learning: An IoT Case Study
M
meta-properties	Tame Your Annotations with MetAcsl: Specifying, Testing, and Proving High-Level Properties
model-based testing	BTestBox - A Tool for Testing B Translators and Coverage of B Models Coverage-Based Testing with Symbolic Transition Systems Predicting and Testing Latencies with Deep Learning: An IoT Case Study
MQTT	Predicting and Testing Latencies with Deep Learning: An IoT Case Study
N
neural networks	Predicting and Testing Latencies with Deep Learning: An IoT Case Study
Non-blocking algorithm	Proving a Non-Blocking Algorithm for Process Renaming with TLA+
P
parametric timed automata	Repairing Timed-Automata Clock Guards through Abstraction and Testing
performance	Predicting and Testing Latencies with Deep Learning: An IoT Case Study
program testing	Constraints in Dynamic Symbolic Execution: Bitvectors or Integers?
Property-Based Testing	Property-Based Test-Case Generators for Free
R
repair	Repairing Timed-Automata Clock Guards through Abstraction and Testing
S
SAT solving	Learning Communicating State Machines
software testing	Repairing Timed-Automata Clock Guards through Abstraction and Testing
specification	Tame Your Annotations with MetAcsl: Specifying, Testing, and Proving High-Level Properties
statistical model checking	Predicting and Testing Latencies with Deep Learning: An IoT Case Study
Structural unit test	Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods
symbolic execution	Constraints in Dynamic Symbolic Execution: Bitvectors or Integers? Coverage-Based Testing with Symbolic Transition Systems
symbolic transition systems	Coverage-Based Testing with Symbolic Transition Systems
T
test purpose	Coverage-Based Testing with Symbolic Transition Systems
testing in context	Learning Communicating State Machines
timed automata	Repairing Timed-Automata Clock Guards through Abstraction and Testing
TLA+	Proving a Non-Blocking Algorithm for Process Renaming with TLA+

Disclaimer | Powered by EasyChair Smart Program