 | 2009 |
| 19 |  | Sylvain Hallé,
Roger Villemaire:
Browser-Based Enforcement of Interface Contracts in Web Applications with BeepBeep.
CAV 2009: 648-653 |
| 18 |  | Sylvain Hallé,
Roger Villemaire:
Runtime monitoring of web service choreographies using streaming XML.
SAC 2009: 2118-2125 |
| 2008 |
| 17 |  | Sylvain Hallé,
Roger Villemaire:
Runtime Monitoring of Message-Based Workflows with Data.
EDOC 2008: 63-72 |
| 16 |  | Sylvain Hallé,
Roger Villemaire:
XML Methods for Validation of Temporal Properties on Message Traces with Data.
OTM Conferences (1) 2008: 337-353 |
| 15 |  | Sylvain Hallé,
Roger Villemaire:
Satisfying a Fragment of XQuery by Branching-Time Reduction.
TIME 2008: 72-76 |
| 2007 |
| 14 |  | Sylvain Hallé,
Roger Villemaire,
Omar Cherkaoui,
Boubker Ghandour:
Model Checking Data-Aware Workflow Properties with CTL-FO+.
EDOC 2007: 267-278 |
| 13 |  | Sylvain Hallé,
Roger Villemaire,
Omar Cherkaoui,
Jérôme Tremblay,
Boubker Ghandour:
Extending Model Checking to Data-Aware Temporal Properties of Web Services.
WS-FM 2007: 31-45 |
| 2006 |
| 12 |  | Sylvain Hallé,
Éric Wenaas,
Roger Villemaire,
Omar Cherkaoui:
Self-configuration of Network Devices with Configuration Logic.
Autonomic Networking 2006: 36-49 |
| 11 |  | Sylvain Hallé,
Roger Villemaire,
Omar Cherkaoui:
CTL Model Checking for Labelled Tree Queries.
TIME 2006: 27-35 |
| 2005 |
| 10 |  | Sylvain Hallé,
Rudy Deca,
Omar Cherkaoui,
Roger Villemaire,
Daniel Puche:
Modelling the Temporal Aspects of Network Configurations.
Net-Con 2005: 269-282 |
| 9 |  | Roger Villemaire,
Sylvain Hallé,
Omar Cherkaoui:
Configuration Logic: A Multi-site Modal Logic.
TIME 2005: 131-137 |
| 2004 |
| 8 |  | Sylvain Hallé,
Rudy Deca,
Omar Cherkaoui,
Roger Villemaire,
Daniel Puche:
A Formal Validation Model for the Netconf Protocol.
DSOM 2004: 147-158 |
| 7 |  | Sylvain Hallé,
Rudy Deca,
Omar Cherkaoui,
Roger Villemaire:
Automated Validation of Service Configuration on Network Devices.
MMNS 2004: 176-188 |
| 2002 |
| 6 |  | Roger Villemaire:
An Approximation Semantics for the Propositional Mu-Calculus.
MFCS 2002: 637-650 |
| 1996 |
| 5 |  | 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) |
| 1993 |
| 4 |  | Christian Michaux,
Roger Villemaire:
Cobham's Ttheorem seen through Büchi's Theorem.
ICALP 1993: 325-334 |
| 1992 |
| 3 |  | Roger Villemaire:
Joining k- and l-Recognizable Sets of Natural Numbers.
STACS 1992: 83-94 |
| 2 |  | Roger Villemaire:
Theories of Modules Closed Under Direct Products.
J. Symb. Log. 57(2): 515-521 (1992) |
| 1 |  | Roger Villemaire:
The Theory of (N, +, Vk, V1) is Undecidable.
Theor. Comput. Sci. 106(2): 337-349 (1992) |