1206 search results - page 93 / 242 » Concurrent Abstract Predicates |
116
Voted
LICS
1991
IEEE
15 years 6 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
100
click to vote
ICFP
2006
ACM
16 years 2 months ago
2006
ACM
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
105
click to vote
CIE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
135
Voted
KBSE
2007
IEEE
15 years 8 months ago
2007
IEEE
We describe EUREKA, a symbolic model checker for Linear Programs with arrays, i.e. programs where variables and array elements range over a numeric domain and expressions involve ...
131
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...