1322 search results - page 195 / 265 » Unsound Theorem Proving |
CADE
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
We present a tool for helping XML schema designers to obtain a high quality level for their specifications. The tool allows one to analyze relations between classes of XML docume...
TLCA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...