CS4052 Logic and Software Verification Flashcards

Decks in this Class (17):

• Lectures 0 To 2 17th September 2019

  Lectures 0 to 2 - 17th September 2019

  Sample Cards:

  what is logic verification,

  what is software verification,

  what are formal methods
  50 Cards
  Preview Flashcards
• Lectures 3 And 4 24th September 2019

  Lectures 3 and 4 - 24th September 2019

  Sample Cards:

  what do atomic code blocks do in promela,

  what are the properties of communication,

  how do you open and use communication ch
  26 Cards
  Preview Flashcards
• Tutorial 0 25th September 2019

  Tutorial 0 - 25th September 2019

  Sample Cards:

  can active processes run more than once,

  can processes interfere in changing the
  2 Cards
  Preview Flashcards
• Lectures 5 And 6 1st October 2019

  Lectures 5 and 6 - 1st October 2019

  Sample Cards:

  why do liveness properties require more,

  why can safety properties mostly be writ,

  what are never claims in spin promela
  37 Cards
  Preview Flashcards
• Tutorial 1 9th October 2019

  Tutorial 1: 9th October 2019

  Sample Cards:

  how can you represent if not p then p is,

  how can you check an eventually property,

  how can you check the value of a variabl
  14 Cards
  Preview Flashcards
• Lectures 7 And 8 15th October 2019

  Lectures 7 and 8: 15th October 2019

  Sample Cards:

  what does spin use as its underlying mod,

  how can tses be modelled as graphs,

  what are action names
  50 Cards
  Preview Flashcards
• Lectures 9 And 10 29th October 2019

  Lectures 9 and 10: 29th October 2019

  Sample Cards:

  what is eval var,

  how are tses defined,

  how are pgs defiend
  47 Cards
  Preview Flashcards
• Lectures 10 And 11 5th November 2019

  Lectures 10 and 11: 5th November 2019

  Sample Cards:

  what is a ts,

  what is a pg,

  what is an arbtier
  74 Cards
  Preview Flashcards
• Tutorial 2 6th November 2019

  Tutorial 2: 6th November 2019

  Sample Cards:

  how do you represent processes as progra,

  how do you combine two program graphs in,

  how do you find the reachable parts of a
  7 Cards
  Preview Flashcards
• Lectures 12 And 13 12th November 2019

  Lectures 12 and 13: 12th November 2019
  0 Cards
  Preview Flashcards
• Lectures 14 And 15 19th November 2019

  Lectures 14 and 15: 19th November 2019

  Sample Cards:

  what is a ta,

  what is a pn,

  how do tas work
  50 Cards
  Preview Flashcards
• Tutorial 3 20th November 2019

  Tutorial 3: 20th November 2019

  Sample Cards:

  how can you set the minimum and maximum,

  how can you formulate cant rest properti,

  how can you formulate deadlock propertie
  5 Cards
  Preview Flashcards
• Tutorial 4 27th November 2019

  Tutorial 4: 27th November 2019

  Sample Cards:

  how can you make a petri net to model a,

  how can you make a petri net to model mu,

  how do you find the reachability graph o
  10 Cards
  Preview Flashcards
• Exam Question 1

  Exam: Question 1

  Sample Cards:

  how do you convert a pseudocode process,

  how do you convert a program graph into,

  how do you convert a pseudocode process
  50 Cards
  Preview Flashcards
• Exam Question 2

  Exam: Question 2

  Sample Cards:

  how do you specify real world systems in,

  how do you specify real world systems in,

  how do you show whether a promela system
  52 Cards
  Preview Flashcards
• Exam Question 3

  Exam: Question 3

  Sample Cards:

  what is a ta,

  how does a ta work,

  what is ctl
  67 Cards
  Preview Flashcards
• Exam Question 4

  Exam: Question 4

  Sample Cards:

  what is a petri net,

  how do you give petri nets that generate,

  how do you make a petri net to model an
  52 Cards
  Preview Flashcards