References in zbMATH (referenced in 12 articles )

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

  1. Bielecki, Włodzimierz; Pałkowski, Marek: Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs (2016)
  2. Bielecki, Włodzimierz; Kraska, Krzysztof; Klimek, Tomasz: Using basis dependence distance vectors in the modified Floyd-Warshall algorithm (2015)
  3. Maisonneuve, Vivien; Hermant, Olivier; Irigoin, François: Computing invariants with transformers: experimental scalability and accuracy (2014)
  4. Bielecki, Wlodzimierz; Palkowski, Marek; Klimek, Tomasz: Free scheduling for statement instances of parameterized arbitrarily nested affine loops (2012) ioport
  5. Bielecki, W.; Klimek, T.; Trifunovic, K.: Calculating exact transitive closure for a normalized affine integer tuple relation (2009)
  6. Rapin, Nicolas: Symbolic execution based model checking of open systems with unbounded variables (2009)
  7. Bagnara, Roberto; Hill, Patricia M.; Zaffanella, Enea: Widening operators for powerset domains (2006) ioport
  8. Bigot, Céline; Faivre, Alain; Gaston, Christophe; Simon, Julien: Automatic test generation on a (U)SIM smart card (2006) ioport
  9. Yavuz-Kahveci, Tuba; Bultan, Tevfik: A symbolic manipulator for automated verification of reactive systems with heterogeneous data types (2003) ioport
  10. Mellor-Crummey, J.; Adve, V.; Broom, B.; Chavarría-Miranda, D.; Fowler, R.; Jin, G.; Kennedy, K.; Yi, Q.: Advanced optimization strategies in the Rice dHPF compiler (2002)
  11. Cosnard, M.; Loi, M.: A simple algorithm for the generation of efficient loop structures. (1996) ioport
  12. Kelly, Wayne; Pugh, William: Using affine closure to find legal recordering transformations. (1995) ioport