Sciweavers

145 search results - page 10 / 29
» Extended Whole Program Paths
Sort
View
PPDP
2001
Springer
13 years 11 months ago
Constructor-Based Conditional Narrowing
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...
Sergio Antoy
DBPL
1991
Springer
76views Database» more  DBPL 1991»
13 years 11 months ago
A Functional DBPL Revealing High Level Optimizations
We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is int...
Martin Erwig, Udo W. Lipeck
DAC
2007
ACM
14 years 8 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
KBSE
2007
IEEE
14 years 1 months ago
A dynamic birthmark for java
Code theft is a threat for companies that consider code as a core asset. A birthmark can help them to prove code theft by identifying intrinsic properties of a program. Two progra...
David Schuler, Valentin Dallmeier, Christian Lindi...
SPAA
2003
ACM
14 years 17 days ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin