Home

Select data courtesy of the U.S. National Library of Medicine.

Home

ACM Computing Surveys (CSUR) | DeepDyve

ACM Computing Surveys (CSUR)

Subject:: Computer Science (miscellaneous)
Publisher:: Association for Computing Machinery — Association for Computing Machinery
ISSN:: 0360-0300
Scimago Journal Rank:: 172

2025

Volume 58

Issue 6 (Dec)Issue 5 (Nov)Issue 4 (Oct)Issue 3 (Sep)Issue 2 (Sep)Issue 1 (Sep)

Volume 57

Issue 12 (Jul)Issue 11 (Jun)Issue 10 (May)Issue 9 (Apr)Issue 8 (Mar)Issue 7 (Feb)Issue 6 (Feb)Issue 5 (Jan)

2024

Volume 57

Issue 4 (Dec)Issue 3 (Nov)Issue 2 (Oct)Issue 1 (Oct)

Volume 56

Issue 12 (Oct)Issue 11 (Jun)Issue 10 (May)Issue 9 (Apr)Issue 8 (Apr)Issue 7 (Apr)Issue 6 (Feb)Issue 5 (Jan)

2023

Volume 56

Issue 5 (Nov)Issue 4 (Nov)Issue 3 (Oct)Issue 2 (Sep)Issue 1 (Aug)

Volume 55

Issue 14s (Jul)Issue 13s (Jul)Issue 12 (Mar)Issue 11 (Feb)Issue 10 (Feb)Issue 9 (Jan)

2022

Volume 55

Issue 8 (Dec)Issue 7 (Dec)Issue 6 (Dec)Issue 5 (Dec)Issue 4 (Nov)Issue 3 (Feb)Issue 2 (Jan)Issue 1 (Jan)

Volume 54

Issue 11s (Sep)Issue 10s (Sep)

2021

Volume 55

Issue 1 (Nov)

Volume 54

Issue 9 (Oct)Issue 8 (Oct)Issue 7 (Sep)Issue 6 (Jul)Issue 5 (May)Issue 4 (May)Issue 3 (May)Issue 2 (Mar)Issue 1 (Jan)

Volume 53

Issue 6 (Feb)

2020

Volume 2020

Issue 2004 (Apr)

Volume 53

Issue 6 (Dec)Issue 5 (Sep)Issue 4 (Aug)Issue 3 (May)Issue 2 (Apr)Issue 1 (Feb)

2019

Volume 2019

Issue 1909 (Sep)Issue 1904 (Apr)

Volume 52

Issue 6 (Nov)Issue 5 (Sep)Issue 4 (Aug)Issue 3 (Jun)Issue 2 (Apr)Issue 1 (Feb)

Volume 51

Issue 6 (Jan)

2018

Volume 2018

Issue 1810 (Oct)Issue 1809 (Sep)

Volume 51

Issue 5 (Sep)Issue 4 (Jul)Issue 3 (Jun)Issue 2 (Mar)Issue 1 (Feb)

Volume 50

Issue 6 (Jan)

2017

Volume 50

Issue 6 (Nov)Issue 5 (Sep)Issue 4 (Aug)Issue 3 (Jun)Issue 2 (Apr)Issue 1 (Mar)

Volume 49

Issue 4 (Jan)

2016

Volume 49

Issue 4 (Dec)Issue 3 (Dec)Issue 2 (Aug)Issue 1 (Jun)

Volume 48

Issue 4 (Mar)Issue 3 (Feb)

2015

Volume 48

Issue 3 (Dec)Issue 2 (Nov)Issue 1 (Sep)

Volume 47

Issue 4 (May)Issue 3 (Feb)Issue 2 (Jan)

2014

Volume 47

Issue 2 (Aug)Issue 1 (May)

Volume 46

Issue 4 (Mar)Issue 3 (Jan)

2013

Volume 46

Issue 2 (Nov)Issue 1 (Oct)

Volume 45

Issue 4 (Aug)Issue 3 (Jun)Issue 2 (Feb)

2012

Volume 45

Issue 1 (Nov)

Volume 44

