142 search results - page 12 / 29 » Proving Termination by Invariance Relations |
97
Voted
ESOP
2006
Springer
15 years 1 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
DAM
2010
14 years 10 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
FASE
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
IJBC
2008
14 years 10 months ago
2008
In this work we study some properties associated with the bordercollision bifurcations in a two-dimensional piecewise linear map in canonical form, related to the case in which a ...
PODS
1999
ACM
15 years 2 months ago
1999
ACM
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thi...