504 search results - page 77 / 101 » Reasoning about local properties in modal logic |
221
click to vote
POPL
2008
ACM
16 years 2 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
ENTCS
2008
15 years 1 months ago
2008
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
116
Voted
SIGMOD
1998
ACM
15 years 6 months ago
1998
ACM
Most databases contain “name constants” like course numbers, personal names, and place names that correspond to entities in the real world. Previous work in integration of het...
124
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
130
click to vote
LPNMR
1993
Springer
15 years 5 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...