Advances in computing science - ASIAN '99. 5th Asian computing science conference, Phuket, Thailand, December 8--10, 1998. Proceedings
The articles of mathematical interest will be reviewed individually. The preceding conference (4th, 1998) has been indicated (see Zbl 0903.00076). Indexed articles: \textit{Amadio, Roberto M.; Prasad, Sanjiva}, The game of the name in cryptographic tables, 15-26 [Zbl 0989.94506] \textit{Calamoneri, T.; Finocchi, I.; Manoussakis, Y.; Petreschi, R.}, A parallel approximation algorithm for the max cut problem on cubic graphs, 27-36 [Zbl 0956.05094] \textit{Chantrapornchai, Chantana; Tongsima, Sissades; Sha, Edwin}, Rapid prototyping techniques for fuzzy controllers, 37-49 [Zbl 0952.93506] \textit{Llana Díaz, Luis Fernando; de Frutos Escrig, David}, Relating may and must testing semantics for discrete timed process algebras, 74-86 [Zbl 0959.68089] \textit{Galmiche, Didier; Larchey-Wendling, Dominique}, Structural sharing and efficient proof-search in propositional intuitionistic logic, 101-112 [Zbl 0955.03017] \textit{den Hartog, J. I.}, Verifying probabilistic programs using a Hoare like logic, 113-125 [Zbl 0959.68076] \textit{Henriksen, Jesper Gulmann}, An expressive extension of TLC (extended abstract), 126-138 [Zbl 0954.03500] \textit{Dang Van, Hung; Guelev, Dimitar P.}, Completeness and decidability of a fragment of duration calculus with iteration, 139-150 [Zbl 0954.03033] \textit{Indrika, Mia}, Logical relations in circuit verification, 151-162 [Zbl 0989.94525] \textit{Iwanuma, Koji; Kishino, Kenichi}, Lemma generalization and non-unit lemma matching for model elimination, 163-176 [Zbl 0954.03011] \textit{Kamareddine, Fairouz; Monin, François}, On automating inductive and non-inductive termination methods, 177-189 [Zbl 0959.68077] \textit{Klaudel, Hanna; Pommereau, Franck}, Asynchronous links in the PBC and M-nets, 190-200 [Zbl 0959.68090] \textit{Knoop, Jens}, Demand-driven model checking for context-free processes, 201-213 [Zbl 0961.68084] \textit{Loke, Seng Wai; Schmidt, Heinz; Zaslavsky, Arkady}, Programming the mobility behaviour of agents by composing itineraries, 214-226 [Zbl 0959.68028] \textit{Mukund, Madhavan; Kumar, K. Narayan; Smolka, Scott A.}, Faster model checking for open systems, 227-238 [Zbl 0959.68078] \textit{Nantajeewarawat, Ekawit; Wuwongse, Vilas}, An argumentation approach to semantics of declarative programs with defeasible inheritance, 239-250 [Zbl 0951.68529] \textit{Niehren, Joachim; Priesnitz, Tim}, Entailment of non-structural subtype constraints, 251-265 [Zbl 0959.68029] \textit{Ogata, Ichiro}, A CPS-transform of constructive classical logic, 266-280 [Zbl 0954.03063] \textit{Ogata, Kazuhiro; Futatsugi, Kokichi}, Formal verification of the MCS list-based queueing lock, 281-293 [Zbl 0959.68505] \textit{Roychoudhury, Abhik; Kumar, K. Narayan; Ramakrishnan, C. R.; Ramakrishnan, I. V.}, Beyond Tamaki-Sato style unfold/fold transformations for normal logic programs, 322-333 [Zbl 0991.68509] \textit{Seth, Anil}, On \(L^k (Q)\) types and boundedness of \(IFP (Q)\) on finite structures, 334-346 [Zbl 0954.03035] \textit{Shen, Hong; Li, Keqin; Zheng, Si-Qing}, Separators are as simple as cutsets (short version), 347-358 [Zbl 0956.05096]
scientific article; zbMATH DE number 1400427