309 search results - page 30 / 62 » Termination proofs for systems code |
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
COMPSAC
2009
IEEE
13 years 8 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
JLP
2010
13 years 2 months ago
2010
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
MATA
2004
Springer
14 years 1 months ago
2004
Springer
Mobile agents are software entities consisting of code, data and state that can migrate autonomously from host to host executing their code. Unfortunately, security issues restrict...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
A joint rate-distortion-complexity H.264 motion search framework is proposed to balance the encoder’s coding efficiency and complexity in an embedded system environment. Under ...