Sciweavers

4099 search results - page 353 / 820
» A Framework for Interactive Proof
Sort
View
IJNSEC
2008
150views more  IJNSEC 2008»
15 years 6 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»
15 years 6 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...
208
Voted
IANDC
2007
133views more  IANDC 2007»
15 years 6 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
149
Voted
APAL
2004
105views more  APAL 2004»
15 years 6 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
187
Voted
JOOP
1998
86views more  JOOP 1998»
15 years 6 months ago
Prelude to a Theory of Void
A set of rules to ascertain that in calls of the form x.f (...) there will always be an object attached to x. 1 PURPOSE The theory developed in this article investigates void call...
Bertrand Meyer