5506 search results - page 99 / 1102 » Minimal Logic Programs |
207
Voted
POPL
2008
ACM
16 years 1 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...
98
Voted
FOSSACS
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
101
click to vote
ENTCS
2006
15 years 25 days ago
2006
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...
104
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
Lax logical relations are a categorical generalisation of logical relations; though they preserve product types, they need not preserve exponential types. But, like logical relatio...
116
click to vote
ENTCS
2008
15 years 27 days ago
2008
We show how to reason, in the proof assistant Coq, about realistic programming languages using a combination of separation logic and heterogeneous multimodal logic. A heterogeneou...