14190 search results - page 2491 / 2838 » Abstractions for hybrid systems |
211
click to vote
ESOP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
209
click to vote
ESWS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Computer manipulated social networks are usually built from the explicit assertion by users that they have some relation with other users or by the implicit evidence of s...
246
click to vote
RTA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
214
click to vote
RTA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
209
click to vote
EUROCRYPT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...