Search For:

Displaying 1-11 out of 11 total
Runtime Enforcement of Web Service Message Contracts with Data
Found in: IEEE Transactions on Services Computing
By Sylvain Hallé,Roger Villemaire
Issue Date:January 2012
pp. 192-206
An increasing number of popular SOAP web services exhibit a stateful behavior, where a successful interaction is determined as much by the correct format of messages as by the sequence in which they are exchanged with a client. The set of such constraints ...
 
Runtime Verification of Web Service Interface Contracts
Found in: Computer
By Sylvain Hallé, Tevfik Bultan, Graham Hughes, Muath Alkhalaf, Roger Villemaire
Issue Date:March 2010
pp. 59-66
Experiments with the Amazon E-Commerce Service demonstrate the advantages of using a model-based approach for the runtime testing and monitoring of Web applications.
 
Strong Temporal, Weak Spatial Logic for Rule Based Filters
Found in: Temporal Representation and Reasoning, International Syposium on
By Roger Villemaire, Sylvain Hallé
Issue Date:July 2009
pp. 115-121
Rule-based filters are sequences of rules formed of a condition and a decision. Rules are applied sequentially up to the first fulfilled condition, whose matching decision determines the outcome. Such filters are particularly useful in network management, ...
 
Specifying and Validating Data-Aware Temporal Web Service Properties
Found in: IEEE Transactions on Software Engineering
By Sylvain Hallé, Roger Villemaire, Omar Cherkaoui
Publication Date: April 2009
pp. 669-683
Most works that extend workflow validation beyond syntactical checking consider constraints on the sequence of messages exchanged between services. These constraints are expressed only in terms of message names and abstract away their actual data content. ...
 
Runtime Monitoring of Message-Based Workflows with Data
Found in: Enterprise Distributed Object Computing Conference, IEEE International
By Sylvain Halle, Roger Villemaire
Issue Date:September 2008
pp. 63-72
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+, an extension to traditional Linear Temporal Logic that includes full first-order quantification over the ...
 
Satisfying a Fragment of XQuery by Branching-Time Reduction
Found in: Temporal Representation and Reasoning, International Syposium on
By Sylvain Hallé, Roger Villemaire
Issue Date:June 2008
pp. 72-76
Configuration Logic (CL) is a fragment of XQuery that allows first-order quantification over node labels. In this paper, we study CL satisfiability and seek a deterministic decision procedure to build models of satisfiable CL formulae. To this end, we show...
 
Model Checking Data-Aware Workflow Properties with CTL-FO+
Found in: Enterprise Distributed Object Computing Conference, IEEE International
By Sylvain Hallé, Roger Villemaire, Omar Cherkaoui, Boubker Ghandour
Issue Date:October 2007
pp. 267
Most works that extend workflow validation beyond syn- tactical checking consider constraints on the sequence of messages exchanged between services. However, these con- straints are expressed only in terms of message names and abstract away their actual d...
 
Skolem Functions and Herbrand Universes in a Tree Generalization of First Order Logic
Found in: Mexican International Conference on Artificial Intelligence
By Roger Villemaire, Sylvain Halle, Rudy Deca, Omar Cherkaoui
Issue Date:November 2006
pp. 22-31
Skolem functions and Herbrand universes are fundamental concepts in first-order logic that form the basis of many works in artificial intelligence. In this paper, we study a fragment of the XML Query Language (XQuery) that generalizes first-order logic to ...
 
CTL Model Checking for Labelled Tree Queries
Found in: Temporal Representation and Reasoning, International Syposium on
By Sylvain Halle, Roger Villemaire, Omar Cherkaoui
Issue Date:June 2006
pp. 27-35
Querying and efficiently validating properties on labelled tree structures has become an important part of research in numerous domains. In this paper, we show how a fragment of XPath called Configuration Logic (CL) can be embedded into Computation Tree Lo...
 
Configuration Logic: A Multi-site Modal Logic
Found in: Temporal Representation and Reasoning, International Syposium on
By Roger Villemaire, Sylvain Hallé, Omar Cherkaoui
Issue Date:June 2005
pp. 131-137
We introduce a logical formalism for describing properties of configurations of computing systems. This logic of trees allows quantification on node labels, which are modalities containing variables. We explain the motivation behind our formalism and give ...
 
Scalable formula decomposition for propositional satisfiability
Found in: Proceedings of the Third C* Conference on Computer Science and Software Engineering (C3S2E '10)
By Anthony Monnet, Roger Villemaire
Issue Date:May 2010
pp. 43-52
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or probabilistic reasoning. The depth-first search DPLL procedure is in practic...
     
 1