scispace - formally typeset
Search or ask a question
Topic

State (computer science)

About: State (computer science) is a research topic. Over the lifetime, 24436 publications have been published within this topic receiving 225733 citations.


Papers
More filters
Patent
19 Dec 2008
TL;DR: In this paper, a mobile communication device receives current information while the mobile device is in one of a sleep state or a locked state, and associates one or more portions of the current information with corresponding windows.
Abstract: A mobile communication device receives current information while the mobile communication device is in one of a sleep state or a locked state, and associates one or more portions of the current information with one or more corresponding windows. The mobile communication device also displays, via a display associated with the mobile communication device, the one or more corresponding windows and the one or more associated portions of the current information while the mobile communication device is in the locked state. The mobile communication device further enables a user associated with the mobile communication device to manipulate the one or more displayed corresponding windows while the mobile communication device is in the locked state.

222 citations

Patent
01 May 2012
TL;DR: In this article, a first client device or system performs a method that includes retaining in memory registration information for a respective application indicating the respective application is registered for sharing application state with other client devices or systems.
Abstract: A first client device or system performs a method that includes retaining in memory registration information for a respective application indicating the respective application is registered for sharing application state with other client devices or systems. The method further includes storing an application state of a respective application, and detecting a transfer triggering condition. The transfer triggering condition includes presence of a second client device or system within a predefined proximity of the first client device or system, and the predefined proximity is a predefined proximity for near field communication. Furthermore, upon detecting the triggering condition, the first client device or system determines, in accordance with the stored registration information, that the respective application is registered for application state sharing, and transmits the application state of the respective application to the second client device or system.

222 citations

Patent
09 Aug 2002
TL;DR: An application programming interface as mentioned in this paper implements a method for transparently switching from one communication protocol to another and for restoring the state of a previous connection on a local, client computer, as well as remote computers.
Abstract: An application programming interface implements a method for transparently switching from one communication protocol to another and for restoring the state of a previous connection. The application programming interface executes on a local, client computer, as well as remote computers. It includes functions that multi-user application programs can call to communicate in a device independent manner with other applications executing on remote computers. To support communication on a variety of different computer communication protocols, the application programming interface accesses programs called service providers that implement the communication protocols and support the message passing model of the interface. The application programming interface can transparently switch the protocol on a remote computer by sending a system message to a compatible version of the interface on the remote computer that includes an identifier of the service provider for the new protocol. In response to the message, the application programming interface loads the new service provider and takes steps to set-up a new connection. The application programming interface can also restore the state of previous connection on a remote computer by sending a system message. In response to this message, the application programming interface on the remote computer retrieves the previous connection state from an MRU stack and loads the service provider for the previous connection.

221 citations

Proceedings ArticleDOI
01 Jan 2019
TL;DR: The prototype implementation of REDQUEEN, a lightweight, yet very effective alternative to taint tracking and symbolic execution to facilitate and optimize state-of-the-art feedback fuzzing that easily scales to large binary applications and unknown environments, is introduced.
Abstract: Automated software testing based on fuzzing has experienced a revival in recent years. Especially feedback-driven fuzzing has become well-known for its ability to efficiently perform randomized testing with limited input corpora. Despite a lot of progress, two common problems are magic numbers and (nested) checksums. Computationally expensive methods such as taint tracking and symbolic execution are typically used to overcome such roadblocks. Unfortunately, such methods often require access to source code, a rather precise description of the environment (e.g., behavior of library calls or the underlying OS), or the exact semantics of the platform’s instruction set. In this paper, we introduce a lightweight, yet very effective alternative to taint tracking and symbolic execution to facilitate and optimize state-of-the-art feedback fuzzing that easily scales to large binary applications and unknown environments. We observe that during the execution of a given program, parts of the input often end up directly (i.e., nearly unmodified) in the program state. This input-to-state correspondence can be exploited to create a robust method to overcome common fuzzing roadblocks in a highly effective and efficient manner. Our prototype implementation, called REDQUEEN, is able to solve magic bytes and (nested) checksum tests automatically for a given binary executable. Additionally, we show that our techniques outperform various state-of-the-art tools on a wide variety of targets across different privilege levels (kernel-space and userland) with no platform-specific code. REDQUEEN is the first method to find more than 100% of the bugs planted in LAVA-M across all targets. Furthermore, we were able to discover 65 new bugs and obtained 16 CVEs in multiple programs and OS kernel drivers. Finally, our evaluation demonstrates that REDQUEEN is fast, widely applicable and outperforms concurrent approaches by up to three orders of magnitude.

218 citations

Patent
01 Dec 2003
TL;DR: In this paper, the authors present a "smart verify" technique whereby multi-state memories are programmed using a verify-results-based dynamic adjustment of the multi-states verify range for sequential-state-based verify implementations.
Abstract: The present invention presents a “smart verify” technique whereby multi-state memories are programmed using a verify-results-based dynamic adjustment of the multi-states verify range for sequential-state-based verify implementations. This technique can increase multi-state write speed while maintaining reliable operation within sequentially verified, multi-state memory implementations. It does so by providing “intelligent” means to minimize the number of sequential verify operations for each program/verify/lockout step of the write sequence. In an exemplary embodiment of the write sequence for the multi-state memory during a program/verify cycle sequence of the selected storage elements, at the beginning of the process only the lowest state of the multi-state range to which the selected storage elements are being programmed is checked during the verify phase. Once the first storage state is reached by one or more of the selected elements, the next state in the sequence of multi-states is added to the verify process. This next state can either be added immediately upon the fastest elements reaching this preceding state in the sequence or after a delay of several program cycles. The adding of states to the set being checked in the verify phase continues through the rest of the set of multi-states in sequence, until the highest state has been added. Additionally, lower states can be removed from the verify set as all of the selected storage elements bound for these levels verify successfully to those target values and are locked out from further programming.

217 citations


Network Information
Related Topics (5)
Formal specification
18.3K papers, 370.6K citations
76% related
Model checking
16.9K papers, 451.6K citations
74% related
Software development
73.8K papers, 1.4M citations
73% related
Software construction
36.2K papers, 743.8K citations
72% related
Concurrency
13K papers, 347.1K citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20251
202426
202314,059
202232,515
2021467
2020690