Sciweavers

2586 search results - page 20 / 518
» Automatic Abstraction for Congruences
Sort
View
APAL
2006
118views more  APAL 2006»
13 years 7 months ago
Final coalgebras and the Hennessy-Milner property
The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...
Robert Goldblatt
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 7 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
TCS
2008
13 years 7 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
JLP
2007
74views more  JLP 2007»
13 years 7 months ago
Linearity and bisimulation
Exploiting linear type structure, we introduce a new theory bisimilarity for the π-calculus in which we abstract away not only τ-actions but also non-τ actions which do not aff...
Nobuko Yoshida, Kohei Honda, Martin Berger
ICSE
2012
IEEE-ACM
11 years 9 months ago
Axis: Automatically fixing atomicity violations through solving control constraints
Abstract—Atomicity, a general correctness criterion in concurrency programs, is often violated in real-world applications. The violations are difficult for developers to fix, m...
Peng Liu, Charles Zhang