Sciweavers

1760 search results - page 165 / 352
» A System to Mark Programs Automatically
Sort
View
IPPS
1998
IEEE
15 years 7 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
ENTCS
2008
94views more  ENTCS 2008»
15 years 3 months ago
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
Hendrik Tews, Tjark Weber, Marcus Völp
MOZ
2004
Springer
15 years 8 months ago
The Structure of Authority: Why Security Is Not a Separable Concern
Common programming practice grants excess authority for the sake of functionality; programming principles require least authority for the sake of security. If we practice our princ...
Mark S. Miller, Bill Tulloh, Jonathan S. Shapiro
158
Voted
MOBISEC
2009
Springer
15 years 9 months ago
Context-Aware Monitoring of Untrusted Mobile Applications
Abstract. Current measures to enhance the security of untrusted mobile applications require a user to trust the software vendor. They do not guarantee complete protection against t...
Andrew Brown, Mark Ryan
132
Voted
GPCE
2007
Springer
15 years 9 months ago
Repleo: a syntax-safe template engine
Templates are a very common solution to generate code. They are used for different tasks like rendering webpages, creating Java Beans and so on. Most template systems have no noti...
Jeroen Arnoldus, Jeanot Bijpost, Mark van den Bran...