| |
Browse All Reviews > Software (D) > Programming Languages (D.3) > Language Constructs and Features (D.3.3) > Control Structures (D.3.3...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 18
Reviews about "Control Structures (D.3.3...)":
|
Date Reviewed |
| |
Dynamic analysis of branch mispredictions in Ada
Lathrop S. SIGAda 2009 (Proceedings of the ACM SIGAda Annual International Conference on Ada and Related Technologies, St. Petersburg, FL, Nov 1-5, 2009) 79-84, 2009. Type: Proceedings
Processors attempt to improve performance by, among other things, predicting whether or not branches are taken; incorrect branch predictions reduce instruction throughput. Some Intel processors assume that forward conditional jumps are...
|
Jun 9 2010 |
| |
Extended exceptions for contingencies
van Ellen T., Hasselbring W. SERENE 2008 (Proceedings of the 2008 RISE/EFTS Joint International Workshop on Software Engineering for Resilient Systems, Newcastle upon Tyne, UK, Nov 17-19, 2008) 107-116, 2008. Type: Proceedings
A contingency “is a situation [“a sequence of n states with n > 0”] that is described within the specification of a module, and represents a module result where...
|
Jun 16 2009 |
| |
Resource aware programming
Moreau L., Queinnec C. ACM Transactions on Programming Languages and Systems 27(3): 441-476, 2005. Type: Article
A framework for resource aware programming (RAP) is introduced in this paper. RAP allows the user to monitor resources used by programs, and to express policies for managing resources programmatically. The framework is based on hierarc...
|
Jul 27 2005 |
| |
Advanced Exception Handling Mechanisms
Buhr P., Mok W. IEEE Transactions on Software Engineering 26(9): 820-836, 2000. Type: Article
The authors present the many facets of exception handling mechanisms as they are defined in programming languages. They introduce the fundamental concepts in isolation, compare variants and alternatives thereof, and discuss the consequ...
|
Oct 1 2001 |
| |
A Knowledge-Based Approach to the Analysis of Loops
Abd-El-Hafiz S., Basili V. IEEE Transactions on Software Engineering 22(5): 339-360, 1996. Type: Article
A knowledge-based approach to loop analysis is presented. First-order predicate logic annotations are generated as a result of the analysis. A taxonomy classifies loops according to their complexity. Dataflow analysis is used to decomp...
|
Jun 1 1997 |
| |
Composing first-class transactions
Haines N., Kindred D., Morrisett J., Nettles S., Wing J. ACM Transactions on Programming Languages and Systems 16(6): 1719-1736, 1994. Type: Article
A computation is undoable if it can revert to its pre-execution state at any time before it ends; it is persistent if its results remain after it has successfully ended; and it is serializable if it produces the same results independen...
|
May 1 1996 |
| |
Single-pass generation of static single-assignment form for structured languages
Brandis M., Mössenböck H. ACM Transactions on Programming Languages and Systems 16(6): 1684-1698, 1994. Type: Article
Issues related to generation of the static single-assignment (SSA) form of programs written using structured programming languages are discussed. The paper includes a brief introductory explanation of the SSA form, an explanation of th...
|
Dec 1 1995 |
| |
On slicing programs with jump statements
Agrawal H. ACM SIGPLAN Notices 29(6): 302-312, 1994. Type: Article
Program slices are a useful tool in many areas of software engineering. Most earlier algorithms to create these slices could not deal with jump statements (such as goto, exit, and break), however. This paper examin...
|
Jun 1 1995 |
| |
A superimposition control construct for distributed systems
Katz S. ACM Transactions on Programming Languages and Systems 15(2): 337-356, 1993. Type: Article
Superimposition is a procedure-like control structure whose declaration part contains some schematic abstractions of processes, called roletypes. Each roletype may be related to processes associated with a distributed algorithm. The op...
|
Dec 1 1994 |
| |
The transitive closure of control dependence
Weiss M. ACM Letters on Programming Languages and Systems 1(2): 178-190, 1992. Type: Article
Control dependency flowgraphs are often used in compiling for many purposes. This paper contains a basic review of the necessary graph-theoretic concepts and characterizes the transitive closure of control dependence. The characterizat...
|
May 1 1994 |
| |
|
|
| |
|
|
