Sciweavers

566 search results - page 68 / 114
» Array Abstractions from Proofs
Sort
View
CBSE
2004
Springer
14 years 1 months ago
Correctness of Component-Based Adaptation
Abstract. Long running applications often need to adapt due to changing requirements or changing environment. Typically, such adaptation is performed by dynamically adding or remov...
Sandeep S. Kulkarni, Karun N. Biyani
FOSSACS
2004
Springer
14 years 1 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König
FOSSACS
2004
Springer
14 years 1 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
TPHOL
2003
IEEE
14 years 27 days ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
DSD
2002
IEEE
102views Hardware» more  DSD 2002»
14 years 18 days ago
Formal Verification of a DSP Chip Using an Iterative Approach
In this paper we describe a methodology for the formal verification of a DSP chip using the HOL theorem prover. We used an iterative method to specify both the behavioral and stru...
Ali Habibi, Sofiène Tahar, Adel Ghazel