13383 search results - page 146 / 2677 » Abstractions from proofs |
156
click to vote
HYBRID
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
147
click to vote
CSCLP
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
166
click to vote
APLAS
2003
ACM
15 years 9 months ago
2003
ACM
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
128
click to vote
MFCS
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
134
click to vote
ACTA
2010
15 years 6 months ago
2010
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...