Sciweavers

58 search results - page 7 / 12
» Call Graph Construction in Object-Oriented Languages
Sort
View
PLDI
2009
ACM
14 years 3 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
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
13 years 7 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...
ICFP
2005
ACM
14 years 8 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
POS
1994
Springer
14 years 19 days 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»
13 years 8 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...