Issue 4 (Aug)Issue 3 (Jun)Issue 2 (Feb)Issue 1 (Jan)

2011

Volume 43

Issue 4 (Oct)Issue 3 (Apr)Issue 2 (Jan)

2010

Volume 43

Issue 1 (Nov)

Volume 42

Issue 4 (Jun)Issue 3 (Mar)Issue 2 (Feb)

2009

Volume 42

Issue 1 (Dec)

Volume 41

Issue 4 (Oct)Issue 3 (Jul)Issue 2 (Feb)Issue 1 (Jan)

2008

Volume 40

Issue 4 (Oct)Issue 3 (Aug)Issue 2 (Apr)Issue 1 (Feb)

2007

Volume 39

Issue 4 (Nov)Issue 3 (Sep)Issue 2 (Jul)Issue 1 (Apr)

2006

Volume 38

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jul)Issue 1 (Jun)

2005

Volume 37

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

2004

Volume 36

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

2003

Volume 35

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

2002

Volume 34

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

2001

Volume 33

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

2000

Volume 32

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1es (Mar)Issue 1 (Mar)

1999

Volume 31

Issue 4es (Dec)Issue 4 (Dec)Issue 3es (Sep)Issue 3 (Sep)Issue 2es (Jun)Issue 2 (Jun)Issue 1 (Mar)

1998

Volume 30

Issue 4 (Dec)Issue 3es (Sep)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1997

Volume 29

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1996

Volume 28

Issue 4es (Dec)Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1995

Volume 27

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1994

Volume 26

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1993

Volume 25

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1992

Volume 24

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1991

Volume 23

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1990

Volume 22

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1989

Volume 21

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1988

Volume 20

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jul)Issue 1 (Mar)

1987

Volume 19

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1986

Volume 18

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1985

Volume 17

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1984

Volume 16

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1983

Volume 15

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1982

Volume 14

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1981

Volume 13

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1980

Volume 12

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1979

Volume 11

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1978

Volume 10

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1977

Volume 9

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1976

Volume 8

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1975

Volume 7

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1974

Volume 6

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1973

Volume 5

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1972

Volume 4

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1971

Volume 3

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1970

Volume 2

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

1969

Volume 1

Issue 4 (Dec)Issue 3 (Sep)Issue 2 (Jun)Issue 1 (Mar)

0001

Volume 58

Issue 1 (Jan)

Volume 0001

January

journal article

LitStream Collection

Formal models of stepwise refinements of programs

Mili, Ali; Desharnais, Jules; Gagné, Jean Raynomd

1986 ACM Computing Surveys (CSUR)

doi: 10.1145/27632.28054pmid: N/A

Of the many ways to express program specifications, three of the most common are: as a pair of assertions, an input assertion and an output assertion; as a function mapping legal inputs to correct outputs; or as a relation containing the input/output pairs that are considered correct. The construction of programs consists of mapping a potentially complex specification into a program by recursively decomposing complex specifications into simpler ones. We show how this decomposition takes place in all three modes of specification and draw some conclusions on the nature of programming.

journal article

Browse All Journals

Related Journals:

Communications of the ACM IEEE Transactions on Smart Grid Computer Proceedings of the VLDB Endowment Procedia Computer Science ACM Transactions on Computer Systems Computer Journal Computer Supported Cooperative Work Science China Information Sciences ACM Transactions on Knowledge Discovery from Data

LitStream Collection

Elimination algorithms for data flow analysis

Ryder, Barbara G.; Paull, Marvin C.

1986 ACM Computing Surveys (CSUR)

doi: 10.1145/27632.27649pmid: N/A

A unified model of a family of data flow algorithms, called elimination methods, is presented. The algorithms, which gather information about the definition and use of data in a program or a set of programs, are characterized by the manner in which they solve the systems of equations that describe data flow problems of interest. The unified model provides implementation-independent descriptions of the algorithms to facilitate comparisons among them and illustrate the sources of improvement in worst case complexity bounds. This tutorial provides a study in algorithm design, as well as a new view of these algorithms and their interrelationships.

Showing 1 to 2 of 2 Articles

Articles per page