181 search results - page 36 / 37 » The Justification of Logical Theories based on Data Compress... |
TPHOL
2007
IEEE
13 years 11 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 ...
OOPSLA
2005
Springer
13 years 11 months ago
2005
Springer
Designing component-based application that meets performance requirements remains a challenging problem, and usually requires a prototype to be constructed to benchmark performanc...
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
PLDI
2003
ACM
13 years 10 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
CIKM
2008
Springer
13 years 7 months ago
2008
Springer
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...