Sciweavers

2702 search results - page 292 / 541
» Practically Applicable Formal Methods
Sort
View
130
Voted
ENTCS
2006
172views more  ENTCS 2006»
15 years 2 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
219
Voted
KCAP
2011
ACM
14 years 5 months ago
Let's agree to disagree: on the evaluation of vocabulary alignment
Gold standard mappings created by experts are at the core of alignment evaluation. At the same time, the process of manual evaluation is rarely discussed. While the practice of ha...
Anna Tordai, Jacco van Ossenbruggen, Guus Schreibe...
135
Voted
SAS
2012
Springer
208views Formal Methods» more  SAS 2012»
13 years 5 months ago
Finding Non-terminating Executions in Distributed Asynchronous Programs
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
Michael Emmi, Akash Lal
TKDE
2012
194views Formal Methods» more  TKDE 2012»
13 years 5 months ago
A Query Formulation Language for the Data Web
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...
Mustafa Jarrar, Marios D. Dikaiakos
123
Voted
RECOMB
2005
Springer
16 years 3 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...