Sciweavers

458 search results - page 36 / 92
» Symbolic Object Code Analysis
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
13 years 8 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
ACSC
2006
IEEE
14 years 2 months ago
Manufacturing opaque predicates in distributed systems for code obfuscation
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...
Anirban Majumdar, Clark D. Thomborson
IJNSEC
2008
190views more  IJNSEC 2008»
13 years 8 months ago
Probabilistic Analysis and Verification of the ASW Protocol using PRISM
The ASW protocol is one of the prominent optimistic fair exchange protocols that is used for contract signing between two participants, the originator and the responder, with the ...
Salekul Islam, Mohammad Abu Zaid
ICMCS
2006
IEEE
152views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Coding Artifact Reduction using Non-Reference Block Grid Visibility Measure
In this work a new method is proposed for coding artifact reduction of MPEG compressed video sequences. The method makes use of a simple cost-effective technique that allows the b...
Ihor O. Kirenko, Remco Muijs, Ling Shao
FM
2009
Springer
92views Formal Methods» more  FM 2009»
14 years 3 months ago
Field-Sensitive Value Analysis by Field-Insensitive Analysis
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...