12194 search results - page 115 / 2439 » cans 2010 |
ENTCS
2007
13 years 10 months ago
2007
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
ENTCS
2007
13 years 10 months ago
2007
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
ENTCS
2007
13 years 10 months ago
2007
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλ∆ of Miller and Tiu, with an induction principle. The logic FOλ∆ is itself an...
ENTCS
2007
13 years 10 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
ENTCS
2007
13 years 10 months ago
2007
Many modern program verifiers translate the program to be verified and its specification into a simple intermediate representation and then compute verification conditions on ...