Freigeben über


SecPAL v1.1 Now Available

Just a quick note to let everyone know that we have just released a minor update to our SecPAL library. In addition to a couple of minor bug fixes there are two features which I think you are really going to like. The first is an update to our grammar - making it much clearer what conditions and constraints are. The second (which was actually a bug fix) is that our graphical proof graphs now work.

The diagram below shows an example of a (very simple) proof graph which graphically demonstrates the chain of deducations supporting an authorization decision. This is of course very valuable information for your audit logs to support requirements such as compliance etc.

Graphical Proof Graph

Anyway, you might find the following links interesting:

I have also been working on a couple of F# samples to demonstrate how to call SecPAL from F#, which I will post those in the next day or two. These will also include examples of the new grammar etc.

Enjoy!

Comments

  • Anonymous
    June 13, 2007
    Just got a note from Jason that SecPAL 1.1 is available - this is great - take a look at the codeplex

  • Anonymous
    June 13, 2007
    Just got a note from Jason that SecPAL 1.1 is available - this is great - take a look at the codeplex