Sciweavers

309 search results - page 52 / 62
» Termination proofs for systems code
Sort
View
ACSAC
2001
IEEE
13 years 11 months ago
Why Information Security is Hard-An Economic Perspective
According to one common view, information security comes down to technical measures. Given better access control policy models, formal proofs of cryptographic protocols, approved ...
Ross J. Anderson
KBSE
1998
IEEE
13 years 12 months ago
Explaining Synthesized Software
Motivated by NASA's need for high-assurance software, NASA Ames' Amphion project has developed a generic program generation system based on deductive synthesis. Amphion ...
Jeffrey Van Baalen, Peter Robinson, Michael R. Low...
KBSE
2007
IEEE
14 years 1 months ago
Assertion-based repair of complex data structures
Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the program state. At such a state, it is standard to term...
Bassem Elkarablieh, Ivan Garcia, Yuk Lai Suen, Sar...
POPL
1989
ACM
13 years 11 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
VL
1996
IEEE
130views Visual Languages» more  VL 1996»
13 years 11 months ago
Seeing Systolic Computations in a Video Game World
ToonTalkTM is a general-purpose concurrent programming system in which the source code is animated and the programming environment is like a me. Every abstract computational aspec...
Kenneth M. Kahn