899 search results - page 59 / 180 » A CTL-Based Logic for Program Abstractions |
143
Voted
AGP
1994
IEEE
15 years 7 months ago
1994
IEEE
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
126
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
132
click to vote
SEFM
2005
IEEE
15 years 9 months ago
2005
IEEE
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
177
click to vote
JCST
2010
14 years 10 months ago
2010
With recent efforts to build foundational certified software systems, two different approaches have been proposed to certify thread context switching. One is to certify both thread...
138
click to vote
LPNMR
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...