%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "1.14",
%%% date = "19 November 2001",
%%% time = "08:48:27 MST",
%%% filename = "tcs1995.bib",
%%% address = "Center for Scientific Computing
%%% University of Utah
%%% Department of Mathematics, 322 INSCC
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 585 1640, +1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "42652 37775 148963 1668240",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org, beebe at ieee.org
%%% (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography, BibTeX, Theoretical Computer
%%% Science",
%%% supported = "yes",
%%% docstring = "This is a bibliography of publications in
%%% the journal Theoretical Computer Science
%%% (CODEN TCSCDI, ISSN 0304-3975), which
%%% began publishing in 1975.
%%%
%%% This file covers the years 1995--1999;
%%% companion files tcs19xx.bib and tcs20xx.bib
%%% each cover other pentads.
%%%
%%% The journal has World-Wide Web home sites
%%% at several locations:
%%%
%%% Title pages:
%%% http://www.elsevier.nl/locate/issn/03043975 (Europe)
%%% http://www.elsevier.com/locate/issn/03043975 (North America)
%%% http://www.elsevier.co.jp/locate/issn/03043975 (Japan)
%%% http://www.sciencedirect.com/science/journal/03043975
%%%
%%% Tables of contents:
%%% http://www.elsevier.nl/locate/tcs
%%% http://www.elsevier.nl/locate/estoc/03043975 (Europe)
%%% http://www.elsevier.com/locate/estoc/03043975 (North America)
%%% http://www.elsevier.co.jp/locate/estoc/03043975 (Japan)
%%%
%%% Elsevier Science alert page:
%%% http://www.elsevier.nl/mcs/tcs/Menu.html (Europe)
%%%
%%% The tables of contents sites begin coverage
%%% with Volume 91, Number 1, 1992, and have full
%%% text of articles from Volume 190, Number 1,
%%% 1998.
%%%
%%% At version 1.14, the year coverage looked
%%% like this:
%%%
%%% 1994 ( 3) 1997 ( 301) 2000 ( 1)
%%% 1995 ( 240) 1998 ( 333) 2001 ( 2)
%%% 1996 ( 289) 1999 ( 254)
%%%
%%% Article: 1423
%%%
%%% Total entries: 1423
%%%
%%% This bibliography was prepared by merging
%%% data from the TeX Users Group bibliography
%%% archive, the BibNet Project archive, the OCLC
%%% Contents1st database, the Compendex database,
%%% the IEEE INSPEC database, and the journal Web
%%% pages.
%%%
%%% Numerous errors in the sources noted above
%%% have been corrected. Spelling has been
%%% verified with the UNIX spell and GNU ispell
%%% programs using the exception dictionary
%%% stored in the companion file with extension
%%% .sok.
%%%
%%% BibTeX citation tags are uniformly chosen
%%% as name:year:abbrev, where name is the
%%% family name of the first author or editor,
%%% year is a 4-digit number, and abbrev is a
%%% 3-letter condensation of important title
%%% words. Citation tags were automatically
%%% generated by software developed for the
%%% BibNet Project.
%%%
%%% In this bibliography, entries are sorted in
%%% publication order within each journal,
%%% using bibsort -byvolume.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
@Preamble{"\hyphenation{
Bai-er
He-ma-chan-dra
Ko-ba-ya-shi
Kri-zanc
Lett-mann
Mal-u-szyn-ski
Mar-chet-ti
Mar-u-o-ka
Och-man-ski
Pal-a-mi-des-si
Piet-rzy-kow-ski
Pros-ku-row-ski
Pu-ru-sho-tha-man
Ros-en-krantz
Spor-tel-li
Sturt-i-vant
Ta-ka-da
Vau-zeilles
Win-kow-ski
Win-skel
to-po-log-ique
}"
#
"\ifx \k \undefined
\let \k = \c
\immediate\write16{Ogonek accent unavailable: replaced by cedilla}
\fi"
}
%=======================================================================
% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
Center for Scientific Computing,
University of Utah,
Department of Mathematics, 322 INSCC,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 585 1640, +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org|,
\path|beebe@ieee.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%=======================================================================
% Journal abbreviations:
@String{j-THEOR-COMP-SCI = "Theoretical Computer Science"}
%=======================================================================
% Bibliography entries, sorted in publication order:
@Article{Matos:1994:PSI,
author = "Armando B. Matos",
title = "Periodic sets of integers",
journal = j-THEOR-COMP-SCI,
volume = "127",
number = "2",
pages = "287--312",
day = "23",
month = may,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:08 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=127&issue=2",
note = "See remark \cite{Petersen:1995:RPB}.",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=127&issue=2&aid=1479",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Centro de Inf., Porto Univ., Portugal",
keywords = "concatenation; context-free language; context-free
languages; directed graph; directed graphs; finite
automata; Kleene closure; periodic sets of integers;
regular expressions",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Botelho:1994:BNN,
author = "Fernando Botelho and Max Garzon",
title = "{Boolean} neural nets are observable",
journal = j-THEOR-COMP-SCI,
volume = "134",
number = "1",
pages = "51--61",
day = "07",
month = nov,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=134&issue=1",
note = "See erratum \cite{Botelho:1997:EBN}.",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=134&issue=1&aid=1731",
acknowledgement = ack-nhfb,
classification = "C1230D (Neural nets); C4210 (Formal logic); C4220
(Automata theory)",
conflocation = "Kyoto, Japan; 25-28 Aug. 1992",
conftitle = "Second International Colloquium on Words, Languages
and Combinatorics",
corpsource = "Dept. of Math. Sci., Memphis State Univ., TN, USA",
keywords = "approximation errors; arbitrary cellular automata;
arbitrary locally finite discrete neural networks;
Boolean algebra; Boolean neural nets; cellular
automata; computer simulations; discretizations; linear
maps; neural nets; one dimensional grid; qualitative
behavior; shadowing property",
pubcountry = "Netherlands",
sponsororg = "Kyoto Sangyo Univ",
treatment = "T Theoretical or Mathematical",
}
@Article{Galmiche:1994:PNL,
author = "Didier Galmiche and Guy Perrier",
title = "On proof normalization in linear logic",
journal = j-THEOR-COMP-SCI,
volume = "135",
number = "1",
pages = "67--110",
day = "05",
month = dec,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:36 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=135&issue=1",
note = "See corrigendum \cite{Perrier:1998:CGP}.",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=135&issue=1&aid=1746",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4210 (Formal
logic); C6110L (Logic programming); C6140D (High level
languages)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "CRIN-CNRS, Vandoeuvre les Nancy, France",
keywords = "automated deduction; automatic proof construction;
formal logic; inference mechanisms; inference rules;
linear logic; logic programming; logic programming
languages; permutability properties; proof
normalization; proof-theoretic foundation; redundancy
reduction",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Hagiya:1995:TCP,
author = "Masami Hagiya",
title = "A typed $\lambda$-calculus for proving-by-example and
bottom-up generalization procedure",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "3--23",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1786",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4210 (Formal
logic)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "Dept. of Inf. Sci., Tokyo Univ., Japan",
keywords = "bottom-up generalization; bounded quantification;
inference mechanisms; inferences; lambda calculus;
linear arithmetical terms; logical framework;
mathematical inductions; nested inductions;
proving-by-example; typed lambda calculus",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
@Article{Jantke:1995:CBR,
author = "Klaus P. Jantke and Steffen Lange",
title = "Case-based representation and learning of pattern
languages",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "25--51",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1787",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4210L (Formal
languages and computational linguistics)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "Fachbereich Inf., Math. und Naturwissenschaften,
Hochschule f{\"u}r Tech. Wirtschaft und Kultur Leipzig
(FH), Germany",
keywords = "case-based reasoning; formal languages; inductively
learning; learnability; monotonic language learning;
pattern languages; representability problems;
semantics",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
@Article{Mukouchi:1995:TMT,
author = "Yasuhito Mukouchi and Setsuo Arikawa",
title = "Towards a mathematical theory of machine discovery
from facts",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "53--84",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1788",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C1240 (Adaptive
system theory); C4210L (Formal languages and
computational linguistics)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "Res. Inst. of Fundamental Inf. Sci., Kyushu Univ.,
Fukuoka, Japan",
keywords = "context-sensitive grammars; discovery from facts;
inductive inference; inductive inference machines;
inference mechanisms; learning (artificial
intelligence); length-bounded elementary formal
systems; logic programs; machine discovery;
mathematical theory; refutability",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
@Article{Jain:1995:ATL,
author = "Sanjay Jain and Arun Sharma",
title = "On aggregating teams of learning machines",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "85--108",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1789",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C1240 (Adaptive
system theory); C4210L (Formal languages and
computational linguistics); C4220 (Automata theory)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of
Singapore, Singapore",
keywords = "grammars; learning automata; learning machines;
learning power; success; success ratios; teams;
vacillatory identification",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
@Article{Sakurai:1995:VDD,
author = "Akito Sakurai",
title = "On the {VC-dimension} of depth four threshold circuits
and the complexity of {Boolean-valued} functions",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "109--127",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1790",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4230 (Switching theory);
C4240C (Computational complexity)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "Adv. Res. Lab., Hitachi Ltd., Saitama, Japan",
keywords = "Boolean functions; Boolean-valued functions;
complexity; computational complexity; depth four
threshold circuits; threshold circuits; threshold
elements; VC-dimension",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
@Article{Shinohara:1995:CCV,
author = "Ayumi Shinohara",
title = "Complexity of computing {Vapnik-Chervonenkis}
dimension and some generalized dimensions",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "129--144",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1791",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "Res. Inst. of Fundamental Inf. Sci., Kyushu Univ.,
Fukuoka, Japan",
keywords = "complexity; computability; computational complexity;
conjunctive normal form; learnability; learning
(artificial intelligence); NP-complete; PAC-learning;
polynomial-time reducible; satisfiability;
Vapnik-Chervonenkis dimension; VC-dimension",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
@Article{Hasegawa:1995:ALS,
author = "Susumu Hasegawa and Hiroshi Imai and Masaki Ishiguro",
title = "$\varepsilon$-approximations of $k$-label spaces",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "145--157",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1792",
acknowledgement = ack-nhfb,
classification = "C1240 (Adaptive system theory); C4240C
(Computational complexity); C4260 (Computational
geometry)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "Dept. of Inf. Sci., Tokyo Univ., Japan",
keywords = "computational complexity; computational geometry;
epsilon-approximation; $k$-label spaces; learning by
example; learning from examples; negative examples;
positive examples; randomized algorithm; sample
complexity; Voronoi diagram",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
@Article{Nakamura:1995:ELL,
author = "Atsuyoshi Nakamura and Naoki Abe",
title = "Exact learning of linear combinations of monotone
terms from function value queries",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "1",
pages = "159--176",
day = "09",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:44 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=1&aid=1793",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C4210 (Formal
logic)",
conflocation = "Tokyo, Japan; 8-10 Nov. 1993",
conftitle = "4th International Workshop, ALT'93. Algorithmic
Learning Theory",
corpsource = "C and C Res. Labs., NEC Corp., Kawasaki, Japan",
keywords = "Boolean functions; function value queries; learning
(artificial intelligence); learning algorithm; monotone
terms; time; worst case",
pubcountry = "Netherlands",
sponsororg = "Japanese Soc. Artificial Intelligence",
treatment = "T Theoretical or Mathematical",
}
@Article{Fernau:1995:VLA,
author = "Henning Fernau",
title = "Valuations of languages, with applications to fractal
geometry",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "2",
pages = "177--217",
day = "23",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=2&aid=1690",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4260 (Computational geometry); C6130B
(Graphics techniques)",
corpsource = "Lehrstuhl Inf. f{\"u}r Ingenieure und
Naturwissenschaftler, Karlsruhe Univ., Germany",
keywords = "Bernoulli morphisms; computational geometry;
context-free grammars; context-free languages;
Euclidean spaces; formal languages; fractal geometry;
fractals; Hausdorff dimension; morphisms; valuations of
languages",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Fabre:1995:SSN,
author = "St{\'e}phane Fabre",
title = "Substitutions et syst{\`e}mes de num{\'e}ration.
({French}) [{Substitutions} and beta numbering
systems]",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "2",
pages = "219--236",
day = "23",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=2&aid=1692",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. de Math., Univ. de Paris-Nord, Villetaneuse,
France",
keywords = "automata theory; beta numbering systems; $k$-automata;
substitutions",
language = "English; French",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Esik:1995:EPK,
author = "Z. {\'E}sik and L. Bern{\'a}tsky",
title = "Equational properties of {Kleene} algebras of
relations with conversion",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "2",
pages = "237--251",
day = "23",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=2&aid=1682",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics)",
corpsource = "Dept. of Comput. Sci., A. Jozsef Univ., Szeged,
Hungary",
keywords = "binary relations; Boolean algebra; composition;
conversion; equational axioms; equational properties;
formal languages; Kleene algebras; reflexive-transitive
closure; relations with conversion; union",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Takahashi:1995:MSP,
author = "Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani",
title = "Mixed searching and proper-path-width",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "2",
pages = "253--268",
day = "23",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=2&aid=1813",
acknowledgement = ack-nhfb,
classification = "B0240E (Game theory); C1140E (Game theory); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Electr. and Electron. Eng., Tokyo Inst. of
Technol., Japan",
keywords = "complexity results; computational complexity; game
theory; mixed search game; mixed-search number;
proper-path-width; search problems; searching",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Breslauer:1995:FPS,
author = "Dany Breslauer",
title = "Fast parallel string prefix-matching",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "2",
pages = "269--278",
day = "23",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=2&aid=1811",
acknowledgement = ack-nhfb,
classification = "C4240P (Parallel programming and algorithm theory);
C6130 (Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark",
keywords = "CRCW-PRAM algorithm; KMP failure function; parallel
algorithms; parallel string prefix-matching; string
matching",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Arvind:1995:INP,
author = "Vikraman Arvind and Johannes K{\"o}bler and Uwe
Sch{\"o}ning and Rainer Schuler",
title = "If {NP} has polynomial-size circuits, then {MA$=$AM}",
journal = j-THEOR-COMP-SCI,
volume = "137",
number = "2",
pages = "279--282",
day = "23",
month = jan,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=137&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=137&issue=2&aid=1783",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity)",
corpsource = "Dept. of Comput. Sci., Inst. of Math. Sci., Madras,
India",
keywords = "Arthur-Merlin hierarchy; computational complexity;
polynomial-size circuits; polynomial-time hierarchy",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Alur:1995:AAH,
author = "R. Alur and C. Courcoubetis and N. Halbwachs and T. A.
Henzinger and P.-H. Ho and X. Nicollin and A. Olivero
and J. Sifakis and S. Yovine",
title = "The algorithmic analysis of hybrid systems",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "3--34",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1836",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4220 (Automata
theory); C6110F (Formal methods)",
corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA",
keywords = "algorithmic analysis; analog environment;
approximation techniques; convex polyhedra;
decidability; discrete program; finite automata; formal
specification; hybrid systems; infinite state space;
minimisation; minimization procedures; multidimensional
real space; piecewise-linear trajectories;
program-analysis techniques; reachability analysis;
symbolic model-checking",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Asarin:1995:RAD,
author = "Eugene Asarin and Oded Maler and Amir Pnueli",
title = "Reachability analysis of dynamical systems having
piecewise-constant derivatives",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "35--65",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1862",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1310 (Control
system analysis and synthesis methods); C4290 (Other
computer theory); C6110 (Systems analysis and
programming)",
corpsource = "Inst. of Inf. Transmission Problems, Acad. of Sci.,
Moscow, Russia",
keywords = "computation theory; constant vector field; decision
procedure; discrete transitions; dynamical systems;
embedded systems; Euclidean space partitioning; hybrid
systems; PCD systems; piecewise-constant derivatives;
polyhedral sets; reachability analysis; real-time
systems; region boundaries; set theory; state-space
methods; state-space subsets; system description;
trajectory directions; two-dimensional systems;
undecidability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Branicky:1995:UCO,
author = "Michael S. Branicky",
title = "Universal computation and other capabilities of hybrid
and continuous dynamical systems",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "67--100",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1797",
acknowledgement = ack-nhfb,
classification = "C4170 (Differential equations); C4220 (Automata
theory); C4290 (Other computer theory)",
corpsource = "Lab. for Inf. and Decision Syst., MIT, Cambridge, MA,
USA",
keywords = "asynchronous arbiter problem; clocks; closed subsets;
continuous dynamical systems; differential equations;
exact clock; finite automata; hybrid systems; Lipschitz
ODEs; ordinary differential equations; precise binary
timing pulse; reversible discrete dynamical systems;
simulation; Turing machines; universal computation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Grossman:1995:AAH,
author = "R. L. Grossman and R. G. Larson",
title = "An algebraic approach to hybrid systems",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "101--112",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1796",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C1340K (Nonlinear control systems);
C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Math. Stat. and Comput. Sci., Illinois Univ.,
Chicago, IL, USA",
keywords = "algebra; algebraic model; continuous nonlinear control
systems; control theory; discrete finite state
automaton; discrete input symbols; finite automata;
hybrid systems; nonlinear control systems; realization
theory; switching; theorem proving",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hansen:1995:FD,
author = "Michael R. Hansen and Paritosh K. Pandya and Zhou
Chaochen",
title = "Finite divergence",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "113--139",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1795",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Tech. Univ. Denmark, Lyngby,
Denmark",
keywords = "accumulative divergence; axioms; dense divergence;
discrete divergence; duration calculus; finite
automata; finite divergence; hybrid systems; induction
rules; infinitely variable system state; nonlinear
systems; occurrence patterns; pathological behaviour;
proof rules; real-time systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Kohn:1995:VHS,
author = "Wolf Kohn and Anil Nerode and Jeffrey B. Remmel and
Alexander Yakhnis",
title = "Viability in hybrid systems",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "141--168",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1800",
acknowledgement = ack-nhfb,
classification = "C1310 (Control system analysis and synthesis
methods); C4220 (Automata theory)",
corpsource = "Intermetrics Corp., Washington, DC, USA",
keywords = "closed viability set; compact control space; compact
state space; continuous plants; control theory; digital
automata; disturbances; enforcing viability; finite
automata; finite-state control automata; fixpoints;
graph operators; hybrid systems; interacting systems;
local viability graphs; nonempty closed subset;
performance specification; plant state trajectories;
state-space methods; sturdiness property; viable
trajectories",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lakhneche:1995:MTL,
author = "Yassine Lakhneche and Jozef Hooman",
title = "Metric temporal logic with durations",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "169--199",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1801",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C6110F (Formal methods)",
corpsource = "Inst. f{\"u}r Inf. und Praktische Math., Kiel Univ.,
Germany",
keywords = "axioms; continuous environment; duration calculus;
duration property proving; expressiveness; formal
specification; formal verification; integral formula;
metric temporal logic; real-time systems; sound rule;
specification; system state durations; temporal logic;
timed transition systems; verification",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lemmon:1995:IIV,
author = "Michael Lemmon and Panos J. Antsaklis",
title = "Inductively inferring valid logical models of
continuous-state dynamical systems",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "201--210",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1798",
acknowledgement = ack-nhfb,
classification = "C1310 (Control system analysis and synthesis
methods); C1320 (Stability in control theory); C1340D
(Discrete control systems)",
corpsource = "Dept. of Electr. Eng., Notre Dame Univ., IN, USA",
keywords = "affine control policies; continuous time systems;
continuous-state dynamical systems; continuous-state
plant; control systems; control theory; control vector
space; controller synthesis; discrete event controller;
discrete event systems; ellipsoid method; equivalent
discrete-event system representation; hybrid control
systems; inductive inference; inductively determined
feasible points; initial plant state variations;
invariance; linear inequalities; logical invariance;
method-of-centers algorithm; plant transitions;
stability; stable transitions; state-space methods;
sufficient conditions; supervisory control; temporal
reasoning; valid logical models; vectors",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Zhang:1995:CNS,
author = "Ying Zhang and Alan K. Mackworth",
title = "Constraint nets: a semantic model for hybrid dynamic
systems",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "1",
pages = "211--239",
day = "06",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:49 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=1&aid=1799",
acknowledgement = ack-nhfb,
classification = "C1310 (Control system analysis and synthesis
methods); C1340D (Discrete control systems); C4240
(Programming and algorithm theory); C6110F (Formal
methods); C7420 (Control engineering computing)",
corpsource = "Dept. of Comput. Sci., British Columbia Univ.,
Vancouver, BC, Canada",
keywords = "abstract algebra; abstract topology; aggregation
operators; algebraic specification; asynchronous event
structures; constraint nets; constraint theory;
continuous components; continuous time systems; control
system synthesis; controller dynamics; discrete
components; discrete systems; environment dynamics;
event-controlled components; hierarchical modelling;
hybrid dynamic systems; hybrid real-time embedded
systems; multiple abstraction levels; plant dynamics;
programming theory; real-time systems; rigorous formal
programming semantics; robotic system; semantic model;
synchronous event structures; topology; unitary
framework",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Davies:1995:BHT,
author = "Jim Davies and Steve Schneider",
title = "A brief history of {Timed CSP}",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "2",
pages = "243--271",
day = "20",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=2&aid=1803",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Dept. of Comput. Sci., Reading Univ., UK",
keywords = "communicating sequential processes; compositional
proof system; theorem proving; timed CSP; timed models;
timed process algebras; timed refinement; untimed
models",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Mislove:1995:FPC,
author = "M. W. Mislove and A. W. Roscoe and S. A. Schneider",
title = "Fixed points without completeness",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "2",
pages = "273--314",
day = "20",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=2&aid=1804",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240C (Computational complexity); C4240P
(Parallel programming and algorithm theory)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Dept. of Math., Tulane Univ., New Orleans, LA, USA",
keywords = "communicating sequential processes; complete metric
space; computational complexity; CSP operator;
deterministic timed processes; dominating space;
dominating spaces; FACS 3; fixed point theory; infinite
nondeterminism; locally complete partial order; set
theory; timed infinite traces model; timed
predeterministic processes; timing; unbounded
nondeterminism; underlying CSP mode; untimed CSP",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Lowe:1995:PPM,
author = "Gavin Lowe",
title = "Probabilistic and prioritized models of timed {CSP}",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "2",
pages = "315--352",
day = "20",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=2&aid=1805",
acknowledgement = ack-nhfb,
classification = "C1140Z (Other topics in statistics); C4210L (Formal
languages and computational linguistics); C4240P
(Parallel programming and algorithm theory)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Comput. Lab., Oxford Univ., UK",
keywords = "algebraic laws; communicating sequential processes;
communications protocol; formal languages; fully
deterministic language; message transmission;
prioritized models; prioritized operators;
probabilistic choice operator; probabilistic language;
probabilistic models; probability; semantic model;
syntax; timed CSP; timing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hennessy:1995:SB,
author = "M. Hennessy and H. Lin",
title = "Symbolic bisimulations",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "2",
pages = "353--389",
day = "20",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=2&aid=1806",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210L (Formal
languages and computational linguistics)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Sch. of Cognitive and Comput. Sci., Sussex Univ.,
Brighton, UK",
keywords = "arbitrary finite symbolic trees; bisimulation
equivalence; Boolean algebra; Boolean expressions;
finite symbolic transition graphs; formal languages;
graph theory; infinite value set; labelled transition
graph; labelled transitions graph; operational
semantics; process algebra; symbolic actions; symbolic
bisimulations; symbolic transition graph; symbolic
transition graphs; value passing process languages",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{DeNicola:1995:PAV,
author = "Rocco {De Nicola} and Roberto Segala",
title = "A process algebraic view of input\slash output
automata",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "2",
pages = "391--423",
day = "20",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=2&aid=1807",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Dipartimento di Sci. dell'Inf., Rome Univ., Italy",
keywords = "algebraic characterization; automata theory; complete
axiomatization; concurrent algorithms; external trace
preorder relation; finitely branching transition
relation; finitely branching transition systems; I/O
automata; input enabling; input/output automata; local
control; many-sorted algebra; process algebra; process
algebraic view; recursion free processes;
specification; verification",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pinna:1995:NEA,
author = "G. Michele Pinna and Axel Poign{\'e}",
title = "On the nature of events: another perspective in
concurrency",
journal = j-THEOR-COMP-SCI,
volume = "138",
number = "2",
pages = "425--454",
day = "20",
month = feb,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:51 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=138&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=138&issue=2&aid=1808",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240P (Parallel
programming and algorithm theory)",
conflocation = "Oxford, UK; April 1992",
conftitle = "Mathematical Foundations of Programming Semantics",
corpsource = "Gesellschaft f{\"u}r Math. und Datenverarbeitung mbH,
St. Augustin, Germany",
keywords = "abstraction; asymmetric conflict; automata theory;
concurrency; event automata; event based formalism;
geometric automata; parallel algorithms; partially
synchronous products; possible events; quiescent
states; reachable states; refinement; state change;
synchronization operators",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Hodkinson:1995:GTF,
author = "Ian Hodkinson",
title = "On {Gabbay}'s temporal fixed point operator",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "1--25",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1725",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4250 (Database theory)",
corpsource = "Dept. of Comput., Imperial Coll. of Sci., Technol. and
Med., London, UK",
keywords = "decidability; decidable; executable temporal logic
system; monadic second-order logic; PSPACE-complete
satisfiability problem; temporal fixed point operator;
temporal logic; USF",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Pappinghaus:1995:LU,
author = "Peter P{\"a}ppinghaus",
title = "On the logic of {UNITY}",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "27--67",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1684",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240C (Computational
complexity); C6110F (Formal methods); C6110P (Parallel
programming)",
corpsource = "Corp. Res. and Dev., Siemens AG, Munich, Germany",
keywords = "complexity; computational complexity; computational
power; decidability; fair execution sequences; formal
specification; halting set; infinitary closure
conditions; nondeterministic numerical function;
parallel programming; parallel programs; program
verification; programming logic; semantic completeness;
specification; transfinite induction; UNITY approach;
verification",
pubcountry = "Netherlands",
treatment = "A Application; P Practical",
}
@Article{Cockett:1995:SCD,
author = "J. Robin B. Cockett and Dwight Spencer",
title = "Strong categorical datatypes. {II.} {A} term logic for
categorical programming",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "69--113",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1740",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., Calgary Univ., Alta., Canada",
keywords = "abstract data types; abstract language; categorical
programming; charity programming system; combinator
reduction system; complexity; computational complexity;
constructors; distributive categorical setting;
expressive computing environment; fold; Hagino-Wraith
style; program equivalences; programming theory; state
transformations; strong categorical datatypes; strong
type-forming functor; term logic; uniqueness
properties",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Barr:1995:NAC,
author = "Michael Barr",
title = "Nonsymmetric $*$-autonomous categories",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "115--130",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1730",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math. and Stat., McGill Univ., Montreal,
Que., Canada",
keywords = "equivalent forms; formal logic; linear logic;
nonsymmetric *-autonomous categories; nonsymmetric
linear logic; symmetric monoidal categories; temporal
dependencies",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{Ghelli:1995:DTC,
author = "Giorgio Ghelli",
title = "Divergence of {$F_<$} type checking",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "131--162",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1678",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory); C4250 (Database theory)",
corpsource = "Dipartimento di Inf., Pisa Univ., Italy",
keywords = "bounded second-order lambda abstraction; functional
languages; inheritance; lambda calculus; second-order
typed lambda calculus; subtype hierarchy; subtypes;
type checking; type theory; typed functional languages;
undecidability",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
xxtitle = "Divergence of {$F_⩽$} type checking",
xxtitle = "Divergence of {$F_\le$} type checking",
}
@Article{Bergeron:1995:SCD,
author = "Anne Bergeron",
title = "Sharing out control in distributed processes",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "163--186",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1773",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1340D (Discrete
control systems)",
corpsource = "LACIM, Montreal Univ., Que., Canada",
keywords = "controllable events; discrete event systems; discrete
processes; distributed control; distributed processes;
global specification; partial information; partial
observation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Malacaria:1995:SET,
author = "Pasquale Malacaria",
title = "Studying equivalences of transition systems with
algebraic tools",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "187--205",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1688",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic)",
corpsource = "LIENS-DMI, Ecole Normale Superieure, Paris, France",
keywords = "algebraic framework; algebraic tools; bisimulation;
Boolean completion; equality of languages; equivalence
classes; equivalences; formal logic; minimal transition
system; monad; observational equivalences; skeleton
equivalence; subalgebras isomorphisms; trace
equivalence; transition systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Dougherty:1995:CLA,
author = "Daniel J. Dougherty and Patricia Johann",
title = "A combinatory logic approach to higher-order
{E}-unification",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "207--242",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1844",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., Wesleyan Univ., Middletown, CT, USA",
keywords = "combinatory logic approach; combinatory logic
framework; convergent term rewriting system;
first-order equational theory; formal logic;
higher-order E-unification; ordinary narrowing;
rewriting systems; type variables",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Moschovakis:1995:CCP,
author = "Yiannis N. Moschovakis",
title = "Computable concurrent processes",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "243--273",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1758",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Dept. of Math., California Univ., Los Angeles, CA,
USA",
keywords = "classical set-functions; computability; concurrent
processes; fair merge constructs; normal form theorem;
process transformations; relative computability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Bernot:1995:OSI,
author = "Gilles Bernot and Michel Bidoit and Teodor Knapik",
title = "Observational specifications and the
indistinguishability assumption",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "275--314",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1658",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory); C6110F (Formal methods); C6150G
(Diagnostic, testing, debugging and evaluating
systems)",
corpsource = "LIENS, Ecole Normale Superieure, Paris, France",
keywords = "algebraic specification; data type specifications;
equational axiom; formal specification;
indistinguishability assumption; observational
equality; observational satisfaction relation;
observational specifications; program verification;
semantics; software correctness; term observation",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Inverardi:1995:DOC,
author = "P. Inverardi and M. Nesi",
title = "Deciding observational congruence of finite-state
{CCS} expressions by rewriting",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "315--354",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1715",
acknowledgement = ack-nhfb,
classification = "C4210L (Formal languages and computational
linguistics); C4240P (Parallel programming and
algorithm theory)",
corpsource = "Istituto di Elaborazione dell'Inf., CNR, Pisa, Italy",
keywords = "axiomatization; calculus of communicating systems;
finite representation; finite-state CCS expressions;
guarded recursive CCS expressions; infinite
derivations; non terminating rewriting relation; normal
forms; normal process graph; observational congruence;
rewriting strategy; rewriting systems; structured fair
derivations; term rewriting approach",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Weiermann:1995:TPT,
author = "Andreas Weiermann",
title = "Termination proofs for term rewriting systems by
lexicographic path orderings imply multiply recursive
derivation lengths",
journal = j-THEOR-COMP-SCI,
volume = "139",
number = "1--2",
pages = "355--362",
day = "06",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:53 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=139&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=139&issue=1-2&aid=1776",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210L (Formal
languages and computational linguistics); C4240
(Programming and algorithm theory)",
corpsource = "Inst. f{\"u}r Math. Logik und Grundlagenforschung,
Munster Univ., Germany",
keywords = "lexicographic path orderings; multiply recursive
bound; multiply recursive derivation lengths; rewriting
systems; set theory; term rewriting systems;
termination proof; theorem proving",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Pigozzi:1995:LAA,
author = "Don Pigozzi and Antonino Salibra",
title = "Lambda abstraction algebras: representation theorems",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "1",
pages = "5--52",
day = "20",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=1&aid=1837",
acknowledgement = ack-nhfb,
classification = "C1110 (Algebra); C4210 (Formal logic)",
conflocation = "Enschede, Netherlands; 21-25 June 1993",
conftitle = "Third International Conference on Algebraic
Methodology and Software Technology, AMAST",
corpsource = "Dept. of Math., Iowa State Univ., Ames, IA, USA",
keywords = "algebra; combinatory algebras; lambda abstraction
algebras; lambda calculus; natural intrinsic
characterization; representation theorems; true
identities; universal algebra; untyped lambda
calculus",
pubcountry = "Netherlands",
sponsororg = "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
Univ. Stirling; INRIA; et al",
treatment = "T Theoretical or Mathematical",
}
@Article{Laroussinie:1995:TBM,
author = "F. Laroussinie and S. Pinchinat and Ph. Schnoebelen",
title = "Translations between modal logics of reactive
systems",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "1",
pages = "53--71",
day = "20",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=1&aid=1838",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
conflocation = "Enschede, Netherlands; 21-25 June 1993",
conftitle = "Third International Conference on Algebraic
Methodology and Software Technology, AMAST",
corpsource = "Lifia, IMAG, Grenoble, France",
keywords = "backward modalities; branching bisimulation;
branching-time framework; expressivity; formal logic;
forward modalities; meaning-preserving translations;
modal logics; reactive systems; separation theorem",
pubcountry = "Netherlands",
sponsororg = "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
Univ. Stirling; INRIA; et al",
treatment = "T Theoretical or Mathematical",
}
@Article{Gorrieri:1995:TPD,
author = "Roberto Gorrieri and Marco Roccetti and Enrico
Stancampiano",
title = "A theory of processes with durational {Actions}",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "1",
pages = "73--94",
day = "20",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=1&aid=1839",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory); C6110F (Formal methods)",
conflocation = "Enschede, Netherlands; 21-25 June 1993",
conftitle = "Third International Conference on Algebraic
Methodology and Software Technology, AMAST",
corpsource = "Dipartimento di Matematica, Bologna Univ., Italy",
keywords = "bisimulation based semantics; calculus of
communicating systems; durational actions; formal
specification; parallel programming; partial ordering
bisimulation equivalence; performance equivalence;
performance evaluation; process algebras; step
bisimulation equivalence; temporal logic",
pubcountry = "Netherlands",
sponsororg = "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
Univ. Stirling; INRIA; et al",
treatment = "T Theoretical or Mathematical",
}
@Article{Mokkedem:1995:UTL,
author = "Abdelillah Mokkedem and Dominique M{\'e}ry",
title = "On using temporal logic for refinement and
compositional verification of concurrent systems",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "1",
pages = "95--138",
day = "20",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=1&aid=1840",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory); C6110F (Formal methods); C6110P
(Parallel programming)",
conflocation = "Enschede, Netherlands; 21-25 June 1993",
conftitle = "Third International Conference on Algebraic
Methodology and Software Technology, AMAST",
corpsource = "CNRS, CRIN, Vandoeuvre les Nancy, France",
keywords = "abstract semantics; coarser-grained program;
compositional proof systems; compositional
verification; concurrent program design; concurrent
systems; observation level; parallel programming;
parallel programs; program verification; refined
temporal language; refinement; temporal logic; temporal
logic semantics; temporal semantics; w-stuttering",
pubcountry = "Netherlands",
sponsororg = "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
Univ. Stirling; INRIA; et al",
treatment = "P Practical",
}
@Article{Navarro:1995:CMS,
author = "Marisa Navarro and Fernando Orejas and Ana
S{\'a}nchez",
title = "On the correctness of modular systems",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "1",
pages = "139--177",
day = "20",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=1&aid=1841",
acknowledgement = ack-nhfb,
classification = "C6110B (Software engineering techniques)",
conflocation = "Enschede, Netherlands; 21-25 June 1993",
conftitle = "Third International Conference on Algebraic
Methodology and Software Technology, AMAST",
corpsource = "Dept. Leng. y Syst. Inf., Pais Vasco Univ., San
Sebastian, Spain",
keywords = "abstract framework; behavioural equivalence relation;
modular software design; modular systems correctness;
programming language levels; semantic constructs;
software engineering; specification; systems analysis",
pubcountry = "Netherlands",
sponsororg = "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
Univ. Stirling; INRIA; et al",
treatment = "P Practical",
}
@Article{Wagner:1995:RMO,
author = "E. G. Wagner",
title = "On the role of memory in object-based and
object-oriented languages",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "1",
pages = "179--199",
day = "20",
month = mar,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=1",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=1&aid=1842",
acknowledgement = ack-nhfb,
classification = "C6110F (Formal methods); C6110J (Object-oriented
programming); C6120 (File organisation); C6140D (High
level languages)",
conflocation = "Enschede, Netherlands; 21-25 June 1993",
conftitle = "Third International Conference on Algebraic
Methodology and Software Technology, AMAST",
corpsource = "Wagner Math., Garrison, NY, USA",
keywords = "class specification; formal specification;
inheritance; mathematical memory model; object-based
programming languages; object-oriented languages;
object-oriented programming languages; programming
constructs",
pubcountry = "Netherlands",
sponsororg = "CEC; Office of Naval Res.; Univ. Twente; Univ. Iowa;
Univ. Stirling; INRIA; et al",
treatment = "P Practical",
}
@Article{Dattasharma:1995:AVR,
author = "Abhi Dattasharma and S. Sathiya Keerthi",
title = "An augmented {Voronoi} roadmap for {$3$D}
translational motion planning for a convex polyhedron
moving amidst convex polyhedral obstacles",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "2",
pages = "205--230",
day = "03",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=2&aid=1825",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C3390 (Robotics); C4240C (Computational
complexity); C4260 (Computational geometry)",
corpsource = "Dept. of Comput. Sci. and Autom., Indian Inst. of
Sci., Bangalore, India",
keywords = "3D translational motion planning; augmented Voronoi
roadmap; computational complexity; computational
geometry; convex polyhedral obstacles; convex
polyhedron; disjoint components; geometric structure;
path planning; robot dynamics",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sarrafzadeh:1995:DWP,
author = "Majid Sarrafzadeh and Sanjeev R. Maddila",
title = "Discrete warehouse problem",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "2",
pages = "231--247",
day = "03",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=2&aid=1826",
acknowledgement = ack-nhfb,
classification = "C1230 (Artificial intelligence); C3120C (Spatial
variables control); C3320 (Control applications to
materials handling); C3390 (Robotics)",
corpsource = "Dept. of Electr. Eng. and Comput. Sci., Northwestern
Univ., Evanston, IL, USA",
keywords = "discrete warehouse problem; feasible motions; motion
planning problems; movable obstacles; necessary and
sufficient conditions; obstacle manipulations;
obstacles; path planning; position control; robot;
robots; two-dimensional unit-square objects",
pubcountry = "Netherlands",
treatment = "A Application; P Practical",
}
@Article{Prasad:1995:NCS,
author = "L. Prasad and S. S. Iyengar",
title = "A note on the combinatorial structure of the
visibility graph in simple polygons",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "2",
pages = "249--263",
day = "03",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=2&aid=1827",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C3120C (Spatial variables control);
C3390 (Robotics); C4240C (Computational complexity);
C4260 (Computational geometry); C6120 (File
organisation)",
corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton
Rouge, LA, USA",
keywords = "combinatorial structure; complexity; computational
complexity; computational geometry; computer science;
data structure; data structures; engineering;
hierarchical relationships; mathematical tool; motion
planning; necessary and sufficient conditions; path
planning; polyhedral objects; position control; robotic
navigation problems; shortest-path planning; simple
polygons; unknown-terrain learning; visibility graph",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Rao:1995:FPS,
author = "Nageswara S. V. Rao",
title = "On fast planning of suboptimal paths amidst polygonal
obstacles in plane",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "2",
pages = "265--289",
day = "03",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=2&aid=1828",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C4240C (Computational complexity); C4260
(Computational geometry)",
corpsource = "Center for Eng. Syst. Adv. Res., Oak Ridge Nat. Lab.,
TN, USA",
keywords = "computational complexity; computational geometry;
destination point; hierarchical implementation;
navigational algorithms; obstacle vertices; path
planning; point robot; polygonal obstacles; shortest
path problem; source point; suboptimal paths planning;
time complexity; trapezoidal decomposition;
triangulation; upper bounds; Voronoi diagrams",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Sridhar:1995:EAS,
author = "R. Sridhar and K. Han and N. Chandrasekharan",
title = "Efficient algorithms for shortest distance queries on
special classes of polygons",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "2",
pages = "291--300",
day = "03",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=2&aid=1829",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C3390 (Robotics); C4240C (Computational
complexity); C4260 (Computational geometry)",
corpsource = "Sch. of Comput. Sci., Oklahoma Univ., Norman, OK,
USA",
keywords = "chordal graph; computational complexity; computational
geometry; CREW-PRAM model; K-chordal graph; motion
planning; parallel implementation; path planning;
polygons; query version; rectilinear minimum bend path;
rectilinear polygon; robotics; sequential preprocessing
algorithm; shortest distance queries; visibility
graphs",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{deBerg:1995:RGD,
author = "Mark de Berg and Leonidas Guibas and Dan Halperin and
Mark Overmars and Otfried Schwarzkopf and Micha Sharir
and Monique Teillaud",
title = "Reaching a goal with directional uncertainty",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "2",
pages = "301--317",
day = "03",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=2&aid=1871",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1230 (Artificial
intelligence); C3120C (Spatial variables control)C4240C
(Computational complexity); C3355 (Control applications
in manufacturing processes); C3390 (Robotics); C4260
(Computational geometry)",
corpsource = "Vakgroep Inf., Utrecht Univ., Netherlands",
keywords = "computational complexity; computational geometry;
directional uncertainty; imperfect control; line
segments; lower bounds; maximum complexity; path
planning; planar motion planning for robots; polygonal
obstacles; position control; robots",
pubcountry = "Netherlands",
treatment = "A Application; P Practical",
}
@Article{Seetharaman:1995:SDS,
author = "Guna Seetharaman",
title = "A simplified design strategy for mapping image
processing algorithms on a {SIMD} torus",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "2",
pages = "319--331",
day = "03",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=2&aid=1830",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C4230M (Multiprocessor
interconnection); C4240P (Parallel programming and
algorithm theory); C5260B (Computer vision and image
processing techniques); C5440 (Multiprocessing
systems)",
corpsource = "Comput. Vision and Pattern Recognition Lab., Univ. of
Southwestern Louisiana, Lafayette, LA, USA",
keywords = "3-D perception; computer vision; computer vision
paradigm; concurrent communication; dedicated
communication registers; design strategy; dynamic
behavior; histogram; Hough transform; mapping image
processing algorithms; matrix transpose algorithm;
median filters; multiprocessor interconnection
networks; multiview image-sequence analysis; parallel
algorithms; programming; SIMD algorithm; SIMD meshes;
SIMD torus; unstructured dynamic scenes",
pubcountry = "Netherlands",
treatment = "A Application; P Practical",
}
@Article{Bettayeb:1995:AH,
author = "Sa{\"\i}d Bettayeb",
title = "On the $k$-ary hypercube",
journal = j-THEOR-COMP-SCI,
volume = "140",
number = "2",
pages = "333--339",
day = "03",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:57 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=140&issue=2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=140&issue=2&aid=1831",
acknowledgement = ack-nhfb,
classification = "C4230M (Multiprocessor interconnection); C5220P
(Parallel architecture)",
corpsource = "Dept. of Comput. Sci., Louisiana State Univ., Baton
Rouge, LA, USA",
keywords = "equivalent binary hypercube; equivalent mesh of
processors; hamiltonicity; hypercube networks; $k$-ary
hypercube; mesh network",
pubcountry = "Netherlands",
treatment = "P Practical",
}
@Article{Gruau:1995:FSN,
author = "Fr{\'e}d{\'e}ric Gruau and Jean-Yves Ratajszczak and
Gilles Wiber",
title = "Fundamental study: a neural compiler",
journal = j-THEOR-COMP-SCI,
volume = "141",
number = "1--2",
pages = "1--52",
day = "17",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=141&issue=1-2&aid=1834",
acknowledgement = ack-nhfb,
classification = "C5290 (Neural computing techniques); C6150C
(Compilers, interpreters and other processors)",
corpsource = "Lab. de l'Inf., du Parallelisme, Ecole Normale
Superieure de Lyon, France",
keywords = "cellular code; compilation method; data flow graphs;
data flow machines; dataflow graph; graph grammars;
graph rewriting; intermediate code generation; neural
compilation; neural compiler; neural nets; neural
network; Pascal; PASCAL program; program compilers",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
xxtitle = "A neural compiler",
}
@Article{Johansen:1995:LSM,
author = "Peter Johansen",
title = "On-line string matching with feedback",
journal = j-THEOR-COMP-SCI,
volume = "141",
number = "1--2",
pages = "53--67",
day = "17",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=141&issue=1-2&aid=1852",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory); C6130
(Data handling techniques)",
corpsource = "Dept. of Comput. Sci., Copenhagen Univ., Denmark",
keywords = "feedback; one-character buffer; online operation;
online string matching; pattern matching; stable
behaviour; string matching; string pattern matcher;
unstable behaviour",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Muller:1995:SAT,
author = "David E. Muller and Paul E. Schupp",
title = "Simulating alternating tree automata by
nondeterministic automata: {New} results and new proofs
of the theorems of {Rabin}, {McNaughton} and {Safra}",
journal = j-THEOR-COMP-SCI,
volume = "141",
number = "1--2",
pages = "69--107",
day = "17",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=141&issue=1-2&aid=1848",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4220 (Automata
theory); C4240C (Computational complexity)",
corpsource = "Dept. of Math., Illinois Univ., Urbana, IL, USA",
keywords = "alternating tree automata; automata theory; complexity
results; computational complexity; nondeterministic
automata; simulation; theorem proving; trees
(mathematics); uniformizing strategies",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Downey:1995:FPT,
author = "Rod G. Downey and Michael R. Fellows",
title = "Fixed-parameter tractability and completeness {II}:
{On} completeness for {$W[1]$}",
journal = j-THEOR-COMP-SCI,
volume = "141",
number = "1--2",
pages = "109--131",
day = "17",
month = apr,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975",
bibdate = "Mon Jul 19 22:18:59 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=141&issue=1-2",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=141&issue=1-2&aid=1738",
acknowledgement = ack-nhfb,
classification = "C4240C (Computational complexity)",
corpsource = "Dept. of Math., Victoria Univ., Wellington, New
Zealand",
keywords = "completeness; computational complexity;
fixed-parameter problems; fixed-parameter tractability;
parameterized problems; polynomial-time,;
tractability",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
@Article{Yao:1995:ADT,
author = "Andrew Chi-Chih Yao",
title = "Algebraic decision trees and {Euler} characteristics",
journal = j-THEOR-COMP-SCI,
volume =