Efficient implementation and optimization of run-time checking in PASCAL

1977 ◽  
Author(s):  
Charles N. Fischer ◽  
Richard J. LeBlanc
Keyword(s):  
Efficient Implementation ◽  
Run Time

Efficient implementation and optimization of run-time checking in PASCAL

1977 ◽  
Vol 2 (2) ◽  
pp. 19-24
Author(s):  
Charles N. Fischer ◽  
Richard J. LeBlanc
Keyword(s):  
Efficient Implementation ◽  
Run Time

scholarly journals Provably correct, asymptotically efficient, higher-order reverse-mode automatic differentiation

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-30
Author(s):  
Faustyna Krawiec ◽  
Simon Peyton Jones ◽  
Neel Krishnaswami ◽  
Tom Ellis ◽  
Richard A. Eisenberg ◽  
...  
Keyword(s):  
Automatic Differentiation ◽  
Higher Order ◽  
Efficient Implementation ◽  
Formal Description ◽  
Memory Consumption ◽  
Reverse Mode ◽  
Original Program ◽  
Run Time ◽  
Asymptotically Efficient ◽  
Higher Order Functions

In this paper, we give a simple and efficient implementation of reverse-mode automatic differentiation, which both extends easily to higher-order functions, and has run time and memory consumption linear in the run time of the original program. In addition to a formal description of the translation, we also describe an implementation of this algorithm, and prove its correctness by means of a logical relations argument.

A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA

2009 ◽  
Vol 20 (04) ◽  
pp. 717-733 ◽  
Author(s):  
TETSUYA MATSUMOTO ◽  
KAZUHITO HAGIO ◽  
MASAYUKI TAKEDA
Keyword(s):  
Pattern Matching ◽  
Compression Ratio ◽  
High Speed ◽  
Efficient Implementation ◽  
Huffman Coding ◽  
Prefix Code ◽  
High Compression Ratio ◽  
Straightforward Application ◽  
Pattern Length ◽  
Run Time

We present a run-time efficient implementation of compressed pattern matching automata (CPMA) of Kida et al. (2003), where a text is given as a truncation-free collage system [Formula: see text] such that variable sequence [Formula: see text] is encoded by any prefix code. We first build CPMA directly from P and [Formula: see text] in [Formula: see text] time and space, and then convert it into the decoder-embedded CPMA (DECPMA), where |P| is the pattern length and [Formula: see text] is the number of variables defined in [Formula: see text]. The bound [Formula: see text] improves the bound [Formula: see text] achieved by a straightforward application of the method of Kida et al. We experimentally show that a combination of recursive-pairing compression and byte-oriented Huffman coding allows both a high compression ratio and a high speed CPM.

Efficient implementation and optimization of run-time checking in PASCAL

1977 ◽  
Vol 12 (3) ◽  
pp. 19-24 ◽  
Author(s):  
Charles N. Fischer ◽  
Richard J. LeBlanc
Keyword(s):  
Efficient Implementation ◽  
Run Time

Efficient implementation and optimization of run-time checking in PASCAL

1977 ◽  
Vol 11 (2) ◽  
pp. 19-24
Author(s):  
Charles N. Fischer ◽  
Richard J. LeBlanc
Keyword(s):  
Efficient Implementation ◽  
Run Time
Sign in / Sign up

Export Citation Format

Share Document