Sciweavers

360 search results - page 65 / 72
» Constraint Checking with Partial Information
Sort
View
POPL
2007
ACM
14 years 9 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
ATVA
2004
Springer
146views Hardware» more  ATVA 2004»
14 years 2 months ago
A Global Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
Tadaaki Tanimoto, Suguru Sasaki, Akio Nakata, Teru...
EDBT
2010
ACM
155views Database» more  EDBT 2010»
14 years 3 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
CCS
2009
ACM
14 years 9 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
ICDM
2008
IEEE
401views Data Mining» more  ICDM 2008»
14 years 3 months ago
Graph OLAP: Towards Online Analytical Processing on Graphs
OLAP (On-Line Analytical Processing) is an important notion in data analysis. Recently, more and more graph or networked data sources come into being. There exists a similar need ...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han, Phil...