Narrow your search

Library

UMons (38)

KU Leuven (27)

UCLouvain (26)

ULiège (26)

ULB (23)

UGent (17)

UAntwerpen (12)

KBR (8)

UNamur (8)

UHasselt (6)

More...

Resource type

book (38)

periodical (1)


Language

English (32)

French (5)

German (1)


Year
From To Submit

2016 (1)

2013 (1)

2011 (2)

2008 (2)

2006 (1)

More...
Listing 1 - 10 of 38 << page
of 4
>>
Sort by

Book
Digital design, with RTL design, VHDL, and Verilog
Author:
ISBN: 9780470531082 0470531088 Year: 2011 Publisher: Hoboken, NJ Wiley


Book
Les microcontrôleurs PIC : recueil d'applications
Author:
ISBN: 2100491687 Year: 2005 Publisher: Paris : Dunod,

Loading...
Export citation

Choose an application

Bookmark

Abstract

FPGA prototyping by VHDL examples : Xilinx Spartan-3 version.
Author:
ISBN: 9780470185315 0470185317 Year: 2008 Publisher: Hoboken Wiley-Interscience


Book
Le langage VHDL : du langage au circuit, du circuit au langage
Authors: --- ---
ISBN: 9782100726882 2100726889 Year: 2016 Publisher: Paris : Dunod,

Computer aided verification : 8th international conference, CAV'96, New Brunswick, NJ, USA, July 31 - August 3, 1996 : proceedings
Authors: ---
ISBN: 3540614745 3540685995 Year: 1996 Volume: 1102 Publisher: Berlin [etc.] : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 8th International Conference on Computer Aided Verification, CAV '96, held in New Brunswick, NJ, USA, in July/August 1996 as part of the FLoC '96 federated conference. The volume presents 32 revised full research contributions selected from a total of 93 submissions; also included are 20 carefully selected descriptions of tools and case studies. The set of papers reports the state-of-the-art of the theory and practice of computer assisted formal analysis methods for software and hardware systems; a certain emphasis is placed on verification tools and the algorithms and techniques that are needed for their implementation.

Mathematical logic for computer science
Author:
ISBN: 1852333197 1447103351 9781852333195 Year: 2003 Publisher: London Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems. The logical systems presented are: - Propositional calculus (including binary decision diagrams); - Predicate calculus; - Resolution; - Hoare logic; - Z; - Temporal logic. Answers to exercises (for instructors only) as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.com/978-1-85233-319-5   Mordechai Ben-Ari is an associate professor in the Department of Science Teaching of the Weizmann Institute of Science. He is the author of numerous textbooks on concurrency, programming languages and logic, and has developed software tools for teaching concurrency. In 2004, Ben-Ari received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education.

Algebraic complexity theory
Authors: --- --- ---
ISSN: 00727830 ISBN: 3540605827 3642082289 3662033380 9783540605829 Year: 1997 Volume: 315 Publisher: Berlin: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro­ posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under­ standing of the intrinsic computational difficulty of problems.

Listing 1 - 10 of 38 << page
of 4
>>
Sort by