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.

Method for continuously processing electronic messages throughout a transition between online and offline states

Abstract: An electronic mail (e-mail) application program includes a configurable, e-mail messaging feature for automatically responding to a portable computer's transition between online and offline states. The e-mail application program determines the state of a connection between a portable computer and an electronic mail server and processes electronic messages in accordance with the appropriate state. The portable computer's transition between an online state and an offline state triggers a user-configurable response, designed to permit the continuation of electronic mail message processing in a manner that accommodates the state change. The e-mail application program responds to such a transition by automatically switching between online and offline modes of operation. The e-mail application program can also respond to such a transition by establishing a secondary connection to a mail server when a primary connection is rendered inoperative. A user may configure various aspects of the invention to respond to a transition in a way that accommodates the user's hardware and/or software requirements.

Distributed information processing system providing a resume function and resume method for the distributed information processing system

Abstract: A distributed information processing system which includes a server having a resume-request processor and clients having resume-request units or processor. An user at the client site operates a resume switch to save an operation state of the client in the server's magnetic disc, and resume it from the server's magnetic disc. The operation state includes contents of the main memory, contents of the display memory, values of the I/O registers for peripheral devices, and information about the file of the server being used by the application program run by the user. The user is able to use any client of the system in the same situation including a connection state between the file and the application program as before.

System design of a computer for time sharing applications

Abstract: In the late spring and early summer of 1964 it became obvious that greater facility in the computing system was required if time-sharing techniques were to move from the state of an interesting pilot experiment into that of a useful prototype for remote access computer systems. Investigation proved computers that were immediately available could not be adapted readily to meet the difficult set of requirements time-sharing places on any machine. However, there was one system that appeared to be extendible into what was desired. This machine was the General Electric 635. The 635 is a single address stored program computer with a word length of 36 bits. It possessed many of the characteristics that were deemed necessary for the application of a computer to time-sharing. The three most important characteristics are:1. A clean and comprehensive order code,2. a multiprocessor capability, and3. nonsynchronous design.

Measurement of digital circuit simulation test coverage utilizing BDDs and state bins

Abstract: Measurement of the test coverage of digital simulation of electronic circuitry is obtained (54). A Composite Circuit Model (60) has two parts: a Target Circuit Model (64) and an Environment Circuit Model (62). The Environment Circuit Model (62) models the behavior of inputs to the Target Circuit (64). The Composite Circuit Model (60) is translated into implicit FSM representations utilizing BDDs. A State Bin Transition Relation is formed which represents allowable transitions among user-specified sets of states or State Bins, and a representation of the reachable State Bins is built (94). A comparison is made (102) between data accumulated over one or more simulations (40) of the Target Circuit (64) and the data contained in the State Bin Transition Relation and the representation of the reachable State Bins. Output (52) is then generated showing which sets of circuit states were and weren't visited and which transitions allowed by the State Bin Transition Relation were and weren't taken during the simulations.

Lazy Infinite-State Analysis of Security Protocols

Abstract: Security protocols are used to exchange information in a distributed system with the aim of providing security guarantees. We present an approach to modeling security protocols using lazy data types in a higher-order functional programming language. Our approach supports the formalization of protocol models in a natural and high-level way, and the automated analysis of safety properties using infinite-state model checking, where the model is explicitly constructed in a demand-driven manner. We illustrate these ideas with an extended example: modeling and checking the Needham-Schroeder public-key authentication protocol.