3481 search results - page 278 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
128
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
133
click to vote
SEFM
2005
IEEE
15 years 10 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...
108
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
163
click to vote
CONCUR
2005
Springer
15 years 10 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
130
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a mechanised Hoare-style programming logic framework for assembly level programs. The framework has been designed to fit on top of operational semantics of rea...