Sciweavers

261 search results - page 51 / 53
» Formal Proof from UML Models
Sort
View
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 9 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
ASE
2004
108views more  ASE 2004»
13 years 8 months ago
CODEWEAVE: Exploring Fine-Grained Mobility of Code
er is concerned with an abstract exploration of code mobility constructs designed for use in settings where the level of granularity associated with the mobile units exhibits sign...
Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin ...
JELIA
2010
Springer
13 years 7 months ago
Stable Belief Sets Revisited
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
Costas D. Koutras, Yorgos Zikos
EMSOFT
2007
Springer
14 years 15 days ago
Verification of device drivers and intelligent controllers: a case study
The soundness of device drivers generally cannot be verified in isolation, but has to take into account the reactions of the hardware devices. In critical embedded systems, interf...
David Monniaux
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
14 years 19 days ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani