You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

Jules Villard 363d69430d [ai][pulse] use subgraph-based implication between states ... Summary: When joining two lists of disjuncts we try to ensure there isn't a state that under-approximates another already in the list. This helps reduce the number of disjuncts that are generated by conditionals and loops. Before we would always just add more disjuncts unless they were physically equal but now we do a subgraph computation to assess under-approximation. We only do this half-heartedly for now however, only taking into consideration the "new" disjuncts vs the "old" ones. It probably makes sense to do a full quadratic search to minimise the number of disjuncts from time to time but this isn't done here. Reviewed By: mbouaziz Differential Revision: D14258482 fbshipit-source-id: c2dad4889		6 years ago
..
Makefile	[pulse] copy tests from ownership	6 years ago
basics.cpp	[pulse] do not destroy `this` even if asked to	6 years ago
closures.cpp	[pulse] model lambda captures	6 years ago
issues.exp	[ai][pulse] use subgraph-based implication between states	6 years ago
join.cpp	[ai][pulse] use subgraph-based implication between states	6 years ago
reference_wrapper.cpp	[pulse] copy tests from ownership	6 years ago
returns.cpp	[pulse] warn on returning address of C++ temporary	6 years ago
temporaries.cpp	[pulse] Example of use after destructor for temporaries	6 years ago
use_after_delete.cpp	[pulse] model some early exit functions	6 years ago
use_after_destructor.cpp	[pulse] rewrite test to avoid stack variable address escape	6 years ago
use_after_free.cpp	[pulse] record simple double free test	6 years ago
vector.cpp	[pulse] collect garbage (unreachable) heap parts from time to time	6 years ago