scyther/src/arachne.c

386 lines
7.3 KiB
C
Raw Normal View History

2004-08-11 10:51:17 +01:00
/**
*@file arachne.c
*
* Introduces a method for proofs akin to the Athena modelchecker
* http://www.ece.cmu.edu/~dawnsong/athena/
*
*/
2004-08-11 13:08:10 +01:00
#include "term.h"
#include "termlist.h"
2004-08-11 13:08:10 +01:00
#include "role.h"
2004-08-11 10:51:17 +01:00
#include "system.h"
#include "states.h"
#include "mgu.h"
2004-08-11 10:51:17 +01:00
#include "arachne.h"
static System sys;
static Protocol INTRUDER; // Pointers, to be set by the Init
static Role I_GOAL; // Same here.
2004-08-11 13:08:10 +01:00
struct goalstruct
{
int run;
int index;
Roledef rd;
2004-08-11 13:08:10 +01:00
};
typedef struct goalstruct Goal;
/**
* Forward declarations
*/
int iterate ();
/**
* Program code
*/
//! Init Arachne engine
void
arachneInit (const System mysys)
{
sys = mysys; // make sys available for this module as a global
/*
* Add intruder protocol roles
*/
return;
}
//! Close Arachne engine
void
arachneDone ()
{
return;
}
2004-08-11 13:08:10 +01:00
//------------------------------------------------------------------------
// Detail
//------------------------------------------------------------------------
/*
* runs[rid].step is now the number of 'valid' events within the run, but we
* call it 'length' here.
*/
#define INVALID -1
#define isGoal(rd) (rd->type == READ && !rd->internal)
2004-08-11 13:08:10 +01:00
#define isBound(rd) (rd->bind_run != INVALID)
#define length step
//! Iterate but discard the info of the termlist
int
mgu_iterate (const Termlist tl)
{
return iterate ();
}
2004-08-11 16:05:13 +01:00
//! Yield roledef pointer for a given index
Roledef roledef_shift (Roledef rd, int i)
{
while (i > 0 && rd != NULL)
{
rd = rd->next;
i--;
}
return rd;
}
2004-08-11 13:08:10 +01:00
//------------------------------------------------------------------------
// Sub
//------------------------------------------------------------------------
//! Iterate over all send types in the roles (including the intruder ones)
/**
* Function is called with (protocol pointer, role pointer, roledef pointer, index)
* and returns an integer. If it is false, iteration aborts.
*/
int
iterate_role_sends (int (*func) ())
{
Protocol p;
p = sys->protocols;
while (p != NULL)
{
Role r;
r = p->roles;
while (r != NULL)
{
Roledef rd;
int index;
rd = r->roledef;
index = 0;
while (rd != NULL)
{
if (rd->type == SEND)
{
int flag;
flag = func (p, r, rd, index);
if (!flag)
return 0;
}
index++;
rd = rd->next;
}
r = r->next;
}
p = p->next;
}
return 1;
}
//! Generates a new intruder goal, yields runid
int
add_intruder_goal (Term t)
{
roleInstance (sys, INTRUDER, I_GOAL, NULL);
return (sys->maxruns - 1);
}
2004-08-11 13:08:10 +01:00
//------------------------------------------------------------------------
// Larger logical componentents
//------------------------------------------------------------------------
//! Goal selection
/**
* Should be ordered to prefer most constrained; for now, it is simply the first one encountered.
*/
Goal
select_goal ()
2004-08-11 13:08:10 +01:00
{
Goal goal;
int run;
goal.run = INVALID;
goal.rd = NULL;
2004-08-11 13:08:10 +01:00
for (run = 0; run < sys->maxruns; run++)
{
Roledef rd;
int index;
index = 0;
rd = sys->runs[run].start;
2004-08-11 13:08:10 +01:00
while (rd != NULL && index < sys->runs[run].length)
{
if (isGoal (rd) && !isBound (rd))
{
// Return this goal
goal.run = run;
goal.index = index;
goal.rd = rd;
2004-08-11 13:08:10 +01:00
return goal;
}
index++;
rd = rd->next;
}
}
return goal;
}
//! Bind a goal to an existing regular run, if possible
int
bind_existing_run (const Goal goal, const Protocol p, const Role r,
const int index)
{
int run, flag;
flag = 1;
for (run = 0; run < sys->maxruns; run++)
{
if (sys->runs[run].protocol == p && sys->runs[run].role == r)
{
int i;
int old_length;
Roledef rd;
// find roledef entry
rd = sys->runs[run].start;
for (i = 0; i < index; i++)
rd = rd->next;
// mgu and iterate
old_length = sys->runs[run].length;
if (index >= old_length)
sys->runs[run].length = index + 1;
flag =
flag & termMguInTerm (goal.rd->message, rd->message, mgu_iterate);
sys->runs[run].length = old_length;
}
}
return flag;
}
//! Bind a goal to a new run
int
bind_new_run (const Goal goal, const Protocol p, const Role r,
const int index)
{
2004-08-11 16:05:13 +01:00
int run;
int flag;
Roledef rd;
roleInstance (sys, p, r, NULL);
run = sys->maxruns-1;
sys->runs[run].length = index+1;
goal.rd->bind_run = run;
goal.rd->bind_index = index;
rd = roledef_shift (sys->runs[run].start, index);
// Possibly double recursion (overkill) because of interm construct. Find a way to maintain this over instances/
/**
*@todo We should have the roleInstance carry over any instantiated vars from the roledef, and then undo the instatiations on the original.
* Then this could simply iterate, which is much better.
*/
flag = termMguInTerm (goal.rd->message, rd->message, mgu_iterate);
goal.rd->bind_run = INVALID;
roleInstanceDestroy (sys);
return flag;
}
2004-08-11 13:08:10 +01:00
//! Bind a regular goal
int
bind_goal_regular (const Goal goal)
2004-08-11 13:08:10 +01:00
{
int flag;
/*
* This is a local function so we have access to goal
*/
int bind_this (Protocol p, Role r, Roledef rd, int index)
{
int element_f1 (Termlist substlist)
{
/**
* Two options; as this, it is from an existing run,
* or from a new one.
*/
int flag;
termlistSubstReset (substlist); // undo, we don't really need that
flag = bind_existing_run (goal, p, r, index);
if (flag)
{
flag = bind_new_run (goal, p, r, index);
}
return flag;
}
// Test for interm unification
return termMguInTerm (goal.rd->message, rd->message, element_f1);
}
// Bind to all possible sends?
flag = iterate_role_sends (bind_this);
// Bind to an intruder node?
if (flag)
{
int run;
goal.rd->bind_run = add_intruder_goal (goal.rd->message); // creates a new run
goal.rd->bind_index = 0; // such a run only has a simple read;
flag = iterate ();
roleInstanceDestroy (sys); // destroy the created run
goal.rd->bind_run = INVALID;
}
return flag;
2004-08-11 13:08:10 +01:00
}
//! Bind an intruder goal
int
bind_goal_intruder (const Goal goal)
2004-08-11 13:08:10 +01:00
{
//!@todo Fix intruder goal stuff
2004-08-11 13:08:10 +01:00
}
//! Bind a goal in all possible ways
int
bind_goal (const Goal goal)
2004-08-11 13:08:10 +01:00
{
if (sys->runs[goal.run].protocol == INTRUDER)
2004-08-11 13:08:10 +01:00
{
return bind_goal_intruder (goal);
2004-08-11 13:08:10 +01:00
}
else
{
return bind_goal_regular (goal);
2004-08-11 13:08:10 +01:00
}
}
//! Prune determination
/**
*@returns true iff this state is invalid for some reason
*/
int
prune ()
{
return 0;
}
2004-08-11 13:08:10 +01:00
//------------------------------------------------------------------------
// Main logic core
//------------------------------------------------------------------------
2004-08-11 10:51:17 +01:00
//! Main recursive procedure for Arachne
int
iterate ()
{
2004-08-11 13:08:10 +01:00
Goal goal;
/**
* Possibly prune this state
*/
if (prune ())
return 0;
/**
* Not pruned: count
*/
sys->states = statesIncrease (sys->states);
/**
* Check whether its a final state (i.e. all goals bound)
*/
2004-08-11 13:08:10 +01:00
goal = select_goal ();
2004-08-11 13:08:10 +01:00
if (goal.run == INVALID)
{
/*
* all goals bound, check for property
*/
return 1;
}
else
{
/*
* bind this goal in all possible ways and iterate
*/
return bind_goal (goal);
2004-08-11 13:08:10 +01:00
}
}
//! Main code for Arachne
/**
* For this test, we manually set up some stuff.
*/
int
arachne ()
2004-08-11 10:51:17 +01:00
{
/*
* set up claim role(s)
*/
/*
* iterate
*/
iterate ();
2004-08-11 10:51:17 +01:00
}