On correct procedure parameter transmission in higher programming languages

Langmaack, Hans

doi:10.1007/bf00264026

Cited by 27 publications

(6 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…q ~false (35) is true. On the other hand, from (28) and (30) x = z /\ x = 0 ~ q is true; so, by (35), x = z /\ x = 0 ~false is true, which gives the desired contradiction.…”

Section: Insufficiency Of the Recursion Rulementioning

confidence: 99%

“…In general, the restriction "sharing-free" is dangerous in light of decidability requirements: if we interpret "sharing-free" as allowing only sharingfree programs in our subclass Y' of «J?P, then Y' is in general undecidable. This follows from a result of Langmaack (35] stating that for «J?P the formal reachability of procedures is undecidable when the ALGOL 60 copy rule is applied. Fortunately, these problems do not arise in Section 6.1 because, by the result of (33], sharing is a decidable property for programs without procedures as paraineters.…”

Section: Decidability Issuesmentioning

confidence: 99%

See 1 more Smart Citation

Ten Years of Hoare's Logic: A Survey—Part I

Apt

1981

ACM Trans. Program. Lang. Syst.

420

218

View full text Add to dashboard Cite

A survey of various results concerning Hoare's approach to proving partial and total correctness of programs is presented. Emphasis is placed on the soundness and completeness issues. Various proof systems for while programs, recursive procedures, local variable declarations, and procedures with parameters, together with the corresponding soundness, completeness, and incompleteness results, are discussed.

show abstract

“…q ~false (35) is true. On the other hand, from (28) and (30) x = z /\ x = 0 ~ q is true; so, by (35), x = z /\ x = 0 ~false is true, which gives the desired contradiction.…”

Section: Insufficiency Of the Recursion Rulementioning

confidence: 99%

Section: Decidability Issuesmentioning

confidence: 99%

Ten Years of Hoare's Logic: A Survey—Part I

Apt

1981

ACM Trans. Program. Lang. Syst.

420

218

View full text Add to dashboard Cite

show abstract

“…Now we go one step further to a tamed variant of higher-order process modeling, which avoids many of the well known problems of full higher-order (cf. [25,47]) as it is based on a very strong notion of type correctness (cf. [46]).…”

Section: Higher-order Modelingmentioning

confidence: 99%

Higher-Order Process Modeling: Product-Lining, Variability Modeling and Beyond

Neubauer

Steffen

Margaria

2013

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We present a graphical and dynamic framework for binding and execution of (business) process models. It is tailored to integrate 1) ad hoc processes modeled graphically, 2) third party services discovered in the (Inter)net, and 3) (dynamically) synthesized process chains that solve situationspecific tasks, with the synthesis taking place not only at design time, but also at runtime. Key to our approach is the introduction of type-safe stacked second-order execution contexts that allow for higher-order process modeling. Tamed by our underlying strict service-oriented notion of abstraction, this approach is tailored also to be used by application experts with little technical knowledge: users can select, modify, construct and then pass (component) processes during process execution as if they were data. We illustrate the impact and essence of our framework along a concrete, realistic (business) process modeling scenario: the development of Springer's browser-based Online Conference Service (OCS). The most advanced feature of our new framework allows one to combine online synthesis with the integration of the synthesized process into the running application. This ability leads to a particularly flexible way of implementing self-adaption, and to a particularly concise and powerful way of achieving variability not only at design time, but also at runtime. MotivationBusiness process modeling has evolved from mere collection of requirements artifacts, supported by tools like ARIS [45], to an important element in the whole development process of complex applications. With the introduction of execution semantics for BPMN2 [41,2], business process models have started to be used to integrate the application expert in the overall development process. This inclusive trend is however still young and suffers from complicated mechanisms for integrating user-defined or third party activities/services [8,1,44,3,42]. The only exception is the jABC framework, that was designed from the very beginning for easing the integration process and that even offers systematic formal methods-based product line [26] and variability [11] support. On the other hand, in particular AristaFlow [4] promoted ad hoc process modeling as a particularly convenient way for customization. An ad-hoc approach allows users to adapt processes at runtime for a single use, a heuristics that has also successfully been used in [21] Sec. 3.2.3.What is missing to be fully prepared for future demands is a comprehensive, type-safe framework for flexibility, able to capture variability uniformly both at design time and at runtime in a hierarchical fashion. The usefulness of this ad-hoc and context-aware flexibility is illustrated by the following three increasingly demanding route planning scenarios:Static Route Planning: Planning the route before a trip using e.g. google maps gives a selection of nice choices and the option for a detailed investigation, and one is able to 'personalize' the own trip.

show abstract

“…Da E~ isomorph zu dem Verband % aller endlichen Unterb/iume von T~ ist [1], kann man fiir die Konstruktion von F= auch den Baum T= benutzen.…”

Section: Beispielunclassified

Zur Elimination von Prozedurschachtelungen

Lippe

Simon

1979

Computing

View full text Add to dashboard Cite

On the Elimination of Procedure Nestings. In ALGOL-like programming languages with procedures there are several properties of programs concerning procedures that may be used to improve resp. optimise the performance of the runtime system. In these considerations problems very soon arise, because in general one has to discuss programs with an arbitrary nesting of procedure declarations. This paper shows that an arbitrary ALGOL 60-program can be transformed into an ALGOL 60-program which has a maximal procedure nesting 2, and both programs define the same input-output function. In order to prove this property a new notion for equivalence of ALGOL-like programs with procedures is introduced.Zur Elimination von Prozedurschachtelungen. In ALGOL-~ihnlichen Programmiersprachen mit Prozeduren gibt es im Zusammenhang mit diesen Prozeduren eiue Reihe yon Programmeigenschaften, die zu einer Verbesserung des Laufzeitsystems benutzt werden k6nnen. Bei solchen 13berlegungen treten jedoch h~iufig Probleme auf, da man Programme mit beliebigen Prozedurschachtelungen betrachten muB. Es wird nun gezeigt, dab sich beliebige ALGOL-60-Programme in funktional aquivalente Programme mit einer maximalen Prozedurschachtelungstiefe 2 transforrnieren lassen. Als HilfsmitteI wird hierzu ein neuer Aquivalenzbegriff fiir ALGOL-~ihnliche Programme mit Prozeduren eingefiihrt.

show abstract

On correct procedure parameter transmission in higher programming languages

Cited by 27 publications

References 11 publications

Ten Years of Hoare's Logic: A Survey—Part I

Ten Years of Hoare's Logic: A Survey—Part I

Higher-Order Process Modeling: Product-Lining, Variability Modeling and Beyond

Zur Elimination von Prozedurschachtelungen

Contact Info

Product

Resources

About