3658 search results - page 158 / 732 » The logic of proofs, semantically |
101
Voted
DAC
2007
ACM
16 years 1 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
129
click to vote
CADE
2002
Springer
16 years 1 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...
94
Voted
CONCUR
2004
Springer
15 years 6 months ago
2004
Springer
Existing spatial logics for concurrency are intensional, in the sense that they induce an equivalence that coincides with structural congruence. In this work, we study a contextual...
77
Voted
AML
2007
15 years 26 days ago
2007
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
118
click to vote
LOGCOM
2002
15 years 12 days ago
2002
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...