Sciweavers

38 search results - page 3 / 8
» Termination Analysis with Calling Context Graphs
Sort
View
CLA
2007
13 years 7 months ago
Concept Graphs as Semantic Structures for Contextual Judgment Logic
Abstract. This paper presents a mathematization of the philosophical doctrine of judgments as an extension of the mathematization of the philosophical doctrine of concepts develope...
Rudolf Wille
GG
2010
Springer
13 years 4 months ago
Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
Frank Hermann, Hartmut Ehrig, Fernando Orejas, Ulr...
PLDI
2010
ACM
14 years 3 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
ENTCS
2006
172views more  ENTCS 2006»
13 years 6 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
SAC
2008
ACM
13 years 5 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...