2585 search results - page 176 / 517 » Automating Coherent Logic |
188
click to vote
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper presents various semantic interpretations for logics of knowledge and time with prefect recall. We allow both past and future operators and examine the interpretation...
147
click to vote
TPHOL
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. This paper presents a separation-logic framework for reasoning about low-level C code in the presence of virtual memory. We describe ract, generic Isabelle/HOL framework ...
188
click to vote
LOPSTR
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
192
click to vote
TIME
2007
IEEE
16 years 23 days ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
191
click to vote
CSL
2007
Springer
16 years 20 days ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...