unix and linux operating commands

Bell-LaPadula model - original papers


 
Thread Tools Search this Thread
# 1  
Old 12-18-2008
Bell-LaPadula model - original papers

Going back, well, almost to the beginning:

A reconstruction of the first part of the famous Bell-LaPadula (BLP) model.  Note that this is a formal mathematical model, using symbolic logic.  Not the first formal model of security, nor even the first state machine model, but one of the most useful in the early days.

The second part of the famous Bell-LaPadula model is available here.

So, now you know.

Possibly easier to follow, a review of the Bell-LaPadula model, thirty years later, by David Bell.

Image
Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread

8 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

How to ring the system bell many times without pause?

I am writing a ksh script in cygwin though it could just as easily be bash and am trying to make an alert for myself where the bell rings many times like print '\a'or echo '^G'except I want it to ping me many times not just once. For some reason doing print '\a\a\a\a\a\a\a\a\a\a'or similar... (7 Replies)
Discussion started by: benalt
7 Replies

2. Solaris

System hangs (freezes) on system bell/beep

I am running OpenIndiana development version oi_148 32-bit on a seven-year-old Dell Inspiron 8600. Seems to be running fine except for one particular annoyance: It freezes whenever a system bell/beep plays. I have mitigated this by turning the system bell off in gnome-terminal, which I use... (3 Replies)
Discussion started by: DeadBadger
3 Replies

3. UNIX for Dummies Questions & Answers

Unix logo(Original).

Hi, What is the Unix's logo(Original)? Thanks, regards. (0 Replies)
Discussion started by: Y.P.Y
0 Replies

4. What is on Your Mind?

UNIX Admin (Papers and study material)

Hi, I want to prepare and then appear for Unix admin certification. Please guide me for the study material and Exams that are required to be taken for UNIX certifcation. Thanks in advance. (11 Replies)
Discussion started by: raman1605
11 Replies

5. Shell Programming and Scripting

Why the cp keeps the original ownership?

I want to copy a file from another user to my owner directory, and want to change the ownership to my account. in jung's directory: -rwxr-xr-x 1 jung smart 23 Dec 1 2005 .runme cp /home/jung/runme . under my directory: -rwxr-xr-x 1 jung smart 23 Dec 1... (1 Reply)
Discussion started by: freelong
1 Replies

6. UNIX for Dummies Questions & Answers

RHCE Exam Sample Papers

Hi All, Does anyone have RHCE Exam Sample or Practice Papers ?? I am planning to give it asap. Pls help. Thanks n Regards, Vikas (1 Reply)
Discussion started by: vikas027
1 Replies

7. UNIX for Dummies Questions & Answers

SuSE install on a Packard Bell m415

hi everybody, I just installed Suse on an old Packard Bell. When the install was at detecting my moden, it hung. I couldn't free it sooooo, I pressed ctrl+alt+backspace. Yup that killed the process alright. The machine went right down and upon reboot it is now at the KDE welcome page. Here... (2 Replies)
Discussion started by: joetech
2 Replies

8. UNIX for Dummies Questions & Answers

Original Path

I've got one I haven't been able to figure out. 1. A shell script exists- /junk/junk1/junk2/junk3.sh 2. From within the above named shell script, I want to know the full path of the above named shell script. Even if I execute the shell script from a directory other than the one it resides in,... (5 Replies)
Discussion started by: therealtiger
5 Replies
Login or Register to Ask a Question
ANLDP(1)						      General Commands Manual							  ANLDP(1)

NAME
anldp - implementation of Davis-Putnam propositional satisfiability procedure SYNOPSIS
anldp [options] < input-file > output-file DESCRIPTION
This manual page documents briefly the anldp command. anldp is an implementation of a Davis-Putnam procedure for the propositional satisfiability problem. anldp exposes the procedure used by mace2(1) to determine satisfiability. anldp can also take statements in first-order logic with equality and a domain size n then search for models of size n. The first-order model-searching code transforms the statements into set of propositional clauses such that the first- order statements have a model of size n if and only if the propositional clauses are satisfiable. The propositional set is then given to the Davis-Putnam code; any propositional models that are found can be translated to models of the first-order statements. The first-order model-searching program accepts statements only in a flattened relational clause form without function symbols. OPTIONS
-s Perform subsumption. (Subsumption is always performed during unit preprocessing.) -p Print models as they are found. -m n Stop when the nth model is found. -t n Stop after n seconds. -k n Allocate at most n kbytes for storage of clauses. -x n Quasigroup experiment n. -B file Backup assignments to a file. -b n Backup assignments every n seconds. -R file Restore assignments from a file. The file typically contains just the last line of a backup file. Other input, in particular the clauses, must be given exactly as in the original search. -n n This option is used for first-order model searches. The parameter n specifies the domain size, and its presence tells the program to read first-order flattened relational input clauses instead of propositional clauses. SEE ALSO
formed(1), mace2(1), otter(1). Full documentation for anldp is found in /usr/share/doc/mace2/anldp.{html,ps.gz}. AUTHOR
anldp ws written by William McCune <otter@mcs.anl.gov> This manual page was written by Peter Collingbourne <pcc03@doc.ic.ac.uk>, for the Debian project (but may be used by others). November 5, 2006 ANLDP(1)