Sciweavers

2947 search results - page 78 / 590
» Analyzing Program Analyses
Sort
View
FSTTCS
2001
Springer
15 years 7 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
FSS
2007
89views more  FSS 2007»
15 years 2 months ago
Fuzzy logic programming via multilattices
We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logic programming framework. On the one hand, some theoretical results about ideals o...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
111
Voted
VL
2007
IEEE
122views Visual Languages» more  VL 2007»
15 years 8 months ago
Children as Unwitting End-User Programmers
Children who are active on the internet are performing significant design and programming activity without realising it, in the course of hacking little animations, game scripts a...
Marian Petre, Alan F. Blackwell
107
Voted
KBSE
2007
IEEE
15 years 8 months ago
Tool support for the compile-time execution structure of object-oriented programs with ownership annotations
Ownership domain annotations enable obtaining at compiletime the system’s execution structure from the annotated program. The execution structure is sound, hierarchical (and thu...
Marwan Abi-Antoun, Jonathan Aldrich
ESORICS
2007
Springer
15 years 8 months ago
Obligations and Their Interaction with Programs
Obligations are pervasive in modern systems, often linked to access control decisions. We present a very general model of obligations as objects with state, and discuss its interac...
Daniel J. Dougherty, Kathi Fisler, Shriram Krishna...