default search action
Roger Villemaire
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Dimitri Prestat
, Naouel Moha
DynAMICS: A Tool-Based Method for the Specification and Dynamic Detection of Android Behavioral Code Smells. IEEE Trans. Software Eng. 50(4): 765-784 (2024) - [c32]Florent Avellaneda, Roger Villemaire:
Delegation-Relegation for Boolean Matrix Factorization. AAAI 2024: 20632-20639 - 2022
- [j13]Dimitri Prestat
An empirical study of Android behavioural code smells detection. Empir. Softw. Eng. 27(7): 179 (2022) - [c31]Florent Avellaneda, Roger Villemaire:
Undercover Boolean Matrix Factorization with MaxSAT. AAAI 2022: 3672-3681 - [d1]Dimitri Prestat, Naouel Moha, Roger Villemaire, Florent Avellaneda:
DynAMICS: A tool-based method for the specification and dynamic detection of Android behavioural code smells. IEEE DataPort, 2022 - 2021
- [c30]Steve Boucher, Roger Villemaire:
Quantified Boolean Solving for Achievement Games. KI 2021: 30-43 - [i3]Florent Avellaneda, Roger Villemaire:
Boolean Matrix Factorization with SAT and MaxSAT. CoRR abs/2106.10105 (2021) - 2020
- [c29]Dennis J. Drown, Roger Villemaire, Serge Robert:
Big Players: Emotion in Twitter Communities Tweeting About Global Warming. Canadian AI 2020: 189-200
2010 – 2019
- 2019
- [c28]Benoit Potvin, Roger Villemaire:
Robust Web Data Extraction Based on Unsupervised Visual Validation. ACIIDS (1) 2019: 77-89 - 2018
- [c27]Benoit Potvin, Roger Villemaire:
When Different Is Wrong: Visual Unsupervised Validation for Web Information Extraction. MLDM (2) 2018: 132-146 - 2017
- [j12]Eric Lunaud Ngoupe, Clément Parisot, Sylvain Stoesel, Petko Valtchev
A Declarative Approach to Network Device Configuration Correctness. J. Netw. Syst. Manag. 25(1): 180-209 (2017) - [e1]Sylvain Hallé, Roger Villemaire, Robert Lagerström:
21st IEEE International Enterprise Distributed Object Computing Conference, EDOC 2017, Quebec City, QC, Canada, October 10-13, 2017. IEEE Computer Society 2017, ISBN 978-1-5090-3045-3 [contents] - 2016
- [c26]Benoit Potvin, Roger Villemaire, Ngoc-Tan Le:
A Position-Based Method for the Extraction of Financial Information in PDF Documents. ADCS 2016: 9-16 - 2015
- [j11]Roger Villemaire:
Homogeneity and Fix-Points: Going Forth! J. Symb. Log. 80(2): 636-660 (2015) - [i2]Roger Villemaire:
Logic Modelling. CoRR abs/1507.03686 (2015) - 2014
- [j10]Pierre Ille, Roger Villemaire:
Recognition of prime graphs from a prime subgraph. Discret. Math. 327: 76-90 (2014) - 2013
- [c25]Sylvain Hallé, Eric Lunaud Ngoupe, Roger Villemaire, Omar Cherkaoui:
Distributed firewall anomaly detection through LTL model checking. IM 2013: 194-201 - [i1]Anthony Monnet, Roger Villemaire:
Efficient Partial Order CDCL Using Assertion Level Choice Heuristics. CoRR abs/1301.7676 (2013) - 2012
- [j9]Roger Villemaire, Sylvain Hallé
Reasoning about visibility. J. Appl. Log. 10(2): 163-178 (2012) - [j8]Sylvain Hallé
A Logical Approach to Data-Aware Automated Sequence Generation. Trans. Comput. Sci. 15: 192-216 (2012) - [j7]Sylvain Hallé
Runtime Enforcement of Web Service Message Contracts with Data. IEEE Trans. Serv. Comput. 5(2): 192-206 (2012) - [c24]Anthony Monnet, Roger Villemaire:
CDCL with Less Destructive Backtracking through Partial Ordering. PAAR@IJCAR 2012: 124-138 - [c23]Sylvain Hallé
Constraint-based invocation of stateful web services: The beep store (case study). PESOS@ICSE 2012: 61-62 - [c22]Bassam Khorchani, Sylvain Hallé
Firewall anomaly detection with a model checker for visibility logic. NOMS 2012: 466-469 - [c21]Sylvain Hallé
ValidMaker: A tool for managing device configurations using logical constraints. NOMS 2012: 1111-1118 - 2010
- [j6]Sylvain Hallé
Runtime Verification of Web Service Interface Contracts. Computer 43(3): 59-66 (2010) - [c20]Anthony Monnet, Roger Villemaire:
Scalable formula decomposition for propositional satisfiability. C3S2E 2010: 43-52 - [c19]Sylvain Hallé
Runtime Verification for the Web - A Tutorial Introduction to Interface Contracts in Web Applications. RV 2010: 106-121
2000 – 2009
- 2009
- [j5]Sylvain Hallé
Specifying and Validating Data-Aware Temporal Web Service Properties. IEEE Trans. Software Eng. 35(5): 669-683 (2009) - [c18]Sylvain Hallé
Browser-Based Enforcement of Interface Contracts in Web Applications with BeepBeep. CAV 2009: 648-653 - [c17]Sylvain Hallé
Flexible and reliable messaging using runtime monitoring. EDOCW 2009: 116-125 - [c16]Sylvain Hallé
Runtime monitoring of web service choreographies using streaming XML. SAC 2009: 2118-2125 - [c15]Roger Villemaire, Sylvain Hallé
Strong Temporal, Weak Spatial Logic for Rule Based Filters. TIME 2009: 115-121 - 2008
- [c14]Sylvain Hallé
Runtime Monitoring of Message-Based Workflows with Data. EDOC 2008: 63-72 - [c13]Sylvain Hallé
XML Methods for Validation of Temporal Properties on Message Traces with Data. OTM Conferences (1) 2008: 337-353 - [c12]Sylvain Hallé
Satisfying a Fragment of XQuery by Branching-Time Reduction. TIME 2008: 72-76 - 2007
- [c11]Sylvain Hallé, Roger Villemaire, Omar Cherkaoui, Boubker Ghandour:
Model Checking Data-Aware Workflow Properties with CTL-FO+. EDOC 2007: 267-278 - [c10]Sylvain Hallé
Extending Model Checking to Data-Aware Temporal Properties of Web Services. WS-FM 2007: 31-45 - 2006
- [c9]Sylvain Hallé, Éric Wenaas, Roger Villemaire, Omar Cherkaoui:
Self-configuration of Network Devices with Configuration Logic. Autonomic Networking 2006: 36-49 - [c8]Sylvain Hallé
CTL Model Checking for Labelled Tree Queries. TIME 2006: 27-35 - 2005
- [c7]Sylvain Hallé
Modelling the Temporal Aspects of Network Configurations. Net-Con 2005: 269-282 - [c6]Roger Villemaire, Sylvain Hallé
Configuration Logic: A Multi-site Modal Logic. TIME 2005: 131-137 - 2004
- [c5]Sylvain Hallé, Rudy Deca, Omar Cherkaoui, Roger Villemaire, Daniel Puche:
A Formal Validation Model for the Netconf Protocol. DSOM 2004: 147-158 - [c4]Sylvain Hallé, Rudy Deca, Omar Cherkaoui, Roger Villemaire:
Automated Validation of Service Configuration on Network Devices. MMNS 2004: 176-188 - 2002
- [c3]Roger Villemaire:
An Approximation Semantics for the Propositional Mu-Calculus. MFCS 2002: 637-650
1990 – 1999
- 1996
- [j4]Christian Michaux
Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems. Ann. Pure Appl. Log. 77(3): 251-277 (1996) - 1993
- [c2]Christian Michaux
Cobham's Ttheorem seen through Büchi's Theorem. ICALP 1993: 325-334 - 1992
- [j3]Roger Villemaire:
Completely decomposable abelian groups -categorical over a subgroup. Arch. Math. Log. 31(4): 263-275 (1992) - [j2]Roger Villemaire:
Theories of Modules Closed Under Direct Products. J. Symb. Log. 57(2): 515-521 (1992) - [j1]Roger Villemaire:
The Theory of (N, +, Vk, V1) is Undecidable. Theor. Comput. Sci. 106(2): 337-349 (1992) - [c1]Roger Villemaire:
Joining k- and l-Recognizable Sets of Natural Numbers. STACS 1992: 83-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: