Previous Page | Next Page |
# | Year | Author(s) [non member] | Title | Type | |||||
---|---|---|---|---|---|---|---|---|---|
1 |
| ||||||||
2 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
2 |
| ||||||||
1 |
| ||||||||
2 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
2 |
| ||||||||
2 |
| ||||||||
23 |
| ||||||||
3 |
| ||||||||
2002 | Maier, Patrick | A Framework for Circular Assume-Guarantee Rules In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 55-58 | Proceedings Article | ||||||
2002 | Hillenbrand, Thomas Podelski, Andreas Topić, Dalibor | Is Logic Effective for Analyzing C Programs? In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 27-30 | Proceedings Article | ||||||
2002 | Kazakov, Yevgeny | Recursive resolution for modal logic In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 11-15 | Proceedings Article | ||||||
1 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
2 |
| ||||||||
3 |
| ||||||||
1 |
| ||||||||
1 |
| ||||||||
1 |
|
Previous Page | Next Page |