2145 search results - page 31 / 429 » Lax Logical Relations |
261
click to vote
POPL
2007
ACM
16 years 4 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
144
Voted
CADE
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
126
click to vote
JOLLI
2008
15 years 4 months ago
2008
In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive log...
124
click to vote
CAISE
2007
Springer
15 years 10 months ago
2007
Springer
In a series of publications, we have proposed a foundational system of ontological categories which has been used to evaluate and improve the quality of conceptual modeling languag...
138
click to vote
PSSS
2003
15 years 5 months ago
2003
Abstract: We present DLDB, a knowledge base system that extends a relational database management system with additional capabilities for DAML+OIL inference. We discuss a number of ...