| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Roger Villemaire Roger Villemaire, Sylvain Hallé , Omar Cherkaoui : Configuration Logic: A Multi-site Modal Logic. TIME 2005 : 131-137 Sylvain Hallé , Rudy Deca , Omar Cherkaoui , Roger Villemaire, Daniel Puche : A Formal Validation Model for the Netconf Protocol. DSOM 2004 : 147-158 Sylvain Hallé , Rudy Deca , Omar Cherkaoui , Roger Villemaire: Automated Validation of Service Configuration on Network Devices. MMNS 2004 : 176-188 Roger Villemaire: An Approximation Semantics for the Propositional Mu-Calculus. MFCS 2002 : 637-650 Christian Michaux , Roger Villemaire: Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems. Ann. Pure Appl. Logic 77 (3): 251-277 (1996) Christian Michaux , Roger Villemaire: Cobham's Ttheorem seen through Büchi's Theorem. ICALP 1993 : 325-334 Roger Villemaire: Joining k- and l-Recognizable Sets of Natural Numbers. STACS 1992 : 83-94 Roger Villemaire: Theories of Modules Closed Under Direct Products. J. Symb. Log. 57 (2): 515-521 (1992) Roger Villemaire: The Theory of (N, +, Vk, V1) is Undecidable. Theor. Comput. Sci. 106 (2): 337-349 (1992) 1 [ 7 ] [ 8 ] [ 9 ] 2 [ 7 ] [ 8 ] 3 [ 7 ] [ 8 ] [ 9 ] 4 [ 4 ] [ 5 ] 5 [ 8 ]  ©2006 Association for Computing Machinery |
