Horspool, N., Gorman, P.: The ASIC Handbook. Prentice Hall (2001) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
automata, a Hybrid System for Computational Automata Theory - Sutner (Correct)
....de Bruijn semiautomaton, which is then converted into the corresponding minimal Fischer automaton, see [2, 10] We extract the transition matrix Supported in part by NSF ITR 0113919. from the latter, construed as a non negative integer matrix, and determine its Perron eigenvalue. sa = ToSA[ CA[ 92, 3, 2 ] ] mf = MinimalFischerFA[ sa ] SA[ 8, 2, 1, 1, 1 , 2, 1, 4 , 3, 1, 1 , 4, 1, 6 , 5, 1, 1 , 6, 1, 6 , 7, 1, 8 , 1, 2, 2 , 2, 2, 3 , 3, 2, 5 , 4, 2, 2 , 6, 2, 7 , 7, 2, 5 , 8, 2, 2 ] M = FullTransitionMatrixFA[ mf ] Log[ 2, Max[ Abs[ N[ Eigenvalues[M] 0.900537 In ....
....DFA mm recognizing T (L; f ) During the generation of the sub semimodule we also produce the transition function for mm. Lastly, the nal states (p; A) can be determined by the condition that I p A I F not be the null vector. TransitionFunctionFA[ m, delta ] F = ToBitVector[ Final[m] Range[3] ] dot[ p ,P ,s ] delta[p,s] BooleanComposition[P,P] final[ p ,P ] ToBitVector[ p, Range[3] P . F 0; Q,W,mm = GenerateDFA[ 1 ,M , dot, 2, final ] mm DFA[ 6, 2, 2, 3, 4, 5, 6, 1 , 2, 3, 4, 5, 6, 1 , 1, 2, 3 ] W Eps, a, aa, aaa, aaaa, aaaaa The other elds ....
[Article contains additional citation context not shown here]
G. Glass and B. Schuchert. The STL <Primer>. Prentice Hall, 1996.
The triVM intermediate language reference manual - Johnson (2002) (Correct)
....implement the calculation of the number of combinations of r items from a set of n items. Procedure fac calculates the factorial of its argument, validating the input prior to the calculation itself if the argument is greater than some predetermined limit Borrowed from the Standard C Library[13]. 78 return x 1; int bar( int x, int y ) int a; a = foo( x ) return y a; proc foo (1) 1 ldi r3, 1 add r2, r1, r3 ret r2 end proc bar (2) 1 ldi r4, foo call [r4] r1) r3 add r7, r2, r3 ret r7 Figure 7.6: A complete caller callee example. Procedure bar calls foo ....
Plauger, P. J. The Standard C Library. Prentice Hall, 1992.
Middle Sized Soccer Robots: ARVAND - Jamzad, Foroughnassiraei.. (2000) (Correct)
....the programs. The control unit senses the robot and informs the processing unit of its status. It also fulfills the processing unit commands. Communication between the control unit and the processing unit is done via two serial ports with RS232 standard[3] Two microcontrollers 89C52 and 89C51 [4] are used in control unit. They control the drive units, steer units and kicker. Two limit switches are mounted on each steer unit. Microcontroller counts the number of pulses generated by the encoders mounted on the motor shafts to control the drive unit rotation. Each pulse represents 0.14 ....
MacKenzie, I.S., The 8051 Microcontroller, Prentice Hall, 1995.
Workshop on Dependability Benchmarking, DSN-2002. June .. - The Set-Check-Use.. (Correct)
....cat, we cannot tell what the value is until it is examined. When writing a program, we have to assume that both outcomes are likely and cannot assume one or the other. The values that specify an error condition are based on the I O routine itself. An examination of the C standard I O library [8] shows the behavior of I O function calls upon an error condition: Functions that return pointers use a NULL to designate an error condition: fpe, fopen, freopen, fgets. Functions that use EOF as an error condition: fclose, fgetc, getchar, putchar, puts, ungetc. Functions that use a ....
P.J. Plauger. The Standard C Library. Prentice Hall, 1992.
ARVAND: a Soccer Player Robot - Jamzad, Foroughnassiraei.. (1999) (Correct)
....architecture. The controller senses the robot and informs the processing unit of its status. It also implements the processing unit commands. Communication between the controller and the processing unit is done via two serial ports with RS 232 standard[3] Two microcontrollers AT8952 and AT8951 [4] are used in this controller. They control the drive units, steer units, kicker and limit switches. Two limit switches are mounted on each steer unit. Microcontroller counts the number of pulses generated by the encoders mounted on a motor shaft and controls the drive unit rotation with resolution ....
MacKenzie, I.S., The 8051 Microcontroller, Prentice Hall, 1995.
Representing Closed CCS Systems by Petri Nets - Olszewski (1994) (Correct)
.... Closed CCS Systems byPetri Nets Jacek Olszewski Microsoft Institute of Advanced Software Technology 65 Epping Rd, North Ryde, 2113 Australia E mail: jacek cse.unsw.edu.au UNSW CSE TR 9412 31 OCTOBER 1994 on leave from the School of Computer Science and Engineering, UniversityofNew South Wales, Kensington, Australia. Abstract This paper describes and proves a simple transformation of CCS compositions into Petri ....
....components defined as, e.g. P = a:Q, where Q = Q. It has been proved in [9] that for compositions satisfying all 3 assumptions, it is possible to prove the following theorems: A similar constraint can be found in Ada or Occam where choices are allowed between input actions only (cf. 11, 4] 4 ffl Amultiple handshake a 1 #a 2 #: #a n is equivalent to single handshakes a 1 # a 2 , # an performed in anyorder. ffl If there is a sequence of single handshakes that leads to deadlock, there is also a sequence of multiple handshakes at the maximum degree of parallelism, that ....
[Article contains additional citation context not shown here]
I.C. Pyle: The Ada Programming Language, Prentice Hall, 1981.
Design and Construction of a Soccer Player Robot ARVAND - Jamzad.. (2000) (1 citation) (Correct)
....the programs. The control unit senses the robot and informs the processing unit of its status. It also fulfills the processing unit commands. Communication between the control unit and the processing unit is done via two serial ports with RS 232 standard[3] Two microcontrollers AT8952 and AT8951 [4] are used in control unit. They control the drive units, steer units, kicker and limit switches. Two limit switches are mounted on each steer unit. Microcontroller counts the number of pulses generated by the encoders mounted on a motor shaft to control the drive unit rotation. Each pulse ....
MacKenzie, I.S., The 8051 Microcontroller, Prentice Hall, 1995.
Automated Testing with RT-Tester - Theoretical Issues.. - Dahlweid, Meyer, Peleska (2000) (Correct)
....whether a transition may be taken not only depends on the present location, but on the present valuation of the variables as well. Furthermore, transition labels must be augmented by variable assignments. In the classical generation of transition graphs from CSP speci cations, as de ned in [8, 7], each transition leading from any state is labelled with exactly one event. The size of the transition graph representing the process P = a x P therefore depends on the de nition of the channel a. The channel can communicate an arbitrary nite number of values, and the resulting transition ....
A.W. Roscoe: The Theory and Practice of Concurrency. Prentice Hall, 1998
Relating Communicating Processes with Different Interfaces - Burton, Koutny, Pappalardo (Correct)
....behaviour abstraction, refinement, communicating sequential processes, compositionality, verification. 1 Introduction The software development process often involves refining a high level specification into a lower level or more concrete implementation. In the process algebraic context [8, 16, 18], both specification and implementation may be represented as processes, and the notion that a process Q implements a process P is based on the idea that Q is more deterministic than (or equivalent to) P in terms of the chosen semantics. In the following, we shall also refer to such ....
....structure of P in a more concrete and detailed manner; and still (ii) if this new structure is (conceptually) hidden, Q and P will exhibit the same behaviour at their external interface, which is assumed to be the same for both. Indeed, the standard notions of refinement, such as those of [8, 16, 18], are interested only in the behaviour observable at the interface of processes, and require the interfaces of the specification and implementation to be the same, so as to facilitate comparison. Yet in deriving an implementation from a specification we will often wish to implement abstract, ....
[Article contains additional citation context not shown here]
A. W. Roscoe: The Theory and practice of Concurrency. Prentice-Hall (1998).
Workshop on Reliable Embedded Systems, in conjunction with.. - October New Orleans (Correct)
....returns the appropriate error value based on the specified function. For example, the C standard I O library fread call will return up to but no more than the number of bytes that have been requested. A return value of 0 does not signify an error condition, just that no data is currently available [2]. A return value of 1 signifies an error and is what will be returned by paris f read. The use of program analysis to identify potential sources of problems has been previously presented in such systems as lint [3] that uses the approach to check for common portability errors. All problems are ....
P. J. Plauger. The Standard C Library. Prentice Hall, 1992.
Model Generation of Test Logic for Macrocell Based Designs - Torre, Calvo, Uceda (1996) (Correct)
....silicon area, dedicated operating system support, etc. The test views of a macrocell should include manufacturing test vectors, whether the cell uses structured DFT techniques, functional test vectors, and or BIST. Some methods have been proposed, based on the Boundary Scan standard IEEE 1149.1[3,4], as standards for manufacturing test in macrocell based designs [5] The aim of this method is to apply the test vectors of every macrocell test view serially through IEEE 1149.1 compliant scan registers that surround the macrocells. This solution is, however, very expensive in terms of ....
The Boundary Scan Handbook. K.P. Parker. Prentice Hall. 1992
Automated Proofs of Object Code for a Widely Used Microprocessor - Yu (1992) (20 citations) (Correct)
....it needs to be. One of the main reasons for our lack of confidence in computing systems is the lack of mathematical theories to forecast accurately the behaviors of computing systems. Simulation and testing can be a never ending proposition. Only the most trivial systems can be tested exhaustively [44]. However, if computing systems are modeled in some mathematical theory, they can be studied as mathematical objects, and therefore program proving becomes possible. By program proving, we refer to a mathematical proof that a program executed according to a certain (mathematical) model of ....
....in Chapter 7 the formal verification of the Berkeley implementation of the ANSI ISO C String Library [53, 28] Three programming errors were revealed in the process of our verification. Two were in the Berkeley Unix C string library. The other one was in Plauger s book The Standard C Library [44]. In the final chapter, we summarize our main results and contributions, consider the possible applications to our methodology, and speculate on future research directions. The ANSI and ISO C Standards are essentially identical. One error was undetected when we reported it to the author [50] ....
[Article contains additional citation context not shown here]
P. J. Plauger. The Standard C Library. Prentice Hall, New Jersey, 1992.
Compositional Verification of a Network of CSP Processes: using.. - Burton (Correct)
....Burton Department of Computing Science, University of Newcastle, Newcastle upon Tyne NE1 7RU, U.K. j.i.burton ncl.ac.uk Abstract. The paper [5] presented an implementation relation formalising what it means for one process to implement another in the CSP (Communicating Sequential Processes, [15]) framework in the event that the two processes have di erent interfaces. An improved version of the relation appears in [6] and allows for compositional veri cation of a network of CSP processes. The model checker FDR2( 15] may be used to check CSP re nement in the event that speci cation ....
....to implement another in the CSP (Communicating Sequential Processes, 15] framework in the event that the two processes have di erent interfaces. An improved version of the relation appears in [6] and allows for compositional veri cation of a network of CSP processes. The model checker FDR2([15]) may be used to check CSP re nement in the event that speci cation and implementation processes have the same interface. In this paper, we show how to transform the problem of checking the conditions from [6] where the speci cation and implementation processes have di erent interfaces, ....
[Article contains additional citation context not shown here]
A. W. Roscoe: The Theory and Practice of Concurrency. Prentice-Hall (1998).
Ahmed Fathi Waly - Virginia Polytechnic Institute Self-citation (Construction) (Correct)
No context found.
, "Managing the Construction Process" Prentice Hall, ISBN 0-13-352337-3.
Library Functions Timing Characterization - For Source-Level Analysis (2003) Self-citation (Library) (Correct)
No context found.
P. Plauger. The Standard C Library. Prentice Hall, Englewo o d Cli#s, NJ, USA, 1992.
Efficient FPGA Implementations and Cryptanalysis of.. - Trinca (2006) (Correct)
No context found.
Horspool, N., Gorman, P.: The ASIC Handbook. Prentice Hall (2001)
automata, a Hybrid System for Computational - Automata Theory Sutner (Correct)
No context found.
G. Glass and B. Schuchert. The STL . Prentice Hall, 1996.
Institut National Polytechnique De Grenoble - Attribu Par La (Correct)
No context found.
. The 8051 Family of Microcontroller, Richard H. Barned, Prentice-Hall, 1995
A Static Analyzer for Finding Dynamic Programming Errors - William Bush Jonathan (2000) (56 citations) (Correct)
No context found.
P.J. Plaugher, The Standard C Library, Prentice Hall, 1992.
Analyzing the Intel Itanium Memory Ordering Rules.. - Yang.. (2003) (Correct)
No context found.
The SPARC Architecture Manual, Version 9, Prentice Hall (1993)
Analyzing the Intel Itanium Memory Ordering Rules.. - Yang.. (2003) (Correct)
No context found.
The SPARC Architecture Manual, Version 9, Prentice Hall (1993)
A New Stack Technique for the Management of Runtime Structures .. - Hogen, Loogen (1993) (4 citations) (Correct)
No context found.
S.L. Peyton-Jones: The Implementation of Functional Programming Languages, Prentice Hall 1987.
Reliability Considerations of IP Micro Mobility Networks - Imre, Szalay (Correct)
No context found.
C. Huitema:IPv6 -- The New Internet Protocol, Prentice Hall, 1999.
CBack: A Simple Tool for Backtrack Programming in C - Helsgaun (1995) (Correct)
No context found.
P. J. Plauger, The Standard C Library, Prentice Hall, 1992.
An Extensible Framework for Building Interactive Courses on Web - Buraga (2001) (Correct)
No context found.
Amor, D., The E-Business (R)evolution, Prentice-Hall, 1999
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC