Sciweavers

61 search results - page 2 / 13
» Non-computable Julia sets
Sort
View
ICSE
2011
IEEE-ACM
12 years 8 months ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst
CADE
2011
Springer
12 years 5 months ago
Static Analysis of Android Programs
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
Étienne Payet, Fausto Spoto
NDJFL
2010
13 years 1 days ago
Decidability and Computability of Certain Torsion-Free Abelian Groups
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
Rodney G. Downey, Sergei S. Goncharov, Asher M. Ka...
IJBC
2010
84views more  IJBC 2010»
13 years 2 months ago
Asymptotic Values, Prepoles, and Periodic Points
Curves of parameter values for which an asymptotic value of F,(z) = 1 + e-z lies on a pre-pole of arbitrary order are found through an iterative method. Some of these curves are sh...
Jared Whitehead, Lennard Bakker
CORR
2002
Springer
91views Education» more  CORR 2002»
13 years 5 months ago
Quantum Random Walks Hit Exponentially Faster
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
Julia Kempe