References in zbMATH (referenced in 22 articles , 1 standard article )

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

1 2 next

  1. Padovani, Luca: A type checking algorithm for concurrent object protocols (2018)
  2. Chambart, Pierre; Finkel, Alain; Schmitz, Sylvain: Forward analysis and model checking for trace bounded WSTS (2016)
  3. Chambart, Pierre; Finkel, Alain; Schmitz, Sylvain: Forward analysis and model checking for trace bounded WSTS (2011)
  4. Boigelot, Bernard; Brusten, Julien; Leroux, Jérôme: A generalization of Semenov’s theorem to automata over real numbers (2009)
  5. Bardin, Sébastien; Finkel, Alain; Leroux, Jérôme; Petrucci, Laure: FAST: Acceleration from theory to practice (2008) ioport
  6. Eisinger, Jochen; Klaedtke, Felix: Don’t care words with an application to the automata-based approach for real addition (2008)
  7. Leroux, Jérôme: Structural Presburger digit vector automata (2008)
  8. Vardhan, Abhay; Viswanathan, Mahesh: Learning to verify branching time properties (2007)
  9. Althoff, Christoph Schulte; Thomas, Wolfgang; Wallmeier, Nico: Observations on determinization of Büchi automata (2006)
  10. Boigelot, Bernard; Herbreteau, Frédéric: The power of hybrid acceleration (2006)
  11. Cécé, Gérard; Finkel, Alain: Verification of programs with half-duplex communication (2005)
  12. Couvreur, Jean-Michel: A BDD-like implementation of an automata package (2005)
  13. Leroux, Jérôme; Sutre, Grégoire: Flat counter automata almost everywhere! (2005)
  14. Boigelot, Bernard; Latour, Louis: Counting the solutions of Presburger equations without enumerating them. (2004)
  15. Boigelot, Bernard; Legay, Axel; Wolper, Pierre: Omega-regular model checking (2004)
  16. Boigelot, Bernard: On iterating linear transformations over recognizable sets of integers (2003)
  17. Boigelot, Bernard; Herbreteau, Frédéric; Jodogne, Sébastien: Hybrid acceleration using real vector automata (extended abstract) (2003)
  18. Boigelot, Bernard; Legay, Axel; Wolper, Pierre: Iterating transducers in the large (extended abstract) (2003)
  19. Boigelot, Bernard; Latour, Louis: Counting the solutions of Presburger equations without enumerating them (2002)
  20. Boigelot, Bernard; Wolper, Pierre: Representing arithmetic constraints with finite automata: An overview (2002)

1 2 next