2473 search results - page 40 / 495 » The Logic of Communication Graphs |
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
CNSR
2005
IEEE
14 years 1 months ago
2005
IEEE
APSEC
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper, we present a temporal logic called F whose interpretation is over Input Output Symbolic Transition Systems (IOSTS). IOSTS extend transition systems to communicat...
JCT
2007
13 years 7 months ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...