Sciweavers

4767 search results - page 522 / 954
» Structures for Abstract Rewriting
Sort
View
229
Voted
CICLING
2009
Springer
16 years 8 months ago
Generating Executable Scenarios from Natural Language
Abstract. Bridging the gap between the specification of software requirements and actual execution of the behavior of the specified system has been the target of much research in r...
Michal Gordon, David Harel
211
Voted
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
16 years 8 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 8 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
KDD
2007
ACM
121views Data Mining» more  KDD 2007»
16 years 8 months ago
Preserving the Privacy of Sensitive Relationships in Graph Data
Abstract. In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships fr...
Elena Zheleva, Lise Getoor
KDD
2007
ACM
143views Data Mining» more  KDD 2007»
16 years 8 months ago
Mining Research Communities in Bibliographical Data
Abstract. Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden informa...
Osmar R. Zaïane, Jiyang Chen, Randy Goebel