LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
sav08:guru [2008/05/10 13:56]
vkuncak
sav08:guru [2008/05/10 19:49]
vkuncak
Line 16: Line 16:
  
   * SUGA axiomatization from [[http://​lara.epfl.ch/​~kuncak/​papers/​KuncakJackson05RelationalAnalysisAlgebraicDatatypes.html|my paper with D.Jackson]]   * SUGA axiomatization from [[http://​lara.epfl.ch/​~kuncak/​papers/​KuncakJackson05RelationalAnalysisAlgebraicDatatypes.html|my paper with D.Jackson]]
-  * Fagin'​s theorem, its consequences on spec language design+  * Fagin'​s theorem, its consequences on spec language design ​on finite models, finite domain complexity in practice
   * Ahrendt'​s work   * Ahrendt'​s work
   * completion for finding infinite models, presentation of infinite models   * completion for finding infinite models, presentation of infinite models
 +  * using Ehrenfeucht-Feferman games to find models
  
 References: References: