67 search results - page 11 / 14 » A Verification Technique Using Term Rewriting Systems and Ab... |
118
click to vote
SIGSOFT
2003
ACM
16 years 11 days ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
ICFEM
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
107
click to vote
RTA
2010
Springer
15 years 3 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...
102
click to vote
ENTCS
2008
14 years 11 months ago
2008
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
189
click to vote
POPL
2007
ACM
15 years 12 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...