| |
 |
|
|
Cooke, John
Loughborough University of Technology
Loughborough, United Kingdom
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 55
reviews
|
|
|
|
|
|
|
|
Linearity and nondeletion on monadic context-free tree grammars
Fujiyoshi A. Information Processing Letters 93(3): 103-107, 2005. Type: Article
This short paper contains two results about context-free tree grammars (CFTGs). Such grammars can be monadic, linear, and/or nondeleting. The linear and nondeleting classifications are associated with like-named restrictions on the tre...
|
Jul 21 2005 |
|
|
|
|
|
|
Measures for mobile users: an architecture
Sillitti A., Janes A., Succi G., Vernazza T. Journal of Systems Architecture: the EUROMICRO Journal 50(7): 393-405, 2004. Type: Article
Software metrics, and measures of programmer productivity, are important to many people; this paper is about a tool that helps in the automatic collection of data associated with such statistics. Automatic collection is desirable becau...
|
Mar 10 2005 |
|
|
|
|
|
|
Genesys-Pro: Innovations in Test Program Generation for Functional Processor Verification
Adir A., Almog E., Fournier L., Marcus E., Rimon M., Vinov M., Ziv A. IEEE Design & Test of Computers 21(2): 84-93, 2004. Type: Article
In software engineering, “verification” refers to the requirement that a program must generate acceptable results for all valid inputs or initial states. The functional specification defines the function that a prog...
|
Dec 20 2004 |
|
|
|
|
|
|
CASL user manual: introduction to using the common algebraic specification language
Bidoit M., Mosses P., Springer-Verlag, London, UK, 2004. 240 pp. Type: Book (9783540207665)
It is important to note from the outset that this short Lecture Notes in Computer Science (LNCS) volume is the user manual for the common algebraic specification language (CASL), rather than the definitive and more extensive reference ...
|
Sep 30 2004 |
|
|
|
|
|
|
Polychrony for formal refinement-checking in a system-level design methodology
Talpin J., Le Guernic P., Shukla S., Gupta R., Doucet F. Application of concurrency to system design (ACSD ’03) (Proceedings of the Third International Conference on Application of Concurrency to System Design (ACSD ’03), Guimarces, Portugal, Jun 18-20, 2003) 92003. Type: Proceedings
This conference paper relates to verification by discharging proof obligations. It proposes a design method for “systems-on-a-chip,” the components of which are globally asynchronous and locally asynchronous (GALS)....
|
Sep 14 2004 |
|
|
|
|
|
|
Distinguishing string selection problems
Lanctot J., Li M., Ma B., Wang S., Zhang L. Information and Computation 185(1): 41-55, 2003. Type: Article
The title of this paper is ambiguous. Eventually, the paper considers problems that are solved by finding an optimal distinguishing string, but it does not directly distinguish between various string selection problems. Nor does the pa...
|
Mar 19 2004 |
|
|
|
|
|
|
A new algorithm for regularizing one-letter context-free grammars
Andrei S., Cavadini S., Chin W. Theoretical Computer Science 306(1-3): 113-122, 2003. Type: Article
This is part of an ongoing search for classes of context-free languages that can be regularized, and efficient methods for their construction. The basic notations and notions of context-free language theory are included (with the odd o...
|
Dec 17 2003 |
|
|
|
|
|
|
Boolean functions and computation models: preparing for the unthinkable
Clote P., Kranakis E., Springer-Verlag New York, Inc., Secaucus, NJ, 2002. 615 pp. Type: Book (9783540594369)
This is a European Association for Theoretical Computer Science (EATCS) volume on computational complexity. Its presentation is intense and concise from the outset....
|
Jul 10 2003 |
|
|
|
|
|
|
On parsing LL-languages
Blum N. Theoretical Computer Science 267(1-2): 49-59, 2001. Type: Article
LL(k) grammars are CFGs (context-free grammars) which can be parsed deterministically from left to right by looking forward at most k symbols at each step; traditionally implemented using a pushdown transducer....
|
Jul 10 2002 |
|
|
|
|
|
|
Verification by augmented finitary abstraction
Kesten Y., Pnueli A. Information and Computation 163(1): 203-243, 2000. Type: Article
The potentially infinite variation in the behavior of reactive systems means that finite-state techniques used with terminating programs may not be utilized directly. Verification by Finitary Abstraction (VFA) is a proof method for the...
|
Feb 1 2002 |
|
|
|
|
|
| |
|
|
| |
|
|
