Sciweavers

5084 search results - page 172 / 1017
» Proving Possibility Properties
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 6 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
JUCS
2006
131views more  JUCS 2006»
15 years 6 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 4 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
IJNSEC
2010
133views more  IJNSEC 2010»
15 years 1 months ago
Verifiable Attribute Based Encryption
In this paper, we construct two verifiable attribute-based encryption (VABE) schemes. One is with a single authority, and the other is with multi authorities. Not only our schemes ...
Qiang Tang, Dongyao Ji
SOCA
2007
IEEE
16 years 19 days ago
Static Analysis of Business Artifact-centric Operational Models
Business Artifacts are the core entities used by businesses to record information pertinent to their operations. Business operational models are representations of the processing ...
Cagdas E. Gerede, Kamal Bhattacharya, Jianwen Su