193 search results - page 5 / 39 » Decidable logics combining heap structures and data |
151
Voted
ATVA
2007
Springer
15 years 8 months ago
2007
Springer
Automated software verification has made great progress recently, and a key enabler of this progress has been the advances in efficient, automated decision procedures suitable fo...
126
Voted
FROCOS
2007
Springer
15 years 8 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
233
Voted
POPL
2008
ACM
16 years 2 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
136
Voted
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
106
Voted
VMCAI
2009
Springer
15 years 9 months ago
2009
Springer
Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established ...