Sciweavers

877 search results - page 88 / 176
» Structural Cut Elimination
Sort
View
MICRO
1997
IEEE
127views Hardware» more  MICRO 1997»
13 years 12 months ago
Exploiting Dead Value Information
We describe Dead Value Information (DVI) and introduce three new optimizations which exploit it. DVI provides assertions that certain register values are dead, meaning they will n...
Milo M. K. Martin, Amir Roth, Charles N. Fischer
FM
2008
Springer
192views Formal Methods» more  FM 2008»
13 years 9 months ago
CoVaC: Compiler Validation by Program Analysis of the Cross-Product
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compiler...
Anna Zaks, Amir Pnueli
AVSS
2009
IEEE
13 years 5 months ago
Landmark Localisation in 3D Face Data
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
Marcelo Romero, Nick Pears
CORR
2011
Springer
150views Education» more  CORR 2011»
13 years 2 months ago
Program Optimization Based Pointer Analysis and Live Stack-Heap Analysis
In this paper, we present type systems for flow-sensitive pointer analysis, live stack-heap (variables) analysis, and program optimization. The type system for live stack-heap ana...
Mohamed A. El-Zawawy
ICLP
2011
Springer
12 years 11 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...