Narrow your search

Library

KU Leuven (4)

UCLouvain (3)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

UAntwerpen (2)

UCLL (2)

ULB (2)

ULiège (2)

VIVES (2)

More...

Resource type

book (6)

digital (2)


Language

English (8)


Year
From To Submit

2013 (2)

2007 (3)

2000 (1)

1997 (1)

Listing 1 - 8 of 8
Sort by
Semantics of programming languages and model theory
Authors: ---
ISBN: 9782881249358 2881249353 Publisher: Yverdon: Gordon and Breach,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Tests and Proofs : First International Conference, TAP 2007, Zurich, Switzerland, February 12-13, 2007. Revised Papers
Authors: ---
ISBN: 9783540737704 Year: 2007 Publisher: Berlin, Heidelberg Springer-Verlag Berlin Heidelberg

The classical decision problem
Authors: --- ---
ISSN: 01726641 ISBN: 354057073X 9783540570738 Year: 1997 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

681.3*F11 --- 681.3*F13 --- 681.3*F41 --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 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*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*F13 Complexity classes: complexity hierarchies; machine-independent complexity; reducibility and completeness; relations among complexity classes; relations among complexity measures (Computation by abstract devices)--See also {681.3*F2} --- 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} --- Mathematical logic --- Decidability (Mathematical logic) --- Health Sciences --- Life Sciences --- Immunology --- Pathology --- Computable functions --- Gödel's theorem --- Logic, Symbolic and mathematical --- Recursive functions

Tests and proofs : first international conference, TAP 2007, Zurich, Switzerland, February 12-13, 2007 : revised papers
Authors: --- ---
ISBN: 9783540737698 3540737693 3540737707 Year: 2007 Publisher: Berlin New York : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the thoroughly refereed post-proceedings of the First International Conference on Test and Proofs, TAP 2007, held in Zurich, Switzerland in February 2007. The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are devoted to the convergence of software proofing and testing and feature current research work that combines ideas from both sides to foster software quality. Topics addressed are generation of test cases or oracles by theorem proving, constraint logic programming, model checking, or symbolic execution; program proving with the aid of testing techniques; automatic tools; case studies; formal frameworks; as well as verification techniques combining proofs and tests.

Keywords

Computer software --- Logiciels --- Testing --- Congresses. --- Reliability --- Quality control --- Essais --- Congrès --- Fiabilité --- Qualité --- Contrôle --- Computer Science --- Engineering & Applied Sciences --- Computer science. --- Computer communication systems. --- Computer system failures. --- Software engineering. --- Computer logic. --- Computers and civilization. --- Computer Science. --- Computer Communication Networks. --- System Performance and Evaluation. --- Software Engineering. --- Logics and Meanings of Programs. --- Computers and Society. --- Civilization and computers --- Civilization --- Computer science logic --- Logic, Symbolic and mathematical --- Computer software engineering --- Engineering --- Computer failures --- Computer malfunctions --- Computer systems --- Failure of computer systems --- System failures (Engineering) --- Fault-tolerant computing --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Electronic data processing --- Network computers --- Informatics --- Science --- Failures --- Distributed processing --- Computer system performance. --- Logic design. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory


Book
Tests and Proofs : First International Conference, TAP 2007, Zurich, Switzerland, February 12-13, 2007. Revised Papers
Authors: --- ---
ISBN: 9783540737704 Year: 2007 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the thoroughly refereed post-proceedings of the First International Conference on Test and Proofs, TAP 2007, held in Zurich, Switzerland in February 2007. The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are devoted to the convergence of software proofing and testing and feature current research work that combines ideas from both sides to foster software quality. Topics addressed are generation of test cases or oracles by theorem proving, constraint logic programming, model checking, or symbolic execution; program proving with the aid of testing techniques; automatic tools; case studies; formal frameworks; as well as verification techniques combining proofs and tests.

Abstract State Machines - Theory and Applications : International Workshop, ASM 2000 Monte Verita, Switzerland, March 19-24, 2000 Proceedings
Authors: --- --- ---
ISSN: 03029743 ISBN: 3540679596 9783540679592 3540445188 Year: 2000 Volume: 1912 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The ASM 2000 workshop was held in the conference center of the Swiss Federal Institute of Technology (ETH) at Monte Verit a, Canton Ticino, March 19-24, 2000. The ASM formalism was proposed together with the thesis that it is suitable to model arbitrary computer systems on arbitrary abstraction levels. ASMs have been successfully used to analyze and specify various hardware and software systems including numerous computer languages. The aim of the workshop was to bring together domain-experts, using ASMs as a practical speci cation method, and theorists working with ASMs and related methods. In addition the workshop served as a forum on theoretical and practical topics that relate to ASMs in a broad sense. Three tutorials including hands-on experience with tools were organized by U. Gl¨asser and G. del Castillo (on the topic Specifying Concurrent Systems with ASMs"), H. Russ ¨ and N. Shankar (on the topic A Tutorial Introduction to PVS"), M. Anlau , P.W. Kutter, and A. Pierantonio (on the topic Developing Domain Speci c Languages"). In response to the organization committee’s call for papers, 30 papers were submitted, each of which was independently reviewed by four members of the program committee. This volume presents a selection of 12 of the refereed papers and two reports on industrial ASM application at Siemens AG and Microsoft Research, together with contributions based on the invited talks given by A.

Keywords

Machine theory --- Computer Science --- Algebra --- Mathematics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Computer science. --- Software engineering. --- Programming languages (Electronic computers). --- Computer logic. --- Mathematical logic. --- Database management. --- Computer Science. --- Logics and Meanings of Programs. --- Software Engineering/Programming and Operating Systems. --- Programming Languages, Compilers, Interpreters. --- Software Engineering. --- Mathematical Logic and Formal Languages. --- Database Management. --- Logic design. --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Electronic data processing --- Informatics --- Science --- Computer software engineering --- Engineering --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Languages, Artificial --- Computer science logic --- Logic, Symbolic and mathematical --- Machine theory - Congresses --- Programming languages (Electronic computers) --- Logic, Symbolic and mathematical.


Book
Church's Thesis After 70 Years

Loading...
Export citation

Choose an application

Bookmark

Abstract

Church's Thesis (CT) was first published by Alonzo Church in 1935. CT is a proposition that identifies two notions: an intuitive notion of a effectively computable function defined in natural numbers with the notion of a recursive function. Despite of the many efforts of prominent scientists, Church's Thesis has never been falsified. There exists a vast literature concerning the thesis. The aim of the book is to provide one volume summary of the state of research on Church's Thesis. These include the following: different formulations of CT, CT and intuitionism, CT and intensional mathematics,


Digital
Church's Thesis After 70 Years

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

Philosophy

Listing 1 - 8 of 8
Sort by