797 search results - page 62 / 160 » Eliminating Proofs from Programs |
128
click to vote
SCCC
2005
IEEE
15 years 6 months ago
2005
IEEE
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
143
Voted
ACSAC
2010
IEEE
14 years 10 months ago
2010
IEEE
Despite the numerous prevention and protection mechanisms that have been introduced into modern operating systems, the exploitation of memory corruption vulnerabilities still repr...
162
Voted
POPL
2005
ACM
16 years 1 months ago
2005
ACM
In 1996, Gil and Lorenz proposed programming language constructs for specifying environmental acquisition in addition to inheritance acquisition for objects. They noticed that in ...
97
Voted
FOAL
2008
ACM
15 years 2 months ago
2008
ACM
Aspect Oriented Programming (AOP) has significant potential to separate functionality and cross-cutting concerns. In particular, AOP supports an incremental development process, i...
101
Voted
GI
2009
Springer
15 years 5 months ago
2009
Springer
Abstract: Free theorems establish interesting properties of parametrically polymorphic functions, solely from their types, and serve as a nice proof tool. For pure and lazy functio...