Journal of the ACM Bibliography

Selected papers that cite this one

• Samson Abramsky and C.-H. Luke Ong. Full abstraction in the lazy lambda calculus. Information and Computation, 105(2):159-267, August 1993.

• Samson Abramsky and Steven Vickers. Quantales, observational logic and process semantics. Mathematical Structures in Computer Science, 3(2):161-227, June 1993.

• Luca Aceto. On ``Axiomatising finite concurrent processes''. SIAM Journal on Computing, 23(4):852-863, August 1994.

• Luca Aceto, Rob van Glabbeek, Wan Fokkink, and Anna Ingólfsdóttir. Axiomatizing prefix iteration with silent steps. Information and Computation, 127(1):26-40, 25 May 1996.

• L. Aceto and M. Hennessy. Termination, deadlock, and divergence. Journal of the ACM, 39(1):147-187, January 1992.

• L. Aceto and M. Hennessy. Towards action-refinement in process algebras. Information and Computation, 103(2):204-269, April 1993.

• Luca Aceto and Anna Ingólfsdóttir. CPO models for compact GSOS languages. Information and Computation, 129(2):107-141, 15 September 1996.

• Luca Aceto and Anna Ingólfsdóttir. A characterization of finitary bisimulation. Information Processing Letters, 64(3):127-134, 14 November 1997.

• André Arnold and Ilaria Castellani. An algebraic characterization of observational equivalence. Theoretical Computer Science, 156(1-2):289-299, 25 March 1996. Note.

• Johan van Benthem, Jan van Eijck, and Vera Stebletsova. Modal logic, transition systems and processes. Journal of Logic and Computation, 4(5):811-855, October 1994.

• Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232-268, January 1995.

• Ching-Tsun Chou. Simple proof techniques for property preservation via simulation. Information Processing Letters, 60(3):129-134, 11 November 1996.

• Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. Information and Computation, 87(1/2):58-77, July/August 1990.

• Mads Dam. Process-algebraic interpretations of positive linear and relevant logics. Journal of Logic and Computation, 4(6):939-973, December 1994.

• Pierpaolo Degano and Roberto Gorrieri. A causal operational semantics of action refinement. Information and Computation, 122(1):97-119, October 1995.

• Hakan Erdogmus, Robert Johnson, and Michael Ferguson. On the operational semantics of nondeterminism and divergence. Theoretical Computer Science, 159(2):271-317, 3 June 1996.

• Tim Fernando. Bisimulations and predicate logic. The Journal of Symbolic Logic, 59(3):924-944, September 1994.

• Gianluigi Ferrari, Ugo Montanari, and Miranda Mowbray. Structured transition systems with parametric observations: observational congruences and minimal realizations. Mathematical Structures in Computer Science, 7(3):241-282, June 1997.

• Gian-Luigi Ferrari, Ugo Montanari, and Paola Quaglia. A pi-calculus with explicit substitutions. Theoretical Computer Science, 168(1):53-103, 10 November 1996.

• Rob Gerth, Ruurd Kuiper, Doron Peled, and Wojciech Penczek. A partial order approach to branching time logic model checking. Accepted for publication in Information and Computation. Final manuscript received for publication September 23, 1998.

• Rob J. van Glabbeek and W. Peter Weijland. Branching time and abstraction in bisimulation semantics. Journal of the ACM, 43(3):555-600, May 1996.

• Ursula Goltz and Heike Wehrheim. Modelling causality via action dependencies in branching time semantics. Information Processing Letters, 59(4):179-184, 26 August 1996.

• Roberto Gorrieri and Cosimo Laneve. Split and ST bisimulation semantics. Information and Computation, 118(2):272-288, 1 May 1995.

• S. Graf and J. Sifakis. A logic for the description of non-deterministic programs and their properties. Information and Control, 68(1-3):254-270, January/February/March 1986.

• Jan Friso Groote and Frits Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202-260, October 1992.

• Chrysafis Hartonas. Semantics of finite delay. Theoretical Computer Science, 176(1-2):205-234, 20 April 1997.

• K. Havelund and K. G. Larsen. The fork calculus. Nordic Journal of Computing, 1(3):346-363, Fall 1994.

• Matthew Hennessy. A fully abstract denotational model for higher-order processes. Information and Computation, 112(1):55-95, July 1994.

• Matthew Hennessy and Colin Stirling. The power of the future perfect in program logics. Information and Control, 67(1-3):23-52, October/November/December 1985.

• R. P. Kurshan. The complexity of verification. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 365-371, Montréal, Québec, Canada, 23-25 May 1994.

• Natasha Kurtonina and Maarten de Rijke. Simulating without negation. Journal of Logic and Computation, 7(4):501-522, August 1997.

• Kim G. Larsen and Liu Xinxin. Compositionality through an operational semantics of contexts. Journal of Logic and Computation, 1(6):761-795, December 1991.

• Kamal Lodaya, Rohit Parikh, R. Ramanujan, and P. S. Thiagarajan. A logical study of distributed transition systems. Information and Computation, 119(1):91-118, 15 May 1995.

• T. F. Melham. A mechanized theory of the Pi-calculus in HOL. Nordic Journal of Computing, 1(1):50-76, Spring 1994.

• Robin Milner. Functions as process. Mathematical Structures in Computer Science, 2(2):119-141, June 1992.

• Matthew J. Morley. Safety-level communication in railway interlockings. Science of Computer Programming, 29(1-2):147-170, July 1997.

• Rocco De Nicola and Frits Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458-487, March 1995.

• M. Nielsen and C. Clausen. Games and logics for a noninterleaving bisimulation. Nordic Journal of Computing, 2(2):221-249, Summer 1995.

• Davide Sangiorgi. On the bisimulation proof method. Mathematical Structures in Computer Science, 8(5):447-479, October 1998.

• R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, Summer 1995.

• Alex K. Simpson. Compositionality via cut-elimination: Hennessy-Milner logic for an arbitrary GSOS. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 420-430, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.

• Bernhard Steffen and Anna Ingólfsdóttir. Characteristic formulae for processes with divergence. Information and Computation, 110(1):149-163, April 1994.

• Bent Thomsen. A theory of higher order communicating systems. Information and Computation, 116(1):38-57, January 1995.

• C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2(2):274-302, Summer 1995.

• Shipei Zhang, Oleg Sokolsky, and Scott A. Smolka. On the parallel complexity of model checking in the modal mu-calculus. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pages 154-163, Paris, France, 4-7 July 1994. IEEE Computer Society Press.

Shortcuts: