You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We have been discussing the possibility of acquiring more succinct representations of the IPC benchmarks by re-using FD's powerful invariant inference components. The basic idea is that for every mutex groupM that FD uncovers (set of ground predicates), we define automatically the tuple < f_{M}, t_{M}, M> where f_{M} is a function, t_{M} is a type, and M become a set of constant objects of type t_{M}.
TODO
[ ] Work out the TODO list
The text was updated successfully, but these errors were encountered:
BTW, this would be really interesting and match perfectly with the other work we've been discussing on width-based algorithms, which I'm starting to work on right now....
We have been discussing the possibility of acquiring more succinct representations of the IPC benchmarks by re-using FD's powerful invariant inference components. The basic idea is that for every mutex group M that FD uncovers (set of ground predicates), we define automatically the tuple < f_{M}, t_{M}, M> where f_{M} is a function, t_{M} is a type, and M become a set of constant objects of type t_{M}.
TODO
[ ] Work out the TODO list
The text was updated successfully, but these errors were encountered: