Control Structures

Cognitive Design Elements to Support the Construction of .. - Storey, Fracchia, Müller (1999) (11 citations)
observed that programmers first develop a control-flow abstraction of the program which captures the www.csr.uvic.ca/~mstorey/papers/jss.ps

Understanding Function Behaviors through Program Slicing - De Lucia, Fasolino, Munro (1996) (4 citations)
of the program she builds is a control-flow abstraction called the program model. The program
orca.unl.ac.uk/~mark/delucia.ps

From Program Comprehension to Tool Requirements for an.. - von Mayrhauser, Vans (1993) (Correct) (2 citations)
representation programmers build is a control flow abstraction of the program called the program
www.cs.colostate.edu/~aaa/cmp2.ps

Comprehension Processes During Large Scale Maintenance - von Mayrhauser, Vans (1994) (Correct) (1 citation)
build is a program model consisting of a control flow abstraction of the program [5]Suppose an engineer
www.cs.colostate.edu/~aaa/icse.ps

From Code Understanding Needs to Reverse Engineering Tool.. - von Mayrhauser, Vans (1993) (Correct)
representation programmers build is a control flow abstraction of the program called the program
www.cs.colostate.edu/~aaa/case93.ps

Program Comprehension And Enhancement Of Software - von Mayrhauser, Vans, Lang (Correct)
6] found that programmers first build a control flow abstraction of the program called the program
www.cs.colostate.edu/~aaa/ifip.ps

Control Abstraction in Parallel Programming Languages - Lawrence Crowl Department (1992) (Correct)
that parallelism is a form of control flow, control abstraction is particularly important for parallel
www.crowl.org/Lawrence/paper/conferences/1992P-ICCL-44/fulltext.ps.gz

Identifying Procedural Structure in Cobol Programs - John Field Ramalingam (Correct)
Abstract The principal control-flow abstraction mechanism in the Cobol language is the
www.research.ibm.com/people/r/rama/Papers/paste99.ps

Replicable GMBs: A tool for the specification of.. - Mar'ia Cecilia (Correct)
layer, but do little to help create the dialog control layer, let alone to provide semantic feedback.
at just two levels of abstraction: control flow, specified with GMB, and operations, specified in
Structure is specified at several levels of abstraction, by nesting boxes, as in Structured Boxes
ftp.ing.puc.cl/pub/escuela/dcc/techReports/rt94-03.ps

VASE User's Manual Version 1.0 - David Jablonowski (Correct)
steering applications. vase uses a control-flow abstraction to describe the complex internal
www.csrd.uiuc.edu/reports/1294.ps.gz

Congestion Control in BBN Packet-Switched Networks* - John Robinson Dan (Correct)
result in instabilities, when delay is used to control flow rates. 3. It is difficult to design a fair
its submission rate. The use of window-based flow control protocols at the higher level will
reasons: 1. There may be no window-oriented flow control in use for some of the congesting traffic. 2.
gatekeeper.dec.com/pub/doc/sigcomm/ccr/archive/1990/jan90/robinson.ps.Z

LISP AND SYMBOLIC COMPUTATION: An International Journal, .. - Callee-Save Registers In (Correct)
to A-calculus, but which closely reflects the control-flow and data-flow operations of a yon Neumann
ftp.cs.princeton.edu/pub/packages/ml/zsh/callee.ps

Programming the Hawaii Parallel Computer - Richard Halverson Jr (Correct)
traditional language constructs for defining control flow. One way to use the XILINX board on a HPC
ftp.ics.Hawaii.Edu/pub/tr/ics-tr-94-24.ps.Z

Rule Based Specification of Information Systems - Peter Mcbrien And (Correct)
and costly due to the difference between control flow and data flow not having been modelled in
argon.dcs.kcl.ac.uk/staff/pjm/publications/MSW94.ps.gz

March 1995 - Flight Safety Digest (Correct)
airports Airspace capacity bottlenecks Flow control and the competition for slot times and,
www.flightsafety.org/fsd/fsd_mar95.pdf

Progressive Profiling: A Methodology based on - Profile Propagation And (Correct)
for exact matches based on each procedure's control flow structure, and propagates the entire profile
or additional information from the compiler. 3 Control Flow-based Binary Matching This section describes
www.cesr.ncsu.edu/fddo4/papers/FDDO_ZhengWang.pdf

Unknown - (Correct)
the tightcoupling between wormhole routers for flow control to detect and recover from potential dead-
The basic idea is to use the fine-grained flow control and backpressure of wormhole routing to
The CR routing mechanisms provide end-to-end flow control and fault tolerance that obviates the need for
csag.ucsd.edu/papers/cr-tpds.ps

