Sciweavers

12774 search results - page 84 / 2555
» A Framework for Proof Systems
Sort
View
IJNSEC
2008
150views more  IJNSEC 2008»
13 years 9 months ago
Tamper Resistant Software Through Intent Protection
One approach to protect distributed systems implemented with mobile code is through program obfuscation. Disguising program intent is a form of information hiding that facilitates...
Alec Yasinsac, J. Todd McDonald
ENTCS
2007
101views more  ENTCS 2007»
13 years 9 months ago
Semantic Determinism and Functional Logic Program Properties
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
José Miguel Cleva, Francisco Javier L&oacut...
APAL
2004
105views more  APAL 2004»
13 years 8 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek
JCT
2006
60views more  JCT 2006»
13 years 9 months ago
A simple proof of Graham and Pollak's theorem
Graham and Pollak (Bell System Tech. J. 50 (1971) 2495-2519) obtained a beautiful formula on the determinant of distance matrices of trees, which is independent of the structure o...
Weigen Yan, Yeong-Nan Yeh
FMCO
2009
Springer
120views Formal Methods» more  FMCO 2009»
13 years 6 months ago
A Framework for Reasoning on Component Composition
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing wor...
Ludovic Henrio, Florian Kammüller, Muhammad U...