Formal, Informal, and Null Methods (ResearchIndex)

See this document in CiteSeerX!

Formal, Informal, and Null Methods (1997) (Make Corrections)
Martín Abadi

Rate this article:

(Enter summary)
Abstract: be desirable to break the verifier into two parts: (1) a part that guesses or constructs an invariant candidate, by whatever means; (2) a part that checks that this candidate is in fact an invariant. Only the latter part would be in the TCB; it would be considerably smaller and simpler than the whole. (Raymie Stata and I have started to explore this idea.) ffl Other examples are in the area of security protocols. These protocols often include many options and variants, which may be regarded... (Update)

Active bibliography (related documents): More All
0.2: Security Protocols and their Properties - Abadi (2000) (Correct)
0.2: Security Protocols and Specifications - Abadi (1999) (Correct)
0.1: Secrecy by Typing in Security Protocols - Abadi (1998) (Correct)

Similar documents based on text: More All
0.1: Data Mart: Next step in data storage - Liu (Correct)
0.1: Smart Multi-Array Routing Table - Hariguchi (2001) (Correct)
0.1: Tutorial: Getting Started with MART in Splus - Friedman (1999) (Correct)

BibTeX entry: (Update)

@misc{ abadi-formal,
  author = "Martín Abadi",
  title = "Formal, Informal, and Null Methods",
  url = "citeseer.ist.psu.edu/abadi97formal.html" }