Sciweavers

2043 search results - page 164 / 409
» Reasoning About Security Models
Sort
View
NSPW
2003
ACM
15 years 6 months ago
SELF: a transparent security extension for ELF binaries
The ability to analyze and modify binaries is often very useful from a security viewpoint. Security operations one would like to perform on binaries include the ability to extract...
Daniel C. DuVarney, V. N. Venkatakrishnan, Sandeep...
116
Voted
IADIS
2004
15 years 2 months ago
A Middleware Service for Managing Time and Quality Dependent Context
Nowadays, wearable devices, such as mobile phones, PDAs, etc. gain widespread popularity for communication and data exchange. Consequently, several approaches investigate the prob...
Tasos Kontogiorgis, Dimitrios I. Fotiadis, Apostol...
216
Voted
PLDI
2009
ACM
16 years 1 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
109
Voted
NFM
2011
252views Formal Methods» more  NFM 2011»
14 years 8 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
109
Voted
LICS
1999
IEEE
15 years 5 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese