Horspool, N., Gorman, P.: The ASIC Handbook. Prentice Hall (2001)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....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.

....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.

....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.

....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.

....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.

.... 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.

....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.

....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

....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).

....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.

....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

....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.

....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).

....relationship between component processes in P net and those in Q net . Intuitively, P i is intended to specify Q i in some sense. Finally, assume that the interface of Q net , in terms of externally observable actions, is the same as that of P net . In process algebras, such as those used in [11, 15], the notion that a process Q net implements a process P net is based on the idea that Q net is more deterministic than (or equivalent to) P net in terms of the chosen semantics. In the following, we shall also refer to such specifications as target or base systems. The process of refining the ....

....concrete and detailed manner. However, we are able to hide the details of that internal structure, and then verify that this new internal structure still gives correct behaviour at the interface of Q net , which is still that of P net . Indeed, the standard notions of refinement, such as those of [11, 15], are interested only in observable actions, i.e. in the behaviour available at the interface of processes. However, the interfaces of the specification and implementation processes must be the same to facilitate comparison. A question naturally arises. What if we wish to approach this ....

[Article contains additional citation context not shown here]

A. W. Roscoe: The Theory and Practice of Concurrency. Prentice-Hall (1998).

....been mainly applied) in later phases of software development, e.g. the design phase (see for instance [6] As a result, there is a mismatch between the concepts used for early requirements specifications (such as goal, actor. and the constructs of formal specification languages such as Z [11], SCR [10] etc. Our aim is to provide a framework for the effective use of formal methods in the early requirements phase. The framework allows for the formal and mechanized analysis of early requirements specifications expressed in a formal modeling language. In this paper, we present some ....

J. Spivey. The Z Notation. Prentice Hall, 1989.

....concurrent systems in Z. A simple lift controller systems is then specified. Finally, a formal proof method based on a simple (weak) fairness rule is presented and is illustrated by means of proofs of safety and liveness properties of the lift controller system. 1 Introduction The Z notation [1] has proved itself to be a powerful and usable notation for specifying and verifying software systems. Although it has been mainly used for the specification of sequential systems, Z has also been successfully used to specify aspects of concurrent systems. For example, Duke et al. [2] and Fergus ....

Spivey J.M., The Z Notation (2nd Edition), Prentice Hall, 1993.

....(validated) In the most drastic cases, even the programming techniques cannot be lifted from the original framework(s) to the combination and this is clearly unacceptable from the user point of view. We want to keep the original semantics of each Casl [19] algebraic specification language Z [18] mathematical oriented notation ML (the purely functional functional programming language sublanguage of) 9] PASCAL data sublanguage the PASCAL sublanguage consisting of the type declarations and of the constant expressions Table 1: Data Languages Statechart [7, 8] visual notation for ....

M. Spivey. The Z Notation. Prentice-Hall, 1992.

....SPEC benchmarks. Four integer programs are eqntott, espresso, xlisp, and gcc. Six floating point programs are nasa7, doduc, spice2g6, tomcatv, matrix300, and fpppp. These programs are compiled by C and Fortran 77, with compiler optimizations turned on. The tracing system is based on SPARCstation 2 [6]. To produce the instruction traces of SPEC benchmark programs, Shadow is used [7] Each benchmark is traced for 10 million instructions and fed into the multiple branch predictor. In order to obtain the instruction traces uniformly from the wide range of each benchmark, 2 million instructions are ....

The SPARC Architecture Manual, Prentice-Hall, Inc., 1992.

....speci cation is tight enough. 2. SPECIFICATION APPROACH To carry out a formal analysis in a pragmatic way, we have reduced the complexity of the problem along two dimensions. First, we took a data oriented view of the system and formalized the service s data model in the Z language 1 . 1 Z [5] is a formal language based on typed set theory and rst order logic with equality. We have chosen Z for our work as the CORBA security service speci cation is heavily Second, we took a scenario driven approach to determine which parts of the OMG speci cation should be formalized, and then veri ed ....

J. Spivey. The Z Notation. Prentice Hall, 1998.

.... been mainly applied) in later phases of software development, e.g. the design phase (see for instance [6] As a result, there is a mismatch between the concepts used for early requirements specifications (such as goal, actor : and the constructs of formal specification languages such as Z [11], SCR [10] etc. Our aim is to provide a framework for the effective use of formal methods in the early requirements phase. The framework allows for the formal and mechanized analysis of early requirements specifications expressed in a formal modeling language. In this paper, we present some ....

J. Spivey. The Z Notation. Prentice Hall, 1989.

....of the S3.mp cache coherence protocol. During the verification, several design errors were discovered. We will describe two subtle errors which were found in the validation of S3.mp cache protocols. The first error violates Store Atomicity [3] which is a property of all SPARC memory models [17] prohibiting several processors from observing an inconsistent order of store operations. The loss of consistency occurs when the protocol allows more than one dirty cache line or the coexistence of shared and dirty copies. This condition, however, is too narrow to cover all possible protocol ....

.... performed order among stores is defined by the program order and the execution order of synchronization accesses [1] The programmer can specify the order constraints of memory accesses either implicitly by the choice of memory model or explicitly by using memory barrier (MEMBAR) instructions [17]. To verify the property of consistency, we need to keep track of values of all data copies. Extending the abstraction in [13] the values of any cached copy can be in one of five states: NoData (the cache has no valid copy) GlobalFresh (the cache has an up to date copy; value is defined by the ....

The SPARC Architecture Manual, Version 9, Prentice Hall.

....backwards compatibility it may be hoped that the existing C library functions will remain available, but then the exact rules for mixing use of the C printf and C operations will need to be documented. In the draft ANSI specification the section discussing the library is itself book sized[6] and will represent a significant leaning effort for users. Firm up newer features: Exception handling in C is (at the time of writing) still an area that has not stabilised, and there will be a great many other areas of the language where people will want to suggest small changes to the rules ....

P. J. Plauger. The Standard C++ Library. Prentice Hall, 1994.

....Merl to adopt our proposal. A more detailed description of Merl may be found at [4, 6] we give here just the highlights to understand the framework of our proposal. 2.1. Functional specifications We consider two kinds of functional specifications: Model oriented specifications. As in Z [16] or VDM [11] where a model of the component is stated and the specification is expressed mainly by means of pre and post conditions over the model. Algebraic specifications. As in Larch [8] or OBJ3 [9] the specification consists of a set of equations. We are particularly interested in the ....

J.M. Spivey. The Z Notation. Prentice-Hall, 1993.

....a specification and an implementation, each one with a functional part and a non functional one. The functional specification describes the services that the component provides. To be accurate, functional specifications should be stated using any of the existing specification languages, like Z [20] and Larch [9] for sequential systems, or CSP [12] and CHAM [2] for more general ones. The non functional specification declares which NF attributes are of interest for the component and establishes properties concerning them by means of NF requirements. In fact, NF attributes will be often ....

J.M. Spivey. The Z Notation. Prentice-Hall, 1993.

....classes of the same package. 3. Example extraneous features of the C and C languages include operator overloading, multiple inheritance, default arguments in function prototypes, passing objects to functions by value (thus automatically invoking a copy constructor) and so on. 4. Refer to [Plau92] for a description of these standards, as well as implementation strategies in C. Java as a Programming Language of Choice 2 May 15, 1998 1.1.1 The C Standard Template Library Moving forward from C to C , the recently standardized language contains libraries similar to that of C, with ....

P. J. Plauger, The Standard C Library. Prentice Hall, Inc., 1992. ISBN 0131315099.

....specifies the values for the AP fields and the C and B bits of a page table entry. A page table entry is encoded as follows: 0000.0000.0000.0000.0000.AP0d.ddd0.CB00 where: The fields and bits shown above are in accordance with the ARM Memory Management Unit Architecture definition in [2]. The indicated access permissions apply to the entire range specified by the arguments to map, which implies that the implementation of map must propagate the AP bits into each of the AP[0 3] sub page access permission fields of any second level descriptors that are used to accomplish the ....

The ARM Architecture, 1/e, Dave Jagger, Prentice Hall, March, 1997, (ISBN 0-13-736299-4).

....backwards compatibility it may be hoped that the existing C library functions will remain available, but then the exact rules for mixing use of the C printf and C operations will need to be documented. In the draft ANSI speci cation the section discussing the library is itself book sized[6] and will represent a signi cant leaning effort for users. Firm up newer features: Exception handling in C is (at the time of writing) still an area that has not stabilised, and there will be a great many other areas of the language where people will want to suggest small changes to the rules ....

P. J. Plauger. The Standard C++ Library. Prentice Hall, 1994.

....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 specifications, as defined 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 definition of the channel a. The channel can communicate an arbitrary finite number of values, and the resulting transition ....

A.W. Roscoe: The Theory and Practice of Concurrency. Prentice Hall, 1998

....In VDM (Bj rner and Jones, 1982] and Jones, 1986] and in Z (Spivey, 1988] possible values are de ned as sets using the standard set operators, in particular set comprehensions, i.e. the building of subsets satisfying a given formula. The same applies to the newer language B (Abrial, [1995]) with the additional possibility to de ne functions via abstraction. The speci cation language SAMT (Schewe, 1994] replaces sets by sophisticated type Formal Program Speci cations 59 speci cations with topos semantics in order to combine the model based approach with higherorder functions ....

....used formal notation. This order of presentation was chosen to show the existence of predicate transformers to depend on the chosen logic and to clarify the idea of the proof obligations in later chapters. This di ers from most introductions to Dijkstra s calculus as e.g. in the book of Abrial ([1995]) who starts with guarded commands and their informal meaning, or the one by Dijkstra and Scholten ( 1989] who give a brief informal motivation of predicate transformer properties such as universal conjunctivity, pairing condition, etc. followed by a presentation of guarded commands and their ....

[Article contains additional citation context not shown here]

J. R. Abrial (1995): The B Method , Prentice-Hall (to appear)

....the exact same problem I am working on. He constructed a model and a prototype tool to detect potential architectural mismatches during systems composition, while focusing on the main subroutine, pipe and filter, distributed processes, and event based styles. He modelled styles and systems using Z [Spivey 1992]. His complete Z model can be found on appendix B. 7 Abd Allah described some base elements that can be refined and combined in various ways in order to describe architectural styles and or specific systems (see figure 1) These base elements are: 1. A port is typically associated with a ....

J. Spivey, The Z Notation, Prentice Hall, 1992.

....to any code written in a formal language. This often means program code, and so code understanding is often called program understanding in the literature [1] However, there are other kinds of code than programs, such as: inexecutable formal specifications (e.g. VDM (Appendix B of [2] and Z [3]) SQL queries [4] information models (written in, for example, EXPRESS [5] or UML [6] To understand code means to extract knowledge from it. The knowledge extracted from code is usually at a higher level of abstraction than the code itself. 2 Usually, the direction of code ....

.... as: other information modelling languages (e.g. UML [6] imperative program code (e.g. Java [45] or C C [46] machine code; functional languages (e.g. SML [47] or LISP [48] logic languages (e.g. Prolog [49] formal specification languages (e.g. VDM (Appendix B of [2] or Z [3]) database query languages (e.g. SQL [4] scanner parser generators (e.g. lex and yacc [50] or JavaCC [51] There are several motivations for constraint understanding, including: Supporting human understanding of constraints; Generating code to check constraints; Transferring ....

Spivey JM. The Z notation. Prentice Hall, New York, 1994

....and verifiable process. 8.1 Related work and issues How does the proposed semantics compare with those of other modelling languages : The denotational approach has been used in the definition of many modelling languages and notations. For example, formal specification notations such as Z [7] and CSP [8] use this approach. The novelty of our approach is that we have concentrated on building a meta semantics model that has the flexibility to be applied in the definition of any UML like language. Languages such as those above do not have this flexibility, and therefore are not capable ....

J.M. Spivey: The Z Notation, Prentice Hall, 1992.

No context found.

, "Managing the Construction Process" Prentice Hall, ISBN 0-13-352337-3.

No context found.

P. Plauger. The Standard C Library. Prentice Hall, Englewo o d Cli#s, NJ, USA, 1992.

....some of the ways that are currently available in VisualWorks 2.5 to find classes are as follows: ffl Use the system browser. 1 1 1 This would entail first searching through the class categories and then finding the classes. Categories contain classes which are related in terms of their purpose [10], so they should be useful in finding appropriate classes. However, this may not always be the case. First, the classes may not be appropriately put into the same class category. For example, if the class was made with a certain application in mind, it may be put into a category with other classes ....

....done. The subjects were allowed to see any references they wanted. The following were provided: ffl VisualWorks User s Guide (both English and Japanese) ffl VisualWorks Cookbook (both English and Japanese) ffl VisualWorks Object Reference (English only) ffl The Art and Science of Smalltalk [10] ffl Smalltalk: An Introduction to Application Development Using VisualWorks [7] They were allowed to use any classes that were in the class library at the time of the experiment. They were also allowed to use any classes that existed as examples in the online documentation. 4 Results and ....

S. Lewis: The Art and Science of Smalltalk, Prentice Hall, 1995.

..... collecting and verifying information, identifying alternatives, anticipating consequences of decisions, making the choice using sound and logical judgement based on available information, informing others of decision and rationale, evaluating decisions. According to Simon [11], the decision making process consists of three main stages: 1. Intelligence: Fact finding, problem and opportunity sensing, analysis, and exploration. 2. Design: Formulation of solutions, generation of alternatives, modeling and simulation. 3. Choice: Goal maximization, alternative selection, ....

A.H. Simon: The New Science of Management Decision, Prentice-Hall, 1977.

....the aggregation of partial subproblems into the overall evaluation or classification of objects. The methodology of hierarchical decision models has been developed and extensively applied in relation to decision support [3] There, the decision makers are often faced with the problem of choice [4]: to choose an option from a set of available options so as to best satisfy the decision makers goals. In complex real life decision processes, the problem of choice can be extremely difficult, mainly because of complex, interrelated or even conflicting objectives. To support the decision maker, ....

A.H. Simon: The new science of management decision. Prentice-Hall, 1977.

No context found.

The Design of the Unix Operating System by Maurice J. Bach, Prentice Hall 1986

No context found.

Understanding the Business Process Reference Model, Prentice -Hall, New Jersey, 1998.

No context found.

Horspool, N., Gorman, P.: The ASIC Handbook. Prentice Hall (2001)

No context found.

G. Glass and B. Schuchert. The STL . Prentice Hall, 1996.

No context found.

. The 8051 Family of Microcontroller, Richard H. Barned, Prentice-Hall, 1995

No context found.

P.J. Plaugher, The Standard C Library, Prentice Hall, 1992.

No context found.

The SPARC Architecture Manual, Version 9, Prentice Hall (1993)

No context found.

The SPARC Architecture Manual, Version 9, Prentice Hall (1993)

No context found.

S.L. Peyton-Jones: The Implementation of Functional Programming Languages, Prentice Hall 1987.

No context found.

C. Huitema:IPv6 -- The New Internet Protocol, Prentice Hall, 1999.

No context found.

P. J. Plauger, The Standard C Library, Prentice Hall, 1992.

No context found.

Amor, D., The E-Business (R)evolution, Prentice-Hall, 1999

No context found.

Modeling the World with Objects, Paul Sully, Prentice--Hall, 1993.

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