Sciweavers

566 search results - page 70 / 114
» Array Abstractions from Proofs
Sort
View
APLAS
2003
ACM
15 years 1 months ago
Executing Verified Compiler Specification
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...
Koji Okuma, Yasuhiko Minamide
MFCS
2000
Springer
15 years 1 months ago
Bilinear Functions and Trees over the (max, +) Semiring
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 (...
Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse
FORTE
1996
14 years 11 months ago
Applications of Fair Testing
In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the speci cation and analysis of distributed systems. This pre-order com...
Ed Brinksma, Arend Rensink, Walter Vogler
ACTA
2010
81views more  ACTA 2010»
14 years 10 months ago
Lifting non-finite axiomatizability results to extensions of process algebras
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...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
CORR
2008
Springer
132views Education» more  CORR 2008»
14 years 9 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...