Sciweavers

58 search results - page 7 / 12
» Call Graph Construction in Object-Oriented Languages
Sort
View
86
Voted
PLDI
2009
ACM
15 years 5 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
110
Voted
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
14 years 8 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
71
Voted
ICFP
2005
ACM
15 years 10 months ago
The anatomy of a loop: a story of scope and control
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
Olin Shivers
93
Voted
POS
1994
Springer
15 years 2 months ago
Hardware Support for Stability in a Persistent Architecture
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...
Frans A. Henskens, D. M. Koch, Rasool Jalili, John...
JOT
2007
193views more  JOT 2007»
14 years 10 months ago
Applying Triple Graph Grammars For Pattern-Based Workflow Model Transformations
Workflow and business process modeling approaches have become essential for designing service collaborations when developing SOA-based systems. To derive actual executable busines...
Carsten Lohmann, Joel Greenyer, Juanjuan Jiang, Ta...