Thesis icon

Thesis

Abstraction discovery and refinement for model checking by symbolic trajectory evaluation

Abstract:

This dissertation documents two contributions to automating the formal verification of hardware – particularly memory-intensive circuits – by Symbolic Trajectory Evaluation (STE), a model checking technique based on symbolic simulation over abstract sets of states. The contributions focus on improvements to the use of BDD-based STE, which uses binary decision diagrams internally.

We introduce a solution to one of the major hurdles in using STE: finding suitable abstractions. Our wor...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Research group:
Automated Verification
Oxford college:
Exeter College
Role:
Author

Contributors

Division:
MPLS
Department:
Computer Science
Role:
Supervisor



Publication date:
2014
DOI:
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford


Language:
English
Keywords:
Subjects:
UUID:
uuid:27276f9c-eba5-42a9-985d-1812097773f8
Local pid:
ora:8877
Deposit date:
2014-08-11

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP