799 search results - page 45 / 160 » A Logic for Abstract State Machines |
ACL
2009
14 years 7 months ago
2009
This paper presents three methods that can be used to recognize paraphrases. They all employ string similarity measures apshallow abstractions of the input sentences, and a Maximu...
CONCUR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
178
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
APAL
2006
14 years 9 months ago
2006
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...