Mathematical Foundations of Computer Science 1996 Book

	Word level model checking	1
	Code problems on traces	2
	Models of DNA computation	18
	Theory and practice of action semantics	37
	Linear time temporal logics over Mazurkiewicz traces	62
	Partial order reduction: model-checking using representatives	93
	Nonmonotonic rule systems: forward chaining, constraints, and complexity	113
	Mind the gap! Abstract versus concrete models of specifications	114
	A sequent calculus for subtyping polymorphic types	135
	Kolmogorov complexity: recent research in Moscow	156
	A modal logic for data analysis	167
	From specifications to programs: a fork-algebraic approach to bridge the gap	180
	Logic of predicates with explicit substitutions	192
	On the query complexity of sets	206
	A lambda calculus of incomplete objects	218
	Bisimilarity problems requiring exponential time	230
	Linear dynamic Kahn networks are deterministic	242
	Shortest path problems with time constraints	255
	Parallel alternating-direction access machine	267
	Specification and verification of timed lazy systems	279
	A class of information logics with a decidable validity problem	291
	On the power of nonconservative PRAM	303
	Self-similarity viewed as a local property via tile sets	312
	Simulation of specification statements in Hoare logic	324
	Equational properties of iteration in algebraically complete categories	336
	On unconditional transfer	348
	(poly(log log n), poly(log log n))-restricted verifiers are unlikely to exist for languages in NP	360
	Minimizing congestion of layouts for ATM networks with faulty links	372
	Polynomial automaticity, context-free languages, and fixed points of morphisms (extended abstract)	382
	Casual testing	394
	Construction of list homomorphisms by tupling and fusion	407
	Probabilistic metric semantics for a simple language with recursion	419
	Dynamics graphs	431
	Equations on trees	443
	On the equivalence problem for E-pattern languages (extended abstract)	457
	Specifying and verifying parametric processes	469
	On saturation with flexible function symbols	482
	Approximating good simultaneous diophantine approximations is almost NP-hard	494
	On the conjugation of standard morphisms	506
	A semantic matching algorithm: analysis and implementation	517
	Routing on triangles, tori and honeycombs	529
	A uniform analysis of trie structures that store prefixing-keys with application to doubly-chained prefixing-tries	542
	On fairness in terminating and reactive programs	554
	Polynomial time samplable distributions	556
	From static to dynamic abstract data-types	579
	Author Index	591