<--- Back to Details
First PageDocument Content
Metaphysics / Data types / Search algorithms / Mathematics / Model checking / Tree / Information science / Abstraction / B-tree / Breadth-first search / Reachability / FO
Date: 2018-06-25 09:59:57
Metaphysics
Data types
Search algorithms
Mathematics
Model checking
Tree
Information science
Abstraction
B-tree
Breadth-first search
Reachability
FO

Subsumer-First: Steering Symbolic Reachability Analysis Andrey Rybalchenko1 and Rishabh Singh2 1 Max Planck Institute for Software Systems (MPI-SWS)

Add to Reading List

Source URL: rishabhmit.bitbucket.io

Download Document from Source Website

File Size: 152,75 KB

Share Document on Facebook

Similar Documents

Overview  Abstraction The Rest

Overview Abstraction The Rest

DocID: 1xW1V - View Document

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

DocID: 1xVQq - View Document

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

DocID: 1xVJt - View Document

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

DocID: 1xVFk - View Document