55 search results - page 6 / 11 » A Hoare Logic for the State Monad |
CSL
2009
Springer
15 years 6 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
105
click to vote
ECCC
2010
14 years 10 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
117
click to vote
BIRTHDAY
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
104
click to vote
VSTTE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. The Composite design pattern is an exemplar of specification and verification challenges for sequential object-oriented programs. Region logic is a Hoare logic augmente...
ENTCS
2008
14 years 11 months ago
2008
This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes. It extends separation logic by an operator for sepa...