A Backward Error Recovery Scheme for the - Apemille Parallel Computer (Correct)
unit (called Tmille) performing mainly flow- control, signal handling, and global integer
www.inf.mit.bme.hu/FTSRG/Publications/EWDC-11b.pdf

Graph-Based Models for Managing Development Processes.. - Carl-Arndt Krapp Sven (Correct)
relationships, tasks are connected by control flows (similar to precedence relationships in net
and for testing are inserted into the task net. Control flow dependencies are established between the
www-i3.informatik.rwth-aachen.de/private/schleicher/tagt98.ps

Why Computer Interfaces Are Not Like Paintings: - The User As (Correct)
language is usually based on either a control flow or a data flow model. Graphical interface: a
hwr.nici.kun.nl/cognavhyp/Petre-notPainting-EWHCI92.ps

Congestion Control in Routing Networks - Chien (1986) (Correct)
Problem .49 4.2 Flow Control in Data Networks .50
64 5.3.1 System Performance without Flow Control .64 5.3.2 System Performance
.64 5.3.2 System Performance with Flow Control .69 5.4 Overall System
www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TR-382.pdf

IP switching in a simplified ATM environment - Mika Ilvesmki Marko (Correct)
Internet traffic has the ability to handle the flow control on connection basis and that no additional
on connection basis and that no additional flow control is needed. Amount of congestion Received
keskus.hut.fi/~mluoma/publications/vvdc97co.ps

Flip-Tick Architecture: a cycle-oriented architecture - For Distributed Problem (Correct)
events. The cycles are not based on an explicit control flow management that takes care of timely operation
only way of exchanging data between actors, the control flow results from three intertwined mechanisms: i)
set.gmd.de/pub/SET/publications/released/1998/pdf/Richter98.1.pdf

Application Performance of a Linux Cluster - Using Converse Laxmikant (Correct)
is not guaranteed, we implement a window-based flow-control protocol. To deal with the fact that there are
www.ks.uiuc.edu/~brunner/Papers/RTSPP99.ps

Towards Maximising the use of Structural VHDL for Synthesis - O'Brien, Robert, Maginot (Correct)
but only in specific areas such as describing control flow and synchronisation. In the rest of this
herkules.informatik.tu-chemnitz.de/proceedings/eurodac-96/papers/1996/eurdac96/htmfiles/sun_sgi/../../pdffiles/v07_3.pdf

Light Weight Optimizations for Reducing Hot Saves and.. - Of Callee-Saved Registers (Correct)
according to their liveness in the call and control flow graphs of the program This method requires a
accomplish this, they also make use of data and control flow analyses. Others [4, 8, 9, 10, 16] handle the
www.cesr.ncsu.edu/fddo4/papers/bilha.pdf

Primitive Geometric Operations on - Planar Algebraic Curves (Correct)
sufficient precisions to direct the algorithm control flows correctly. These primitive geometric
and efficiency dynamically depending on the control flow of algorithm, i.e.use low precision
3map.snu.ac.kr/mskim/ftp/gauss93.ps

Henry Chang - Top-Down Constraint-Driven Design (Correct)
criteria set by the mapping function, then the flow control is returned to the mapping function. On a
As before, if this step fails, the flow control is returned to the mapping function. If it is
If all of the specifications are met, the flow control is returned to the upper node with the
ic.eecs.berkeley.edu/pub/Papers_Talks/Analog_Group/PostScript/CICC92_chang.ps.Z

Demonstration of an Automated Integrated Test.. - Margaria, Niese, Steffen (2001) (Correct)
correctness and consistency of the test cases' control flow logic [3]During the test case design, vital
ls5-www.cs.uni-dortmund.de/~niese/Niese02c.pdf

Unification of Finite Failure Non-Homogeneous Poisson - Process Models Through (Correct)
types of coverage definitions in literature: control-flow and data-flow coverage[2, 6, 7, 16]Each
on the Effectiveness of Dataflow-and Control-flowbased Test Adequacy Criteria,Proc. of Intl.
www.ee.duke.edu/~ssg/softrel/TechReports/issre.ps.gz

Terrence Pratt

