Roger Villemaire

Orcid: 0009-0008-9222-885X

According to our database1, Roger Villemaire authored at least 50 papers between 1992 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
DynAMICS: A Tool-Based Method for the Specification and Dynamic Detection of Android Behavioral Code Smells.
IEEE Trans. Software Eng., April, 2024

Delegation-Relegation for Boolean Matrix Factorization.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2022
DynAMICS: A tool-based method for the specification and dynamic detection of Android behavioural code smells.
Dataset, December, 2022

An empirical study of Android behavioural code smells detection.
Empir. Softw. Eng., 2022

Undercover Boolean Matrix Factorization with MaxSAT.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Boolean Matrix Factorization with SAT and MaxSAT.
CoRR, 2021

Quantified Boolean Solving for Achievement Games.
Proceedings of the KI 2021: Advances in Artificial Intelligence - 44th German Conference on AI, Virtual Event, September 27, 2021

2020
Big Players: Emotion in Twitter Communities Tweeting About Global Warming.
Proceedings of the Advances in Artificial Intelligence, 2020

2019
Robust Web Data Extraction Based on Unsupervised Visual Validation.
Proceedings of the Intelligent Information and Database Systems - 11th Asian Conference, 2019

2018
When Different Is Wrong: Visual Unsupervised Validation for Web Information Extraction.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2018

2017
A Declarative Approach to Network Device Configuration Correctness.
J. Netw. Syst. Manag., 2017

2016
A Position-Based Method for the Extraction of Financial Information in PDF Documents.
Proceedings of the 21st Australasian Document Computing Symposium, 2016

2015
Homogeneity and Fix-Points: Going Forth!
J. Symb. Log., 2015

Logic Modelling.
CoRR, 2015

2014
Recognition of prime graphs from a prime subgraph.
Discret. Math., 2014

2013
Efficient Partial Order CDCL Using Assertion Level Choice Heuristics
CoRR, 2013

Distributed firewall anomaly detection through LTL model checking.
Proceedings of the 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013), 2013

2012
Runtime Enforcement of Web Service Message Contracts with Data.
IEEE Trans. Serv. Comput., 2012

A Logical Approach to Data-Aware Automated Sequence Generation.
Trans. Comput. Sci., 2012

Reasoning about visibility.
J. Appl. Log., 2012

Firewall anomaly detection with a model checker for visibility logic.
Proceedings of the 2012 IEEE Network Operations and Management Symposium, 2012

ValidMaker: A tool for managing device configurations using logical constraints.
Proceedings of the 2012 IEEE Network Operations and Management Symposium, 2012

Constraint-based invocation of stateful web services: The beep store (case study).
Proceedings of the 4th International ICSE Workshop on Principles of Engineering Service-Oriented Systems, 2012

CDCL with Less Destructive Backtracking through Partial Ordering.
Proceedings of the Third Workshop on Practical Aspects of Automated Reasoning, 2012

2010
Runtime Verification of Web Service Interface Contracts.
Computer, 2010

Runtime Verification for the Web - A Tutorial Introduction to Interface Contracts in Web Applications.
Proceedings of the Runtime Verification - First International Conference, 2010

Scalable formula decomposition for propositional satisfiability.
Proceedings of the Canadian Conference on Computer Science & Software Engineering, 2010

2009
Specifying and Validating Data-Aware Temporal Web Service Properties.
IEEE Trans. Software Eng., 2009

Strong Temporal, Weak Spatial Logic for Rule Based Filters.
Proceedings of the TIME 2009, 2009

Runtime monitoring of web service choreographies using streaming XML.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Flexible and reliable messaging using runtime monitoring.
Proceedings of the Workshops Proceedings of the 12th IEEE International Enterprise Distributed Object Computing Conference, 2009

Browser-Based Enforcement of Interface Contracts in Web Applications with BeepBeep.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Satisfying a Fragment of XQuery by Branching-Time Reduction.
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

XML Methods for Validation of Temporal Properties on Message Traces with Data.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2008, 2008

Runtime Monitoring of Message-Based Workflows with Data.
Proceedings of the 12th International IEEE Enterprise Distributed Object Computing Conference, 2008

2007
Extending Model Checking to Data-Aware Temporal Properties of Web Services.
Proceedings of the Web Services and Formal Methods, 4th International Workshop, 2007

Model Checking Data-Aware Workflow Properties with CTL-FO+.
Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), 2007

2006
CTL Model Checking for Labelled Tree Queries.
Proceedings of the 13th International Symposium on Temporal Representation and Reasoning (TIME 2006), 2006

Self-configuration of Network Devices with Configuration Logic.
Proceedings of the Autonomic Networking, First International IFIP TC6 Conference, 2006

2005
Configuration Logic: A Multi-site Modal Logic.
Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 2005

Modelling the Temporal Aspects of Network Configurations.
Proceedings of the Network Control and Engineering for QoS, 2005

2004
Automated Validation of Service Configuration on Network Devices.
Proceedings of the Management of Multimedia Networks and Services: 7th IFIP/IEEE International Conference, 2004

A Formal Validation Model for the Netconf Protocol.
Proceedings of the Utility Computing: 15th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, 2004

2002
An Approximation Semantics for the Propositional Mu-Calculus.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

1996
Presburger Arithmetic and Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems.
Ann. Pure Appl. Log., 1996

1993
Cobham's Ttheorem seen through Büchi's Theorem.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
The Theory of (N, +, Vk, V1) is Undecidable.
Theor. Comput. Sci., 1992

Theories of Modules Closed Under Direct Products.
J. Symb. Log., 1992

Completely decomposable abelian groups -categorical over a subgroup.
Arch. Math. Log., 1992

Joining k- and l-Recognizable Sets of Natural Numbers.
Proceedings of the STACS 92, 1992


  Loading...