 | 2009 |
| 15 |  | Maria João Frade,
Ando Saabas,
Tarmo Uustalu:
Bidirectional data-flow analyses, type-systematically.
PEPM 2009: 141-150 |
| 14 |  | Bernd Fischer,
Ando Saabas,
Tarmo Uustalu:
Program Repair as Sound Optimization of Broken Programs.
TASE 2009: 165-173 |
| 13 |  | Ando Saabas,
Tarmo Uustalu:
Proof optimization for partial redundancy elimination.
J. Log. Algebr. Program. 78(7): 619-642 (2009) |
| 2008 |
| 12 |  | Margus Veanes,
Ando Saabas:
Using Satisfiability Modulo Theories to Analyze Abstract State Machines (Abstract).
ABZ 2008: 355 |
| 11 |  | Margus Veanes,
Ando Saabas:
On Bounded Reachability of Programs with Set Comprehensions.
LPAR 2008: 305-317 |
| 10 |  | Ando Saabas,
Tarmo Uustalu:
Proof optimization for partial redundancy elimination.
PEPM 2008: 91-101 |
| 9 |  | Ando Saabas,
Tarmo Uustalu:
Program and proof optimizations with type systems.
J. Log. Algebr. Program. 77(1-2): 131-154 (2008) |
| 2007 |
| 8 |  | Maria João Frade,
Ando Saabas,
Tarmo Uustalu:
Foundational certification of data-flow analyses.
TASE 2007: 107-116 |
| 7 |  | Ando Saabas,
Tarmo Uustalu:
Type Systems for Optimizing Stack-based Code.
Electr. Notes Theor. Comput. Sci. 190(1): 103-119 (2007) |
| 6 |  | Ando Saabas,
Tarmo Uustalu:
A compositional natural semantics and Hoare logic for low-level languages.
Theor. Comput. Sci. 373(3): 273-302 (2007) |
| 2006 |
| 5 |  | Ando Saabas,
Tarmo Uustalu:
Compositional Type Systems for Stack-Based Low-Level Languages.
CATS 2006: 27-39 |
| 4 |  | Ando Saabas,
Tarmo Uustalu:
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages.
Electr. Notes Theor. Comput. Sci. 156(1): 151-168 (2006) |
| 2005 |
| 3 |  | Pavel Grigorenko,
Ando Saabas,
Enn Tyugu:
Visual tool for generative programming.
ESEC/SIGSOFT FSE 2005: 249-252 |
| 2 |  | Gilles Barthe,
Tamara Rezk,
Ando Saabas:
Proof Obligations Preserving Compilation.
Formal Aspects in Security and Trust 2005: 112-126 |
| 1 |  | Pavel Grigorenko,
Ando Saabas,
Enn Tyugu:
COCOVILA - Compiler-Compiler for Visual Languages.
Electr. Notes Theor. Comput. Sci. 141(4): 137-142 (2005) |