The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Roger Villemaire: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sylvain Hallé, Rudy Deca, Omar Cherkaoui, Roger Villemaire, Daniel Puche
    A Formal Validation Model for the Netconf Protocol. [Citation Graph (0, 0)][DBLP]
    DSOM, 2004, pp:147-158 [Conf]
  2. Christian Michaux, Roger Villemaire
    Cobham's Ttheorem seen through Büchi's Theorem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:325-334 [Conf]
  3. Sylvain Hallé, Éric Wenaas, Roger Villemaire, Omar Cherkaoui
    Self-configuration of Network Devices with Configuration Logic. [Citation Graph (0, 0)][DBLP]
    Autonomic Networking, 2006, pp:36-49 [Conf]
  4. Roger Villemaire
    An Approximation Semantics for the Propositional Mu-Calculus. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:637-650 [Conf]
  5. Sylvain Hallé, Rudy Deca, Omar Cherkaoui, Roger Villemaire
    Automated Validation of Service Configuration on Network Devices. [Citation Graph (0, 0)][DBLP]
    MMNS, 2004, pp:176-188 [Conf]
  6. Roger Villemaire
    Joining k- and l-Recognizable Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:83-94 [Conf]
  7. Roger Villemaire, Sylvain Hallé, Omar Cherkaoui
    Configuration Logic: A Multi-site Modal Logic. [Citation Graph (0, 0)][DBLP]
    TIME, 2005, pp:131-137 [Conf]
  8. Sylvain Hallé, Roger Villemaire, Omar Cherkaoui
    CTL Model Checking for Labelled Tree Queries. [Citation Graph (0, 0)][DBLP]
    TIME, 2006, pp:27-35 [Conf]
  9. Christian Michaux, Roger Villemaire
    Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:77, n:3, pp:251-277 [Journal]
  10. Roger Villemaire
    Theories of Modules Closed Under Direct Products. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1992, v:57, n:2, pp:515-521 [Journal]
  11. Roger Villemaire
    The Theory of (N, +, Vk, V1) is Undecidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:337-349 [Journal]
  12. Sylvain Hallé, Rudy Deca, Omar Cherkaoui, Roger Villemaire, Daniel Puche
    Modelling the Temporal Aspects of Network Configurations. [Citation Graph (0, 0)][DBLP]
    Net-Con, 2005, pp:269-282 [Conf]

  13. Browser-Based Enforcement of Interface Contracts in Web Applications with BeepBeep. [Citation Graph (, )][DBLP]


  14. Runtime Monitoring of Message-Based Workflows with Data. [Citation Graph (, )][DBLP]


  15. Model Checking Data-Aware Workflow Properties with CTL-FO+. [Citation Graph (, )][DBLP]


  16. XML Methods for Validation of Temporal Properties on Message Traces with Data. [Citation Graph (, )][DBLP]


  17. Runtime monitoring of web service choreographies using streaming XML. [Citation Graph (, )][DBLP]


  18. Strong Temporal, Weak Spatial Logic for Rule Based Filters. [Citation Graph (, )][DBLP]


  19. Satisfying a Fragment of XQuery by Branching-Time Reduction. [Citation Graph (, )][DBLP]


  20. Extending Model Checking to Data-Aware Temporal Properties of Web Services. [Citation Graph (, )][DBLP]


  21. Scalable formula decomposition for propositional satisfiability. [Citation Graph (, )][DBLP]


  22. Runtime Verification of Web Service Interface Contracts. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002