Date: 2015-04-10 18:09:41

Formal methods

Logic in computer science

Electronic design automation

NP-complete problems

Model checking

Java Pathfinder

Satisfiability Modulo Theories

Concolic testing

KeY

Theoretical computer science

Applied mathematics

Mathematics

Concurrent Bounded Model Checking Quoc-Sang Phan Pasquale Malacaria ˘ areanu

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 277,32 KB