Sciweavers

2137 search results - page 47 / 428
» Proving Abstract Non-interference
Sort
View
CPP
2011
98views more  CPP 2011»
13 years 9 months ago
Automatically Verifying Typing Constraints for a Data Processing Language
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...
Michael Backes, Catalin Hritcu, Thorsten Tarrach
EMMCVPR
2011
Springer
13 years 9 months ago
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
Abstract. This paper proposes an algorithm for image segmentation using GraphCuts which can be used to efficiently solve labeling problems on high resolution images or resource-lim...
Björn Scheuermann, Bodo Rosenhahn
IACR
2011
108views more  IACR 2011»
13 years 9 months ago
On lower bounds on second-order nonliearities of bent functions obtained by using Niho power functions
Abstract. In this paper we find a lower bound of the second-order nonlinearities of Boolean bent functions of the form f(x) = Trn 1 (α1xd1 + α2xd2 ), where d1 and d2 are Niho ex...
Manish Garg, Sugata Gangopadhyay
SOFSEM
2012
Springer
13 years 5 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
CAV
2012
Springer
198views Hardware» more  CAV 2012»
13 years 12 days ago
Termination Analysis with Algorithmic Learning
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...
Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi