Sciweavers

1133 search results - page 41 / 227
» Local Logics for Traces
Sort
View
ENTCS
2007
124views more  ENTCS 2007»
15 years 19 days ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
143
Voted
TCAD
2010
136views more  TCAD 2010»
14 years 7 months ago
Bounded Model Debugging
Design debugging is a major bottleneck in modern VLSI design flows as both the design size and the length of the error trace contribute to its inherent complexity. With typical des...
Brian Keng, Sean Safarpour, Andreas G. Veneris
130
Voted
DLOG
2011
14 years 4 months ago
Local Closed World Semantics: Keep it simple, stupid!
A combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web app...
Adila Alfa Krisnadhi, Kunal Sengupta, Pascal Hitzl...
91
Voted
JSYML
2010
68views more  JSYML 2010»
14 years 7 months ago
Stability and stable groups in continuous logic
We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.
Itaï Ben Yaacov
MICCAI
2009
Springer
16 years 1 months ago
Two-Tensor Tractography Using a Constrained Filter
We describe a technique to simultaneously estimate a weighted, positive-definite multi-tensor fiber model and perform tractography. Existing techniques estimate the local fiber ori...
James G. Malcolm, Martha Elizabeth Shenton, Yoge...