1226 search results - page 80 / 246 » Proofs, Programs and Abstract Complexity |
165
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
134
click to vote
CADE
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
135
Voted
SEFM
2009
IEEE
15 years 10 months ago
2009
IEEE
—In the modern car, electronic devices are even employed for safety-critical missions like brake control, where failures might cost human lives. Among various approaches to incre...
124
click to vote
CIE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
126
click to vote
IFIPTCS
2010
15 years 1 months ago
2010
Abstract. We investigate systematically into the various possible notions of traceable sets and the relations they bear to each other and to other notions such as diagonally noncom...