Revised report on the algorithmic language ALGOL 60

Backus, J. W.; Bauer, Friedrich L.; Green, J.; Katz, Chaim; McCarthy, John; Perlis, Alan J.; Rutishauser, Heinz; Samelson, K.; Vauquois, Bernard; Wegstein, J. H.; Wijngaarden, A. van; Woodger, M.

doi:10.1145/366193.366201

Cited by 583 publications

(30 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The call-by-name evaluation is adopted in Algol 60 [4] but its efficiency is not sufficient for practical usage.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus

Watanabe¹,

Nishizaki²

2017

JSW

View full text Add to dashboard Cite

A remote procedure call (RPC) is a network communication technique between distributed computers. RPC is more approachable than the other network communication techniques since a programmer can use it in a similar manner to a procedure call in a sequential program on a single CPU computer. Cooper and Wadler proposed the RPC calculus and formalized the remote procedure call in the style of the lambda calculus. They used the call-by-value evaluation strategy for the RPC calculus. We may say that the RPC calculus is an extension of the traditional call-by-value lambda calculus by attaching a location. In the previous work, we developed a big-step semantics of the call-by-name RPC calculus and studied the translation of the call-by-name RPC calculus into the call-by name RMI calculus, in order to show the expressive power of the RMI calculus. In this paper, we newly propose a small-step semantics of the call-by-name RPC calculus. We prove the equivalence between the small-step and big-step semantics.

show abstract

“…The call-by-name evaluation is adopted in Algol 60 [4] but its efficiency is not sufficient for practical usage.…”

Section: Resultsmentioning

confidence: 99%

“…Call-by-name evaluation was originally proposed in ALGOL 60 [4]. Call-by-value and call-by-name evaluation strategies were formalized as small-step semantics by Plotkin [8].…”

Section: Related Workmentioning

confidence: 99%

Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus

Watanabe¹,

Nishizaki²

2017

JSW

View full text Add to dashboard Cite

show abstract

“…CALGO mandated the use of Algol 60 [41] as its implementation language until the publication of the ASA standard for Fortran in 1966 [4], when the revised Algorithm Policy [25] allowed both languages. Surprisingly, the first published algorithm in Fortran did not appear until 1968 [58].…”

Section: Implementation Languagesmentioning

confidence: 99%

The collected algorithms of the ACM

Hopkins

2009

WIREs Computational Stats

View full text Add to dashboard Cite

The Collected Algorithms of the ACM (CALGO) is now the longest running journalpublished series of algorithms. After placing CALGO in the context of other journal algorithm series, we discuss the factors that we believe have made CALGO the well respected means of publishing mathematical software that it is today. We report on how moving with the times and technology has ensured the survival of CALGO, and we look briefly at how we may continue this in the near future.

show abstract

“…The SPL syntax is presented in Figure 2 using an extended Backus-Naur Form [12]. We represent terminals as term, tokens as token, alternation with {one | two}, optional elements as [optional], elements which must repeat once or more as (term)+ and elements which may appear never or many times as (term)*.…”

Section: Syntax and Typing Rulesmentioning

confidence: 99%

Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language

Madhavapeddy

2009

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which provides a usable middle ground between ad-hoc coding and formal reasoning. It enables programmers to embed automata in their code which can be statically modelchecked using SPIN and dynamically enforced. The performance overheads are minimal, and the automata also provide higher-level debugging capabilities. We also describe some practical uses of SPL by describing the automata used in an SSH server written entirely in OCaml/SPL.Constructing modern Internet servers is a difficult proposition, since the software must encapsulate a significant amount of state and deal with a variety of incoming packet types, complex configurations and versioning inconsistencies. Network applications are also expected to be liberal in interpreting received data packets and must reliably deal with timing and ordering issues arising from the "best-effort" nature of Internet data traffic.Due to this complexity, mechanical verification techniques are very useful to guarantee safety, security and reliability properties. One mature formal method used to verify properties about systems is model checking. Software modelchecking involves: (i ) creating an abstract model of a complex application; (ii ) validating this model against the application; and (iii ) checking safety properties against the abstract model. To non-experts, steps (i ) and (ii ) are often the most daunting. How does one decide which aspects of the application to include in the abstract model? How does one determine whether the abstraction inadvertently "hides" critical bugs? If a counter-example is found, how does one determine whether this is a genuine bug or just a modeling artifact?In this paper, we present the Statecall Policy Language (SPL) which simplifies the model specification and validation tasks with a view to making model checking more accessible to regular programmers. SPL is a high-level modelling language which enables developers to specify models in terms of allowable program events (e.g. valid sequences of received network packets). We have implemented a compiler that translates SPL into both Promela and a generalpurpose programming language (e.g. OCaml). The generated Promela can be used with SPIN [1] in order to check static properties of the model. The OCaml code provides an executable model in the form of a safety monitor . A developer

show abstract

Revised report on the algorithmic language ALGOL 60

Cited by 583 publications

References 0 publications

Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus

Big-step and Small-Step Semantics of the Call-by-Name RPC Calculus

The collected algorithms of the ACM

Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language

Contact Info

Product

Resources

About