Choose an application

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

Automatic theorem proving --- Logic, symbolic and mathematical --- Logic, Symbolic and mathematical --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Automated theorem proving --- Theorem proving, Automated --- Theorem proving, Automatic --- Artificial intelligence --- Proof theory --- Automatic theorem proving. --- Logic, Symbolic and mathematical. --- Computer science --- Informatique --- Théorèmes --- Démonstration automatique --- Logic Computation --- Symbolic Computation --- Mathematical Logic --- Théorèmes --- Démonstration automatique

Choose an application

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

Electronic digital computers --- Algorithms --- Programming --- Computer algorithms --- Computer programming --- 681.3*F11 --- 681.3*F21 --- 681.3*F22 --- Computers --- Electronic computer programming --- Electronic data processing --- Programming (Electronic computers) --- Coding theory --- Models of computation: automata bounded action devices computability theory relations among models self-modifying machines unbounded-action devices--See also {681.3*F41} --- Numerical algorithms and problems: computation of transforms computations infinite fields computations on matrices computations on polynomials numer-theoretic computations--See also {681.3*G1} {681.3*G4} {681.3*I1} --- Nonnumerical algorithms and problems: complexity of proof procedures computations on discrete structures geometrical problems and computations pattern matching --See also {?681.3*E2-5} {681.3*G2} {?681.3*H2-3} --- Computer algorithms. --- Computer programming. --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures computations on discrete structures geometrical problems and computations pattern matching --See also {?681.3*E2-5} {681.3*G2} {?681.3*H2-3} --- 681.3*F21 Numerical algorithms and problems: computation of transforms computations infinite fields computations on matrices computations on polynomials numer-theoretic computations--See also {681.3*G1} {681.3*G4} {681.3*I1} --- 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} --- Software engineering: protection mechanisms; standards--See also {681.3*K63}; {681.3*K51} --- 681.3*D2 Software engineering: protection mechanisms; standards--See also {681.3*K63}; {681.3*K51} --- Computer science --- algoritmen --- Fourier --- statistieken --- 681.3*D2 --- 681.3*F21 Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- Numerical algorithms and problems: computation of transforms; computations infinite fields; computations on matrices; computations on polynomials; numer-theoretic computations--See also {681.3*G1}; {681.3*G4}; {681.3*I1} --- 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} --- Models of computation: automata; bounded action devices; computability theory; relations among models; self-modifying machines; unbounded-action devices--See also {681.3*F41} --- 681.3*F22 Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Nonnumerical algorithms and problems: complexity of proof procedures; computations on discrete structures; geometrical problems and computations; pattern matching --See also {?681.3*E2-5}; {681.3*G2}; {?681.3*H2-3} --- Programmation des ordinateurs --- Algorithmes --- Langages de programmation --- Programming languages (Electronic computers) --- Infographie --- Computer graphics --- Electronic digital computers - Programming

Choose an application

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

Programming --- Computer science --- Machine theory --- Computational complexity --- Automates mathématiques, Théorie des --- Complexité de calcul (Informatique) --- Machine theory. --- Computational complexity. --- #TELE:SISTA --- 681.3*F --- 681.3*F13 --- 681.3*F41 --- 681.3*F42 --- 681.3*F43 --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Complexity, Computational --- Electronic data processing --- Theory of computation --- 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} --- 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} --- Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- 681.3*F43 Formal languages: algebraic language theory; classes defined by grammars or automata or by resource-bounded automata; operations on languages (Mathematical logic and formal languages)--See also {681.3*D31} --- 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*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*F Theory of computation --- Automates mathématiques, Théorie des --- Complexité de calcul (Informatique)

Choose an application

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

621.3'7 --- Integrated circuits --- Computer-aided design --- Neural computers. --- Neural net computers --- Neural network computers --- Neurocomputers --- Electronic digital computers --- Natural computation --- Artificial intelligence --- CAD (Computer-aided design) --- Computer-assisted design --- Computer-aided engineering --- Design --- Very large scale integration of circuits --- VLSI circuits --- Electrical engineering--?'7 --- Very large scale integration. --- 621.3'7 Electrical engineering--?'7 --- Computer-aided design. --- Circuits intégrés à très grande échelle --- Conception assistée par ordinateur. --- Ordinateurs neuronaux. --- Very large scale integration --- Design and construction. --- Conception et construction --- Neural computers --- Chips (Electronics) --- Circuits, Integrated --- Computer chips --- Microchips --- Electronic circuits --- Microelectronics --- Very large scale integration&delete& --- Design and construction --- Conception et construction.

Choose an application

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

The aim of Surviving the SOC Revolution: A Guide to Platform-Based Design is to provide the engineering community with a thorough understanding of the challenges involved when moving to system-on-a-chip and deliver a step-by-step methodology to get them there. Design reuse is most effective in reducing the cost and development time when the components to be shared are close to the final implementation. On the other hand, it is not always possible or desirable to share designs at this level, since minimal variations in specification can result in different, albeit similar, implementations. However, moving higher in abstraction can eliminate the differences among designs, so that the higher level of abstraction can be shared and only a minimal amount of work needs to be carried out to achieve final implementation. The ultimate goal is to create a library of functions and of hardware and software implementations that can be used for all new designs. It is important to have a multilevel library, since it is often the case that the lower levels that are closer to the physical implementation change because of the advances in technology, while the higher levels tend to be stable across product versions. It is most likely that the preferred approaches to the implementation of complex embedded systems will include the following aspects: Design costs and time are likely to dominate the decision-making process for systems designers. Therefore, design reuse in all its shapes and forms will be of paramount importance. Designs have to be captured at the highest level of abstraction to be able to exploit all the degrees of freedom that are available. Next-generation systems will use a few highly complex (Moore's Law Limited) part-types, but many more energy-power-cost-efficient, medium-complexity (10M-100M) gates in 50nm technology chips, working concurrently to implement solutions to complex sensing, computing, and signaling/actuating problems. Such chips will most likely be developed as an instance of a particular platform. That is, rather than being assembled from a collection of independently developed blocks of silicon functionality, they will be derived from a specific `family' of rnicro-architectures, possibly oriented toward a particular class of problems, that can be modified (extended or reduced) by the system developer. These platforms will be highly programmable. Both system and software reuse impose a design methodology that has to leverage existing implementations available at all levels of abstraction. £/LIST£ This book deals with the basic principles of a design methodology that addresses the concerns expressed above. The platform concept is carried throughout the book as a unifying theme to reuse. This is the first book that deals with the platform-based approach to the design of embedded systems and is a stepping stone for anyone who is interested in the real issues facing the design of complex systems-on-chip. From the Preface by Alberto Sangiovanni-Vincentelli.

Embedded computer systems --- Computers --- Application specific integrated circuits --- System design. --- Design and construction. --- Circuits --- Application-specific integrated circuits --- Circuits intégrés à la demande --- Computer aided design. --- Computer science. --- Computers. --- Computer-aided engineering. --- Engineering. --- Electrical engineering. --- Electronic circuits. --- Computer Science. --- Theory of Computation. --- Engineering, general. --- Circuits and Systems. --- Computer-Aided Engineering (CAD, CAE) and Design. --- Electrical Engineering. --- Information theory. --- Systems engineering. --- Computer engineering. --- Electric engineering --- Engineering --- CAE --- Electron-tube circuits --- Electric circuits --- Electron tubes --- Electronics --- Construction --- Industrial arts --- Technology --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Data processing