Byron Cook

New papers on liveness proving

Making prophecies with decision predicates shows how LTL can be lazily reduced to CTL with some help of automatically inferred "prophecy variables".

Temporal property verification as a program analysis problem shows how known tools can be used to prove CTL properties of infinite state programs
at Saturday, June 04, 2011
Newer Posts Older Posts Home
Subscribe to: Posts (Atom)

Byron Cook

View my complete profile

Blog Archive

  • ►  2012 (3)
    • ►  April (2)
    • ►  February (1)
  • ▼  2011 (1)
    • ▼  June (1)
      • New papers on liveness proving
  • ►  2010 (3)
    • ►  November (2)
    • ►  September (1)
  • ►  2009 (7)
    • ►  October (1)
    • ►  August (1)
    • ►  June (2)
    • ►  April (1)
    • ►  March (1)
    • ►  January (1)
  • ►  2008 (31)
    • ►  December (2)
    • ►  November (1)
    • ►  October (3)
    • ►  August (3)
    • ►  July (3)
    • ►  June (2)
    • ►  May (4)
    • ►  April (5)
    • ►  March (4)
    • ►  January (4)
  • ►  2007 (12)
    • ►  December (7)
    • ►  November (5)

Links

  • Byron at work
  • TERMINATOR project
  • SLAyer project
  • SLAM project
  • SDV product
  • East London Massive
Simple theme. Powered by Blogger.