Sciweavers

183 search results - page 10 / 37
» Reasoning About Assumptions in Graphs of Models
Sort
View
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
13 years 10 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
14 years 8 days ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
ACL
2010
13 years 6 months ago
Combining Data and Mathematical Models of Language Change
English noun/verb (N/V) pairs (contract, cement) have undergone complex patterns of change between 3 stress patterns for several centuries. We describe a longitudinal dataset of N...
Morgan Sonderegger, Partha Niyogi
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
ENTCS
2007
108views more  ENTCS 2007»
13 years 8 months ago
Termination Criteria for DPO Transformations with Injective Matches
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
Tihamer Levendovszky, Ulrike Prange, Hartmut Ehrig