• Richard J. Lipton and David Dobkin. Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 1-5, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Ronald L. Rivest and Jean Vuillemin. A generalization and proof of the Aanderaa-Rosenberg conjecture. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 6-11, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• L. Hyafil and H. T. Kung. The complexity of parallel evaluation of linear recurrence. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 12-22, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Andrew Chi-Chih Yao. On computing the minima of quadratic forms (preliminary report). In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 23-26, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Wolfgang J. Paul. A 2.5 n-lower bound on the combinatorial complexity of Boolean functions. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 27-36, Albuquerque, New Mexico, 5-7 May 1975. Citations. [BibTeX entry]

• Michael J. Fischer, Albert R. Meyer, and Michael S. Paterson. Lower bounds on the size of Boolean formulas: Preliminary report. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 37-44, Albuquerque, New Mexico, 5-7 May 1975. Citations, etc. [BibTeX entry]

• Leslie G. Valiant. On non-linear lower bounds in computational complexity. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 45-53, Albuquerque, New Mexico, 5-7 May 1975. Additional information. [BibTeX entry]

• H. B. Hunt, III and T. G. Szymanski. On the complexity of grammar and related problems. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 54-65, Albuquerque, New Mexico, 5-7 May 1975. Additional information. [BibTeX entry]

• Shimon Even and R. Endre Tarjan. a combinatorial problem which is complete in polynomial space. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 66-71, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Zvi Galil. On the validity and complexity of bounded resolution. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 72-82, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Stephen A. Cook. Feasibly constructive proofs and the propositional calculus (preliminary version). In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 83-97, Albuquerque, New Mexico, 5-7 May 1975. Citations. [BibTeX entry]

• Herbert Egli and Robert L. Constable. Computability concepts for programming language semantics. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 98-106, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Derek C. Oppen and Stephen A. Cook. Proving assertions about programs that manipulate data structures. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 107-116, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• A. Ehrenfeucht and G. Rozenberg. On (un)predictability of formal languages (extended abstract). In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 117-120, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Sven Skyum. On decomposing languages defined by parallel devices. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 121-125, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• C. Raymond Perrault. Intercalation theorems for tree transducer languages. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 126-136, Albuquerque, New Mexico, 5-7 May 1975. Additional information. [BibTeX entry]

• A. Ehrenfeucht and G. Rozenberg. On the (combinatorial) structure of L languages without interactions. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 137-144, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Detlef Wotschke. Degree-languages, polynomial time recognition, and the LBA problem. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 145-152, Albuquerque, New Mexico, 5-7 May 1975. Additional information. [BibTeX entry]

• Seymour Ginsburg and Nancy Lynch. Comparative complexity of grammar forms. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 153-158, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Arnold L. Rosenberg and Larry J. Stockmeyer. Hashing schemes for extendible arrays (extended arrays). In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 159-166, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Terrence Pratt. Four models for the analysis of optimization of program control structures. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 167-176, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• A. V. Aho and J. D. Ullman. Node listings for reducible flow graphs. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 177-185, Albuquerque, New Mexico, 5-7 May 1975. Additional information. [BibTeX entry]

• R. J. Lipton, S. C. Eisenstat, and R. A. DeMillo. The complexity of control structures and data structures. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 186-193, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Zohar Manna and Adi Shamir. The optimal fixedpoint of recursive programs. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 194-206, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• A. V. Aho and S. C. Johnson. Optimal code generation for expression trees. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 207-217, Albuquerque, New Mexico, 5-7 May 1975. [BibTeX entry]

• Robert A. Wagner. On the complexity of the extended string-to-string correction problem. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 218-223, Albuquerque, New Mexico, 5-7 May 1975. Citations. [BibTeX entry]

• Michael Ian Shamos. Geometric complexity. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 224-233, Albuquerque, New Mexico, 5-7 May 1975. Citations. [BibTeX entry]

• Gary L. Miller. Riemann's hypothesis and tests for primality. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 234-239, Albuquerque, New Mexico, 5-7 May 1975. Additional information. [BibTeX entry]

• Michael L. Fredman. Two applications of a probabilistic search technique: Sorting x + y and building balanced search trees. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 240-244, Albuquerque, New Mexico, 5-7 May 1975. Citations. [BibTeX entry]

• Donald J. Rose and R. Endre Tarjan. Algorithmic aspects of vertex elimination. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 245-254, Albuquerque, New Mexico, 5-7 May 1975. Citations. [BibTeX entry]

• Kellogg S. Booth and George S. Lueker. Linear algorithms to recognize interval graphs and test for the consecutive ones property. In Conference Record of Seventh Annual ACM Symposium on Theory of Computation, pages 255-265, Albuquerque, New Mexico, 5-7 May 1975. Citations, etc. [BibTeX entry]