Sciweavers

222 search results - page 21 / 45
» Development of Correct Graph Transformation Systems
Sort
View
JSAT
2006
87views more  JSAT 2006»
13 years 7 months ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
PLDI
2009
ACM
14 years 2 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting
CL
2012
Springer
11 years 10 months ago
Object swapping challenges: An evaluation of imageSegment
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...
Mariano Martinez Peck, Noury Bouraqadi, Sté...
ICASSP
2009
IEEE
13 years 11 months ago
Spoken dialog strategy based on understanding graph search
We regarded information retrieval as a graph search problem and proposed several novel dialog strategies that can recover from misrecognition through a spoken dialog that traverse...
Yuji Kinoshita, Chiyomi Miyajima, Norihide Kitaoka...
KDD
2009
ACM
132views Data Mining» more  KDD 2009»
14 years 8 months ago
Learning patterns in the dynamics of biological networks
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...
Chang Hun You, Lawrence B. Holder, Diane J. Cook