Sciweavers

297 search results - page 29 / 60
» Heap Reference Analysis Using Access Graphs
Sort
View
FM
2006
Springer
146views Formal Methods» more  FM 2006»
15 years 6 months ago
Formal Modeling of Communication Protocols by Graph Transformation
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
Zarrin Langari, Richard J. Trefler
129
Voted
LOPSTR
2007
Springer
15 years 8 months ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...
123
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 7 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
WWIC
2004
Springer
123views Communications» more  WWIC 2004»
15 years 7 months ago
Experimental Analysis of Heterogeneous Wireless Networks
Packet loss and delay in Internet degrade the quality of requested services like VoIP (Voice over IP) or Video Streaming. In novel network scenarios where wired and wireless connec...
Giulio Iannello, Antonio Pescapè, Giorgio V...
JMLR
2010
157views more  JMLR 2010»
15 years 24 days ago
Kronecker Graphs: An Approach to Modeling Networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...