Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Next revision Both sides next revision | ||
jahob_system [2011/02/09 20:51] vkuncak |
jahob_system [2011/02/09 20:52] vkuncak |
||
---|---|---|---|
Line 68: | Line 68: | ||
Some relevant publications: | Some relevant publications: | ||
- | * [[http://pub.ist.ac.at/~wies/papers/CounterexampleGuidedFocus.pdf|Andreas Podelski, Thomas Wies: Counterexample-Guided Focus]] | + | * [[http://pub.ist.ac.at/~wies/papers/CounterexampleGuidedFocus.pdf|Andreas Podelski, Thomas Wies: Counterexample-Guided Focus (POPL), 2010.]] |
* [[http://lara.epfl.ch/~kuncak/papers/ZeeETAL09IntegratedProofLanguageforImperativePrograms.html|Karen Zee, Viktor Kuncak, and Martin Rinard. An integrated proof language for imperative programs. In ACM Conf. Programming Language Design and Implementation (PLDI), 2009.]] | * [[http://lara.epfl.ch/~kuncak/papers/ZeeETAL09IntegratedProofLanguageforImperativePrograms.html|Karen Zee, Viktor Kuncak, and Martin Rinard. An integrated proof language for imperative programs. In ACM Conf. Programming Language Design and Implementation (PLDI), 2009.]] | ||
* [[http://lara.epfl.ch/~kuncak/papers/ZeeETAL08FullFunctionalVerificationofLinkedDataStructures.html|Karen Zee, Viktor Kuncak, and Martin Rinard. Full functional verification of linked data structures. In ACM Conf. Programming Language Design and Implementation (PLDI), 2008.]] | * [[http://lara.epfl.ch/~kuncak/papers/ZeeETAL08FullFunctionalVerificationofLinkedDataStructures.html|Karen Zee, Viktor Kuncak, and Martin Rinard. Full functional verification of linked data structures. In ACM Conf. Programming Language Design and Implementation (PLDI), 2008.]] |