Sequential Pascal(ID:3794/seq010)

Simplified Pascal with monitors 


Santosh Shrivastava,  University of Newcastle, 1978

A simplified version of Hartmann's Concurrent Pascal system (less memory required, three passes instead of seven)




People:
Related languages
Concurrent Pascal => Sequential Pascal   Extension of

References:
  • Shrivastava, S.K. "Sequential Pascal with Recovery Blocks" CS-TR: 123, Department of Computing Science, University of Newcastle, 1978 view details Abstract: The programming language Sequential Pascal has been extended to include recovery blocks. This paper describes the modifications made to the kernal and interpreter of Brinch Hansen's Pascal system to support recovery blocks and the associated recovery caches needed for state restoration. External link: Online copy
  • Shrivastava, Santosh K. "Sequential Pascal with Recovery Blocks" view details
          in Software — Practice and Experience 8(02) 1978 view details
  • Marcotty, M review of Shrivastava (1978) view details Extract: Review
    Some of the details of extending Sequential PASCAL [1] to include recovery blocks [2] are described. Programs written in the extended Sequential PASCAL are run under an operating system, SOLO [3], written in Concurrent PASCAL, on a PDP 11/45 using an interpreter. The extensions require changes to the compiler, interpreter, and kernel of the operating system.
    A recovery block provides for a primary segment of code and a number of alternative segments. If, following the execution of the primary, an "acceptance test" fails, then the state of the computation is restored to that at entry to the primary, and an alternative block is entered. This is repeated until either the acceptance test succeeds or it is determined that the entire recovery block has failed and recovery actions must be undertaken by an enclosing recovery block, if any. In the implementation described, a "recovery cache" is used for recording and restoring the state of the computation.
    Timing measurements indicate that the overhead for maintaining recovery data is between 1 and 7 percent and that state restoration requires from 10 to 30 percent of the execution of the primary segment.
    This paper demonstrates that recovery blocks can be implemented in software without a ruinous price in overhead. The fact that the modifications to the system could be performed with relative ease speaks very well for the quality of the engineering of the PASCAL system.

    M. Marcotty, Troy, Mich.

    REFERENCES
    [1] BRINCH HANSEN, P. The architecture of concurrent programs, Prentice-Hall Inc., Englewood Cliffs, N.J., 1977; see CR 19, 9 (Sept. 1978), Rev. 33,358.
    [2] RANDELL, B. "System structure for software fault tolerance," IEEE Trans. Softw. Eng. 1, 2 (1975), 220-232; see CR 17, 2 (Feb. 1976), Rev. 29,546.
    [3] BRINCH HANSEN, P. "The SOLO operating system: a Concurrent Pascal program," Softw. Pract. Exper. 6 (1976), 141-149; see CR 18, 5 (May 1977), Rev. 31,363.
          in ACM Computing Reviews 20(05) May 1979 view details
  • CLote, P and J Peng "Translator from a fragment of parallel Pascal into sequential Pascal", Technical Report BCCS-91-19, 26 November 1991 view details Abstract: Unpublished technical report for translation program (using yacc, lex) to translate programs written in a version of parallel Pascal into sequential programs, suitable for illustrating parallel algorithms in an environment without access to a SIMD-type machine. bib:
          



      



       publications  
       bachelor's theses  
       research projects  
            
      

    research . publications  
      
    Bibtex file for the Computer Science Department at Boston College
    @COMMENT{{This file has been generated by bib2bib 1.43}}

    @COMMENT{{Command line: /home/users1/csweb/publications_generation_dir/bibtex2html/bib2bib -oc reportkeys -ob publications.bib -c BostonCollegeComputerScience="yes" bibtex/macros.bib bibtex/bibliography.bib bibtex/conferences.bib}}

    @PREAMBLE{{
      \newcommand{\bibnoop}[1]{}
      \newcommand{\bibvonmagic}[2]{#2}
      \newcommand{\bibsingleletter}[1]{#1}
    }}

    @BOOK{Clote:CMB2000,
      AUTHOR = {Peter Clote and R. Backofen},
      TITLE = {Computational Molecular Biology: An Introduction},
      YEAR = {2000},
      MONTH = {Aug},
      PUBLISHER = {John Wiley & Sons, Ltd},
      ISBN = {0-471-87251-2},
      ISBN = {0-471-87252-0},
      DOCUMENTURL = {http://www.cs.bc.edu/~clote/computationalBiologyTableOfContents.html},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @BOOK{Clote:BFMC2000,
      AUTHOR = {Peter Clote and E. Kranakis},
      TITLE = {Boolean Functions and Models of Computation},
      YEAR = {2000},
      MONTH = {Sep},
      PUBLISHER = {Springer-Verlag},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @BOOK{Clote:CSL2000,
      AUTHOR = {Peter Clote},
      TITLE = {Computer Science Logic},
      YEAR = {2000},
      MONTH = {Aug},
      PUBLISHER = {Springer-Verlag},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @BOOK{Clote:TR2000,
      AUTHOR = {R. Fraissé},
      TITLE = {Theory of Relations},
      YEAR = {1986},
      PUBLISHER = {North Holland},
      NOTE = {Research monograph translation by Peter Clote: French to English},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @BOOK{Clote:APTCC1993,
      AUTHOR = {Peter Clote and J. Krajicek},
      TITLE = {Arithmetic, Proof Theory and Computational Complexity},
      YEAR = {1993},
      PUBLISHER = {Oxford University Press},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @BOOK{Clote:FMII1995,
      AUTHOR = {Peter Clote and J. Remmel},
      TITLE = {Feasible Mathematics II},
      YEAR = {1995},
      PUBLISHER = {Birkhäuser Inc},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:RMTAGT1998,
      AUTHOR = {Peter Clote and J. Hirst},
      TITLE = {Reverse mathematics of some topics from algorithmic graph theory},
      JOURNAL = {Fundamenta Mathematica},
      VOLUME = {157},
      NUMBER = {1},
      PAGES = {1-13},
      YEAR = {1998},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:NDSRM1997,
      AUTHOR = {Peter Clote},
      TITLE = {Nondeterministic stack register machines},
      JOURNAL = {Theoretical Computer Science},
      VOLUME = {178},
      PAGES = {37-76},
      YEAR = {1997},
      MONTH = {Jun},
      PS = {http://www.cs.bc.edu/~clote/pub/stackRegister.ps},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:NMC1996,
      AUTHOR = {Peter Clote},
      TITLE = {Note on monotonic complexity of 2-REF},
      JOURNAL = {Information Processing Letters},
      VOLUME = {57},
      PAGES = {117-123},
      YEAR = {1996},
      PS = {http://www.cs.bc.edu/~clote/pub/monotonic.ps},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:CPCTL1995,
      AUTHOR = {Peter Clote and S. Buss},
      TITLE = {Cutting planes, connectivity and threshold logic},
      JOURNAL = {Archive for Mathematical Logic},
      VOLUME = {35},
      PAGES = {33-62},
      YEAR = {1995},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:CPFP1995,
      AUTHOR = {Peter Clote},
      TITLE = {Cutting plane and Frege proofs},
      JOURNAL = {Information and Computation},
      VOLUME = {121},
      NUMBER = {1},
      PAGES = {103-122},
      YEAR = {1995},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:ACSAC1992,
      AUTHOR = {Peter Clote},
      TITLE = {ALOGTIME and a conjecture of S.A. Cook},
      JOURNAL = {Annals of Mathematics and Artificial Intelligence},
      VOLUME = {6},
      PAGES = {57-106},
      YEAR = {1992},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:BANCALN1992,
      AUTHOR = {Peter Clote and G. Takeuti},
      TITLE = {Bounded arithmetic for NC, ALOGTIME, L and NL},
      JOURNAL = {Annals of Pure and Applied Logic},
      VOLUME = {56},
      PAGES = {73-117},
      YEAR = {1992},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:TSHBPP1992,
      AUTHOR = {Peter Clote},
      TITLE = {A time-space hierarchy between P and PSPACE},
      JOURNAL = {Mathematical Systems Theory},
      VOLUME = {25},
      PAGES = {77-92},
      YEAR = {1992},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:SFCSA1991,
      AUTHOR = {Peter Clote and P. Hájek and J. Paris},
      TITLE = {On some formalized consistency statements in arithmetic},
      JOURNAL = {Archive for Mathematical Logic },
      VOLUME = {30},
      NUMBER = {4},
      PAGES = {201-221},
      YEAR = {1991},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:BFIGPC1991,
      AUTHOR = {Peter Clote and E. Kranakis},
      TITLE = {Boolean functions, invariance groups, and parallel complexity},
      JOURNAL = {SIAM J. Comput},
      VOLUME = {20},
      NUMBER = {3},
      PAGES = {553-590},
      YEAR = {1991},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:MSLO1989,
      AUTHOR = {Peter Clote},
      TITLE = {The metamathematics of scattered linear orderings},
      JOURNAL = {Archive for Mathematical Logic},
      VOLUME = {29},
      PAGES = {9-20},
      YEAR = {1989},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:NMST1986,
      AUTHOR = {Peter Clote},
      TITLE = {A note on the MacDowell-Specker Theorem},
      JOURNAL = {Fundamenta Mathematicae},
      VOLUME = {127},
      PAGES = {163-170},
      YEAR = {1986},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:MPC1986,
      AUTHOR = {Peter Clote and D. Cenzer and R. Smith and R. Soare and S. Wainer},
      TITLE = {Members of PI01 classes},
      JOURNAL = {Annals of Pure and Applied Logic},
      VOLUME = {31},
      PAGES = {145-161},
      YEAR = {1986},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:FCPPN1986,
      AUTHOR = {Peter Clote},
      TITLE = {On the finite containment problem for Petri nets},
      JOURNAL = {Theoretical Computer Science},
      VOLUME = {43},
      PAGES = {99-105},
      YEAR = {1986},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:GLLCG1986,
      AUTHOR = {Peter Clote},
      TITLE = {A generalization of the limit lemma and clopen games},
      JOURNAL = {Journal of Symbolic Logic},
      VOLUME = {51},
      PAGES = {273-291},
      YEAR = {1986},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:SBOCM1985,
      AUTHOR = {Peter Clote},
      TITLE = {Sharp bounds on ordinal comparison maps},
      JOURNAL = {Archiv für Mathematische Logik und Grundlagenforschung},
      VOLUME = {25},
      PAGES = {99-107},
      YEAR = {1985},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:ORTUIB1985,
      AUTHOR = {Peter Clote},
      TITLE = {On recursive trees with a unique infinite branch},
      JOURNAL = {Proceedings of the American Mathematical Society},
      VOLUME = {93},
      PAGES = {335-342},
      YEAR = {1985},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:RTACRT1984,
      AUTHOR = {Peter Clote},
      TITLE = {A recursion theoretic analysis of the clopen Ramsey theorem},
      JOURNAL = {Journal of Symbolic Logic},
      VOLUME = {49},
      PAGES = {376-400},
      YEAR = {1984},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @ARTICLE{Clote:TFCTE1CPA1983,
      AUTHOR = {Peter Clote and K. McAloon},
      TITLE = {Two further combinatorial theorems equivalent to the 1-consistency of Peano arithmetic},
      JOURNAL = {, Journal of Symbolic Logic},
      VOLUME = {48},
      PAGES = {1090-1104},
      YEAR = {1983},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @UNPUBLISHED{Clote:NGMRA,
      AUTHOR = {Peter Clote and S. Will},
      TITLE = {A new genomic motif recognition algorithm},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @UNPUBLISHED{Clote:VPHIAPRAM1991,
      AUTHOR = {Peter Clote and A. Lai},
      TITLE = {Vax Pascal and Hypercard implementation of an assembler for a parallel random access machine},
      TYPE = {Simulation programs for parallel SIMD-type machines},
      YEAR = {1991},
      MONTH = {Oct},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }

    @UNPUBLISHED{Clote:TFFPPSP1991,
      AUTHOR = {Peter Clote and J. Peng},
      TITLE = {Translator from a fragment of parallel Pascal into sequential Pascal},
      TYPE = {translation program (using yacc, lex) to translate programs written in a version of parallel Pascal into sequential programs, suitable for illustrating parallel algorithms in an environment without access to a SIMD-type machine.},
      YEAR = {1991},
      MONTH = {Nov},
      BOSTONCOLLEGECOMPUTERSCIENCE = {yes}
    }




          in ACM Computing Reviews 20(05) May 1979 view details