Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Overview The motivation of this text lies in what we believe is the inadequacy of current frameworks to reason about the ?ow of data in imperative programs. This inadequacy clearly shows up when dealing with the individual side effects of loop iterations. - deed, we face a paradoxical situation where, on the one hand, a typical program spends most of its execution time iterating or recursing on a few lines of codes, and, on the other hand, current optimization frameworks are clumsy when trying to capture the effects of each incarnation of these few lines—frameworks we inherited from designs made decades ago. The reasons are manyfold, but one of them stands out: The same concepts have been used, on the one hand, to represent and manipulate programs internally in compilers and, on the other hand, to allow us humans to reason about optimizations. Unfortunately, these two uses have different aims and constraints. An example of such a situation is given by control-?ow graphs of basic blocks, which have been - tremely useful in practice as an internal representation of programs, but which are not always adequate or convenient to formally think about programs and specify their transformations. In some cases, de?nitions based on control-?ow graphs can be overly restrictive. Dominance, studied in Chapter 4, is a good example.

Programming --- Programming languages (Electronic computers) --- Langages de programmation --- 681.3*I22 --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Programming languages (Electronic computers). --- Computer Science --- Engineering & Applied Sciences --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Computer science. --- Computer programming. --- Computer Science. --- Programming Languages, Compilers, Interpreters. --- Programming Techniques. --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Intelligent agents (Computer software) --- 681.3*I2 --- 681.3*I22 --- 681.3*D1 --- Agents, Autonomous (Computer software) --- Agents, Cognitive (Computer software) --- Agents, Intelligent (Computer software) --- Assistants, Cognitive (Computer software) --- Assistants, Intelligent software --- Autonomous agents (Computer software) --- Cognitive agents (Computer software) --- Cognitive assistants (Computer software) --- IAs (Computer software) --- Intelligent agent software --- Intelligent software agents --- Intelligent software assistants --- Software agents (Computer software) --- Special agents (Computer software) --- Artificial intelligence --- Artificial intelligence. AI --- Automatic programming: automatic analysis of algorithms program modification program synthesis program transformation program verification (Artificialintelligence)--See also {681.3*D12} {681.3*F31} --- Programming techniques--See also {681.3*E} --- Computer programs --- 681.3*D1 Programming techniques--See also {681.3*E} --- 681.3*I22 Automatic programming: automatic analysis of algorithms program modification program synthesis program transformation program verification (Artificialintelligence)--See also {681.3*D12} {681.3*F31} --- 681.3*I2 Artificial intelligence. AI --- Intelligent agents (Computer software). --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31}

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

681.3*I22 --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- 681.3*I28 Problem solving, control methods and search: backtracking; dynamic program- ming; graph and tree search strategies; heuristics; plan execution, formationand generation (Artificial intelligence)--See also {681.3*F22} --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 681.3*I28 --- Computer science --- Artificial intelligence. Robotics. Simulation. Graphics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Software engineering --- Automatic theorem proving --- Software engineering. --- Automatic theorem proving. --- 681.3*I22 --- 681.3*D24 --- 681.3*D12 --- 681.3*F31 --- 681.3*F41 --- 681.3*C22 --- 681.3*D46 --- 681.3*D213 --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Automatic programming--See also {681.3*I22} --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Network protocols: protocol architecture; protocol verification --- Security and protection: access controls; authentication; cryptographic controls; information flow controls; security kernels; verification (Operating systems) --- Reusable software: domain engineering; reusable libraries; reuse models --- 681.3*D46 Security and protection: access controls; authentication; cryptographic controls; information flow controls; security kernels; verification (Operating systems) --- 681.3*C22 Network protocols: protocol architecture; protocol verification --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D12 Automatic programming--See also {681.3*I22} --- 681.3*D24 Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Computer software engineering --- Engineering --- Automated theorem proving --- Theorem proving, Automated --- Theorem proving, Automatic --- Artificial intelligence --- Proof theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- Functional programming (Computer science) --- Functional programming languages --- Programmation fonctionnelle --- Langages de programmation fonctionnels --- 681.3*D11 --- 681.3*D34 --- 681.3*F32 --- 681.3*I22 --- Programming languages (Electronic computers) --- Computer programming --- Applicative (functional) programming --- Processors: code generation; compilers; interpreters; optimization; parsing; preprocessors; run-time environments; translator writing systems and compilergenerators (Programming languages) --- Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Functional programming languages. --- Functional programming (Computer science). --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 681.3*F32 Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} --- 681.3*D34 Processors: code generation; compilers; interpreters; optimization; parsing; preprocessors; run-time environments; translator writing systems and compilergenerators (Programming languages) --- 681.3*D11 Applicative (functional) programming --- Electronic digital computers programming --- Computer programming.