Sciweavers

4386 search results - page 668 / 878
» A Tamper-Resistant Programming Language System
Sort
View
ICALP
2007
Springer
15 years 9 months ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret
UM
2005
Springer
15 years 9 months ago
User Control over User Adaptation: A Case Study
The A theory of user expectation of system interaction is introduced in the context of User Adapted Interfaces. The usability of an intelligent email client that learns to filter s...
Xiaoyan Peng, Daniel L. Silver
APLAS
2003
ACM
15 years 8 months ago
Controlling and Optimizing the Usage of One Resource
This paper studies the problem of resource availability in the context of mobile code for embedded systems such as smart cards. It presents an architecture dedicated to controlling...
Antoine Galland, Mathieu Baudet
122
Voted
ICSE
1994
IEEE-ACM
15 years 7 months ago
Formalizing Architectural Connection
As software systems become more complex the overall system structure { or software architecture { becomes a central design problem. An important step towards an engineering discip...
Robert J. Allen, David Garlan
144
Voted
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 3 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui