899 search results - page 40 / 180 » A CTL-Based Logic for Program Abstractions |
147
Voted
CONCUR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
110
click to vote
EUROGP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
LPNMR
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
123
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
130
click to vote
CADE
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...