andr3/scyther
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

- Fixed a newly introduced bug. When the decryptor sequence unfolding

Browse Source 
code was added (two weeks ago), bindings were changed without changing
  the state of the graph closure buffer. This resulted in possible
  missed loops: thus, reports of broken claims could be found in the
  output, in inconsistent states. (Reported bij Gijs Hollestelle.)
  Note that this only influences the current development release, and
  not any previous results.
This commit is contained in:
ccremers 2005-06-08 13:51:40 +00:00
parent 1bdaf7b5d9
commit 013afc99aa
1 changed files with 15 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
src/binding.c
View File

@ -716,28 +716,25 @@ bindings_c_minimal ()
{
List bl;
// Ensure a state graph
if (graph == NULL)
// Ensure a fresh state graph
goal_graph_create ();
// Recompute closure; does that work?
if (!warshall (graph, nodes))
{
goal_graph_create ();
// Recompute closure; does that work?
if (!warshall (graph, nodes))
List l;
globalError++;
l = sys->bindings;
while (l != NULL)
{
List l;
Binding b;
globalError++;
l = sys->bindings;
while (l != NULL)
{
Binding b;
b = (Binding) l->data;
binding_print (b);
eprintf ("\n");
l = l->next;
}
error ("Detected a cycle when testing for c-minimality");
b = (Binding) l->data;
binding_print (b);
eprintf ("\n");
l = l->next;
}
error ("Detected a cycle when testing for c-minimality");
}
// For all goals