Skip to main content

previous disabled Page of 238
and
  1. No Access

    Article

    A model for optimizing indexed file structures

    Multilevel indexes have long been used for accessing records in sorted files. Given the access cost at each level, the total cost of retrieving a record from the file can be substantially reduced by selecting ...

    Ben Shneiderman in International Journal of Computer & Information Sciences (1974)

  2. No Access

    Article

    The verification and synthesis of data structures

    The concept of machine extension is a commonly used technique for implementing complex software: sets of object classes and operations on these objects are defined and used, often in a layered fashion, to cons...

    Jay Spitzen, Ben Wegbreit in Acta Informatica (1975)

  3. No Access

    Article

    Toward a theory of encoded data structures and data translation

    Several models of data base systems have distinguished levels of abstraction ranging from the high-level entity set model down to the low-level physical device level. This paper presents a model for describing...

    Ben Shneiderman, Stuart C. Shapiro in International Journal of Computer & Inform… (1976)

  4. No Access

    Article

    Exploratory experiments in programmer behavior

    The techniques of cognitive psychological experimentation can help resolve specific issues in programming and explore the broader issues of programmer behavior. This paper describes the methodological question...

    Ben Shneiderman in International Journal of Computer & Information Sciences (1976)

  5. No Access

    Article

    Ianov pushdown schemes are contained in boolean recursive schemes

    The class of Ianov schemes augmented by a pushdown memory is effectively translatable into the class of right linear boolean monadic recursive schemes. This proves a conjecture of Tokura, Kasami and Furuta [3].

    Mordechai Ben-Ari in Acta Informatica (1978)

  6. No Access

    Article

    Syntactic/semantic interactions in programmer behavior: A model and experimental results

    This paper presents a cognitive framework for describing behaviors involved in program composition, comprehension, debugging, modification, and the acquisition of new programming concepts, skills, and knowledg...

    Ben Shneiderman, Richard Mayer in International Journal of Computer & Information Sciences (1979)

  7. No Access

    Article

    “U. S. Science in international perspective”

    This is an investigation of the relationship between the institutional structure of American science and its position in world science, as shown byScience Indicators — 1976. It concludes that, compared to other c...

    J. Ben-David in Scientometrics (1980)

  8. Chapter and Conference Paper

    Finite models for deterministic propositional dynamic logic

    Mordechai Ben-Ari, Joseph Y. Halpern, Amir Pnueli in Automata, Languages and Programming (1981)

  9. No Access

    Chapter and Conference Paper

    On-the-fly garbage collection: New algorithms inspired by program proofs

    New algorithms for on-the-fly garbage collection have been presented. The basic algorithm has a correctness proof that is much simpler than that of the DLMSS algorithm. In (2), the color gray is introduced so ...

    Mordechai Ben-Ari in Automata, Languages and Programming (1982)

  10. No Access

    Chapter and Conference Paper

    Human factors of interactive software

    There is intense interest about human factors issues in interactive computer systems for life-critical applications, industrial/commercial uses, and personal computing in the office or home. Primary design goa...

    Ben Shneiderman in Enduser Systems and Their Human Factors (1983)

  11. No Access

    Chapter and Conference Paper

    A hardware semantics based on temporal intervals

    We present an interval-based temporal logic that permits the rigorous specification of a variety of hardware components and facilitates proving properties such as correctness of implementation. Conceptual leve...

    Joseph Halpern, Zohar Manna, Ben Moszkowski in Automata, Languages and Programming (1983)

  12. No Access

    Article

    The temporal logic of branching time

    A temporal logic is defined which contains both linear and branching operators. The underlying model is the tree of all possible computations. The following metatheoretical results are proven: 1) an exponentia...

    Mordechai Ben-Ari, Amir Pnueli, Zohar Manna in Acta Informatica (1983)

  13. No Access

    Chapter and Conference Paper

    Reasoning in interval temporal logic

    Predicate logic is a powerful and general descriptive formalism with a long history of development. However, since the logic's underlying semantics have no notion of time, statements such as “I increases by 2” ca...

    Ben Moszkowski, Zohar Manna in Logics of Programs (1984)

  14. No Access

    Chapter and Conference Paper

    A temporal analysis of some concurrent systems

    In previous work, we presented interval temporal logic (ITL), a formal logic for reasoning about time. It was shown that ITL provides a way to view programming constructs for assignment, repetition and paralle...

    Ben Moszkowski in The Analysis of Concurrent Systems (1985)

  15. No Access

    Chapter and Conference Paper

    A fair protocol for signing contracts

    Assume that two parties, A and B, want to sign a contract over a communication network, i.e. they want to exchange their “commitments“ to the contract. We consider a contract signing protocol to be fair if, at an...

    Michael Ben-Or, Oded Goldreich, Silvio Micali in Automata, Languages and Programming (1985)

  16. No Access

    Chapter and Conference Paper

    Executing temporal logic programs

    Over the last few years, temporal logic has been investigated as a tool for reasoning about computer programs, digital circuits and message-passing systems. In the case of programs, the general feeling has bee...

    Ben Moszkowski in Seminar on Concurrency (1985)

  17. No Access

    Chapter

    The Way You Look Determines What You See Or Self-Organization in Management and Society

    The concept of self-organization is reviewed and its implications are explored in relation to management processes and social systems. A world view is taken, emphasizing a descriptive distinction of levels ass...

    Michael U. Ben-Eli, Gilbert J. B. Probst in Cybernetics and Systems ’86 (1986)

  18. No Access

    Chapter and Conference Paper

    Parallel programming in Temporal Logic

    Roger Hale, Ben Moszkowski in PARLE Parallel Architectures and Languages Europe (1987)

  19. No Access

    Chapter and Conference Paper

    IAI Corporate Software Engineering Training & Education Program

    ISRAEL AIRCRAFT INDUSTRIES has developed a comprehensive educational program in software engineering. Goals of the program include: the retraining of college graduates to become software engineers with special...

    Jonah Z. Lavi, Moshe I. Ben Porat in Issues in Software Engineering Education (1989)

  20. No Access

    Chapter and Conference Paper

    A Dynamic Approach to Oligopolistic Market Equilibrium

    We provide an algorithm for computing Cournot-Nash equilibria in multi-commodity markets involving finitely many producers. The algorithm amounts to follow a certain dynamical system all the way to its steady ...

    Adi Ben-Israel, Sjur D. Flåm in Algorithms and Model Formulations in Mathe… (1989)

previous disabled Page of 238