(redirected from Aliases)
Also found in: Dictionary, Thesaurus, Medical, Financial, Encyclopedia.


[Latin, Otherwise called.] A term used to indicate that a person is known by more than one name.

Alias is a short and more popular phrase for alias dictus. The abbreviation a.k.a., also known as, is frequently used in connection with the description of a person sought by law enforcement officers to disclose the names that the person has been known to use. A fictitious name assumed by a person is popularly termed an alias.

West's Encyclopedia of American Law, edition 2. Copyright 2008 The Gale Group, Inc. All rights reserved.


n. 1) a name used other the given name of a person or reference to that other name, which may not be an attempt to hide his/her identity (such as Harry for Harold, initials or a maiden name). (See: a.k.a.)

Copyright © 1981-2005 by Gerald N. Hill and Kathleen T. Hill. All Right reserved.


‘another name’, particularly used to describe the use of another name by criminals. This practice makes it more difficult for them to be detected by the police. See AKA.
Collins Dictionary of Law © W.J. Stewart, 2006

ALIAS, practice. This word is prefixed to the name of a second writ of the same kind issued in the same cause; as, when a summons has been issued and it is returned by the sheriff, nil, and another is issued, this is called an alias summons. The term is used to all kinds of writs, as alias fi. fa., alias vend. exp. and the like. Alias dictus, otherwise called; a description of the defendant by an addition to his real name of that by which he is bound in the writing; or when a man is indicted and his name is uncertain, he may be indicted as A B, alias dictus C D. See 4 John. 1118; 1 John. Cas. 243; 2 Caines, R. 362; 3 Caines, R. 219.

A Law Dictionary, Adapted to the Constitution and Laws of the United States. By John Bouvier. Published 1856.
References in periodicals archive ?
Both algorithms call ComputeAliases to determine the aliases of an access path using the compact representation.
Since each of P procedures may have up to [A.sub.max] aliases holding in their Entry and Exit sets, the space complexity during the interprocedural phase is O(V * [A.sub.var] * P), which can also be expressed as O([A.sub.max] * P).
The resulting sets from these calls are used to create new aliases using the transfer function of Section 2.1.
Larus [1989] presents a flow-insensitive intraprocedural algorithm to compute aliases in LISP programs.
We conjecture that our flow-insensitive algorithm, extended to consider two calls to Compute Aliases at the same statement, satisfies the definition of precise as described by Horwitz [i997].
Like our algorithm, their algorithm optimistically grows the PCG as new function pointer aliases are discovered.
This set contains the aliases needed to hold on entry to the procedure to infer an alias at the given program point.
Aliases are represented as pairs of symbolic access paths, which are access paths qualified by integer coefficients representing iteration factors.
We have provided a framework and practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion, such as C, C-C+, Fortran 90, Java, and LISP.
For flow-sensitive analyses, these nonexplicit representations can be more precise in the presence of alias kills, but they can also be less precise than the explicit representation when aliases are merged at a join node of the PCG or CFG [Marlowe et al.
Assuming no aliases hold before S1, <*x,y> is the only alias holding after S1.
<**p,*x> and <**q,*x> in (19) are implicit aliases derived from <*p,x> and <*q,x>, respectively.