1941 search results - page 114 / 389 » Reasoning about Computations Using Two-Levels of Logic |
163
click to vote
CSL
2004
Springer
15 years 11 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
176
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
153
click to vote
IJCAI
2007
15 years 7 months ago
2007
We combine the modal logic S5 with the description logic (DL) ALCQI. In this way, we obtain a multi-dimensional DL, S5ALCQI, whose purpose is reasoning about change. S5ALCQI is ca...
143
click to vote
ENTCS
2007
15 years 6 months ago
2007
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
146
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...