Narrow your search

Library

KU Leuven (4)

ULB (3)

ULiège (3)

UGent (2)

UAntwerpen (1)

UHasselt (1)

UNamur (1)


Resource type

book (4)


Language

English (4)


Year
From To Submit

2003 (4)

Listing 1 - 4 of 4
Sort by
Reasoning about program transformations : imperative programming and flow of data
Author:
ISBN: 0387953914 9780387953915 9780387224619 9786610009534 1280009535 0387224610 Year: 2003 Publisher: New York: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Inductive Synthesis of Functional Programs : Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning
Author:
ISBN: 3540401741 3540448462 Year: 2003 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Because of its promise to support human programmers in developing correct and efficient program code and in reasoning about programs, automatic program synthesis has attracted the attention of researchers and professionals since the 1970s. This book focusses on inductive program synthesis, and especially on the induction of recursive functions; it is organized into three parts on planning, inductive program synthesis, and analogical problem solving and learning. Besides methodological issues in inductive program synthesis, emphasis is placed on its applications to control rule learning for planning. Furthermore, relations to problem solving and learning in cognitive psychology are discussed.

Keywords

Computer programming --- Software engineering --- Artificial intelligence --- Computer Science --- Engineering & Applied Sciences --- Computer programming. --- Software engineering. --- Artificial intelligence. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Computer software engineering --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Programming --- Computer science. --- Science. --- Computer logic. --- Mathematical logic. --- Computer Science. --- Artificial Intelligence (incl. Robotics). --- Science, general. --- Programming Techniques. --- Software Engineering. --- Logics and Meanings of Programs. --- Mathematical Logic and Formal Languages. --- Bionics --- Cognitive science --- Digital computer simulation --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Engineering --- Coding theory --- Programming by example (Computer science) --- Demonstration, Programming by (Computer science) --- Demonstrational programming (Computer science) --- Examples, Programming by (Computer science) --- Inductive program synthesis (Computer science) --- Inductive synthesis (Computer science) --- Input/output examples, Programming by (Computer science) --- PBD (Programming by demonstration) --- PBE (Programming by example) --- Program synthesis, Inductive (Computer science) --- Programming by demonstration (Computer science) --- Programming by examples (Computer science) --- Programming by input/output examples (Computer science) --- Programming by teaching (Computer science) --- Programming, Demonstrational (Computer science) --- Teaching, Programming by (Computer science) --- Machine learning --- Logic design. --- Artificial Intelligence. --- Science, Humanities and Social Sciences, multidisciplinary. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Informatics --- Science --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Logic, Symbolic and mathematical.

Term rewriting systems
Authors: --- ---
ISBN: 0521391156 9780521391153 Year: 2003 Publisher: New York, N.Y. Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Computer science --- 681.3*F11 --- 681.3*F42 --- 681.3*F41 --- 681.3*I22 --- 681.3*D31 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- 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} --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- Rewriting systems (Computer science) --- Rewriting systems (Computer science). --- 681.3*D31 Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- 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*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*F42 Grammars and other rewriting systems: decision problems; grammar types; parallel rewriting systems; parsing; thue systems (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F11 Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Graph rewriting systems (Computer science) --- Term rewriting systems (Computer science) --- Machine theory

Logic Based Program Synthesis and Transformation : 12th International Workshop, LOPSTR 2002, Madrid, Spain, September 17-20, 2002, Revised Selected Papers
Authors: --- ---
ISBN: 3540404384 3540450130 Year: 2003 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the thoroughly refereed post-proceedings of the 12th International Workshop on Logic Based Program Synthesis and Transformation, LOPSTR 2002, held in Madrid, Spain in September 2002. The 15 revised full papers presented together with 7 abstracts were carefully selected during two rounds of reviewing and revision from 40 submissions. The papers are organized in topical sections on debugging and types, tabling and constraints, abstract interpretation, program refinement, verification, partial evaluation, and rewriting and object-oriented development.

Keywords

Logic programming --- Computer Science --- Engineering & Applied Sciences --- 681.3*D16 --- 681.3*D11 --- 681.3*F31 --- 681.3*F41 --- 681.3*I22 --- Computerwetenschap--?*D16 --- Applicative (functional) programming --- 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} --- 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*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*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*D11 Applicative (functional) programming --- Computer science. --- Science. --- Computer programming. --- Computer logic. --- Mathematical logic. --- Computer Science. --- Logics and Meanings of Programs. --- Science, general. --- Programming Techniques. --- Mathematical Logic and Formal Languages. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Natural science --- Science of science --- Sciences --- Informatics --- Science --- Programming --- Logic design. --- Science, Humanities and Social Sciences, multidisciplinary. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Logic, Symbolic and mathematical.

Listing 1 - 4 of 4
Sort by