442 search results - page 40 / 89 » Proof Abstraction for Imperative Languages |
TLDI
2010
ACM
13 years 9 months ago
2010
ACM
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
ISCI
2007
13 years 8 months ago
2007
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
FOSSACS
1998
Springer
14 years 28 days ago
1998
Springer
Abstract. We propose a denotational semantics for the two-level language of [GJ91, Gom92], and prove its correctness w.r.t. a standard denotational semantics. Other researchers (se...
CSFW
2008
IEEE
14 years 3 months ago
2008
IEEE
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
ICFP
2002
ACM
14 years 8 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...