ComFoRT

ComFoRT Reasoning Framework The Component Formal Reasoning Technology (ComFoRT) is a reasoning framework for predicting whether a system will satisfy its safety, reliability, and security requirements. In ComFoRT, these requirements are encoded as behavioral assertions that are verified automatically.


References in zbMATH (referenced in 11 articles )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Braghin, Chiara; Sharygina, Natasha; Barone-Adesi, Katerina: A model checking-based approach for security policy verification of mobile systems (2011)
  2. Chaki, Sagar; Clarke, Edmund; Sharygina, Natasha; Sinha, Nishant: Verification of evolving software via component substitutability analysis (2008)
  3. Chaki, Sagar; Strichman, Ofer: Three optimizations for assume-guarantee reasoning with $L^*$ (2008)
  4. Chaki, S.; Clarke, E.; Kidd, N.; Reps, T.; Touili, T.: Verifying concurrent message-passing C programs with recursive calls (2006)
  5. Stokely, Murray; Chaki, Sagar; Ouaknine, Joël: Parallel assignments in software model checking (2006)
  6. Stokely, Murray; Chaki, Sagar; Ouaknine, Joël: Parallel assignments in software model checking. (2006)
  7. Chaki, Sagar; Clarke, Edmund; Grumberg, Orna; Ouaknine, Joël; Sharygina, Natasha; Touili, Tayssir; Veith, Helmut: State/event software verification for branching-time specifications (2005)
  8. Chaki, Sagar; Clarke, Edmund; Sinha, Nishant; Thati, Prasanna: Automated assume-guarantee reasoning for simulation conformance (2005)
  9. Chaki, Sagar; Ivers, James; Sharygina, Natasha; Wallnau, Kurt: The ComFoRT reasoning framework (2005)
  10. Clarke, Edmund; Kroening, Daniel; Sharygina, Natasha; Yorav, Karen: SATABS: SAT-based predicate abstraction for ANSI-C (2005)
  11. Cook, Byron; Kroening, Daniel; Sharygina, Natasha: Cogent: Accurate theorem proving for program verification (2005)