Bard Bloom, Robert Paige  Home/Search
Context Related
| nyu.edu/cs/faculty/paige/p...readysc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nyu.edu/cs/faculty/pai...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A transformational methodology is described for simultaneously designing algorithms and developing programs. The methodology makes use of three transformational tools - dominated convergence, finite differencing, and real-time simulation of a set machine on a RAM. We illustrate the methodology to design a new O(mn + n 2 )-time algorithm for deciding when n-state, m-transition processes are ready similar, which is a substantial improvement on the \Theta(mn 6 ) algorithm presented in... (Update)
Context of citations to this paper: More
...utility, not much attention has been paid to algorithms for computing the simulation ordering for nite state systems. Bloom and Paige [BP95] present a global routine that runs in time O(m 1 n 2 m 2 n 1 ) where m i and n i represent the number of states and transitions in the...
...B. V. and O( E ) steps, respectively. A simulation procedure having a time complexity of O( N E ) was independently defined in [2] and in [12] The space required by each of the above mentioned routines is limited from below by . Recently [6] 3] and [10] improved the...
Cited by: More
Covering Indexes for XML Queries: Bisimulation - Simulation =.. - Ramanan (2003) (Correct)
Equivalence-Based Reductions and checking for preorders - Bustan (2002) (Correct)
Simulation as Coarsest Partition Problem - Gentilini, Piazza, Policriti (2002) (Correct)
Active bibliography (related documents): More All
0.9: Viewing A Program Transformation System At Work - Paige (1994) (Correct)
0.7: Atlantique Research Overview - Paige (Correct)
0.5: Ready Simulation, Bisimulation, and the Semantics of CCS-Like.. - Bloom (1993) (Correct)
Similar documents based on text: More All
0.2: [30] R. Paige. Applications of finite differencing to.. - Advances In Database (Correct)
0.1: The Logic and Expressibility of Simply-typed Call-by-value and.. - Riecke (1991) (Correct)
0.1: Is There a Skills Crisis? - Trends in Job Skill Requirements.. - Handel (2000) (Correct)
Related documents from co-citation: More All
10: Computing simulations on finite and infinite graphs - Henzinger, Henzinger et al. - 1995
9: Three partition refinement algorithms (context) - Paige, Tarjan - 1987
9: The Concurrency Workbench: A semantics-based tool for the verification of finite.. - Cleaveland, Parrow et al. - 1993
BibTeX entry: (Update)
B. Bloom and R. Paige, Transformational design and implementation of a new efficient solution to the ready simulation problem, Draft (1994). http://citeseer.ist.psu.edu/bloom95transformational.html More
@article{ bloom95transformational,
author = "Bard Bloom and Robert Paige",
title = "Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem",
journal = "Science of Computer Programming",
volume = "24",
number = "3",
pages = "189-220",
year = "1995",
url = "citeseer.ist.psu.edu/bloom95transformational.html" }
Citations (may not include all citations):2732 Communicating sequential processes (context) - Hoare - 1978
1450 Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
652 A Discipline of Programming (context) - Dijkstra - 1976
484 A Calculus of Communicating Systems (context) - Milner - 1980
452 Data Structures and Algorithms (context) - Aho, Hopcroft et al. - 1983
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
275 The Science of Programming (context) - Gries - 1981
271 Yacc - yet another compiler compiler - Johnson - 1975
258 A lattice-theoretical fixpoint theorem and its application (context) - Tarski - 1955
247 Bisimulation through probabilistic testing (context) - Larsen, Skou - 1988
218 Process algebra for synchronous communication (context) - Bergstra, Klop - 1984
201 Three partition refinement algorithms (context) - Paige, Tarjan - 1987
182 Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1989
168 Testing equivalences for processes (context) - de Nicola, Hennessy - 1984
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1990
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1988
101 Programming with Sets: An Introduction to SETL (context) - Schwartz, Dewar et al. - 1986
73 The Concurrency Workbench (context) - Cleaveland, Parrow et al. - 1989
73 Prentice Hall International Series in Computer Science (context) - Milner, Concurrency - 1989
48 Higher-level synchronising devices in meije-SCCS (context) - de Simone - 1985
48 Computational problems related to the design of normal form .. (context) - Beeri, Bernstein - 1979
42 The lazy lambda calculus: an investigation into the foundati.. (context) - Ong - 1988
38 An implementation of an efficient algorithm for bisimulation.. - Fernandez - 1989
36 Finite differencing of computable expressions (context) - Paige, Koenig - 1982
33 Real-time simulation of a set machine on a ram - Paige - 1989
28 ebre de processus et synchronisation (context) - Austry, Boudol - 1984
23 Constructive versions of tarski's fixed point theorems - Cousot, Cousot - 1979
22 Mechanical translation of set theoretic problem specificatio.. (context) - Paige, Henglein - 1987
22 High level iterators and a method for automatically designin.. (context) - Earley - 1976
21 A linear time solution to the single function coarsest parti.. (context) - Paige, Tarjan et al. - 1985
17 Programming Languages and Their Compilers (context) - Cocke, Schwartz - 1969
15 Induction variables in very high level languages (context) - Fong, Ullman - 1976
15 More efficient bottom-up multi-pattern matching in trees - Cai, Paige et al. - 1992
13 Computing behavioural relations (context) - Cleaveland, Steffen - 1991
12 From regular expressions to dfa's using compressed nfa's - Chang, Paige - 1992
11 The SETL2 programming language - Snyder - 1990
8 Efficient translation of external input in a dynamically typ.. - Paige - 1994
7 Languages polynomial in the input plus output (context) - Cai, Paige - 1992
7 Binding performance at language design time (context) - Cai, Paige - 1987
5 Massachusetts Institute of Technology (context) - Bloom, Bisimulation et al. - 1989
2 Theoretical Computer Sci (context) - Milner, synchrony - 1983
1 Theoretical Computer Sci (context) - Phillips - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs.nyu.edu/cs/faculty/paige/research.html): More
Viewing A Program Transformation System At Work - Paige (1994) (Correct)
The Formal Reconstruction and Speedup Of The Linear Time.. - Goyal, Paige (1997) (Correct)
From Regular Expressions to DFA's Using Compressed NFA's - Chang, Paige (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC