Sciweavers

990 search results - page 42 / 198
» A Static Analysis Technique for Graph Transformation Systems
Sort
View
CGO
2008
IEEE
14 years 3 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
TCAD
2008
90views more  TCAD 2008»
13 years 9 months ago
Application and Verification of Local Nonsemantic-Preserving Transformations in System Design
Due to the increasing abstraction gap between the initial system model and a final implementation, the verification of the respective models against each other is a formidable task...
Tarvo Raudvere, Ingo Sander, Axel Jantsch
JGAA
2000
85views more  JGAA 2000»
13 years 8 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
VLDB
1995
ACM
91views Database» more  VLDB 1995»
14 years 15 days ago
A Data Transformation System for Biological Data Sources
Scientific data of importance to biologists in the Humitn Genome Project resides not only in conventional da.tabases, but in structured files maintained in a number of different f...
Peter Buneman, Susan B. Davidson, Kyle Hart, G. Ch...
RTA
2007
Springer
14 years 3 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...