88 search results - page 7 / 18 » Proving the Correctness of the STG Machine |
PLDI
2000
ACM
14 years 3 days ago
2000
ACM
We show how to determine statically whether it is safe for untrusted machine code to be loaded into a trusted host system. Our safety-checking technique operates directly on the u...
TPHOL
2007
IEEE
14 years 2 months ago
2007
IEEE
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
FMOODS
2008
13 years 9 months ago
2008
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
DAC
1994
ACM
13 years 12 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
ECCC
2007
13 years 7 months ago
2007
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...