Hans Langmaack - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2022

Manfred Paul (1932-2021)Hans Langmaack, Gunther Schmidt 0001. insk, 45(1):45-46, 2022. [doi]

2014

Friedrich L. Bauers und Klaus Samelsons Arbeiten in den 1950er-Jahren zur Einführung der Begriffe Kellerprinzip und KellerautomatHans Langmaack. BIRTHDAY 2015: 19-29 [doi]

2013

Some Methodological Remarks Inspired by the Paper "On inner classes" by A. Igarashi and B. PierceHans Langmaack, Andrzej Salwicki. FUIN, 122(3):227-274, 2013. [doi]

2010

Dijkstras fruchtbarer, folgenreicher Irrtum - Teil 1: Die Kopenhagener Diskussion und deren FolgenHans Langmaack. insk, 33(3):302-308, 2010. [doi]

Dijkstras fruchtbarer, folgenreicher Irrtum - Teil 3: Zu Laufzeitsystemkorrektheit und Auswirkungen von Dijkstras AussageHans Langmaack. insk, 33(6):634-646, 2010. [doi]

Dijkstras fruchtbarer, folgenreicher Irrtum - Teil 2: Most recent -Eigenschaft eines ProgrammsHans Langmaack. insk, 33(4):384-392, 2010. [doi]

On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and PreventionHans Langmaack. BIRTHDAY 2010: 74-95 [doi]

2009

On an algorithm determining direct superclasses in Java and similar languages with inner classes - Its correctness, completeness and uniqueness of solutionsHans Langmaack, Andrzej Salwicki, Marek Warpechowski. iandc, 207(3):389-410, 2009. [doi]

2008

A Deterministic Algorithm for Identifying Direct Superclasses in JavaHans Langmaack, Andrzej Salwicki, Marek Warpechowski. FUIN, 85(1-4):343-357, 2008. [doi]

2007

On Revival of Algol-Concepts in Modern Programming and Specification LanguagesHans Langmaack. birthday 2007: 414-434 [doi]

2005

What Level of Mathematical Reasoning can Computer Science Demand of a Software Implementer?: Auf Deutsch: Welche Art mathematischer Argumentation darf die Informatikwissenschaft einem Softwareimplementierer auf jeden Fall zumuten?Hans Langmaack. ENTCS, 141(2):5-32, 2005. [doi]

2004

Consistency of Inheritance in Object-Oriented Languages and of Static, ALGOL-like BindingHans Langmaack. BIRTHDAY 2004: 209-235 [doi]

An ALGOL-View on Turbo ASMHans Langmaack. asmta 2004: 20-37 [doi]

2002

Klaus Samelsons frühe Beitraege zur Informatikentwicklung - Historische NotizHans Langmaack. insk, 25(2):132-137, 2002. [doi]

1997

The ProCoS Approach to Correct SystemsHans Langmaack. rts, 13(3):253-275, 1997.

Contribution to Goodenough s and Gerhart s Theory of Software Testing and Verification: Relation between Strong Compiler Test and Compiler Implementation VerificationHans Langmaack. BIRTHDAY 1997: 321-335 [doi]

Softwareengineering zur Zertifizierung von Systemen: Spezifikations-, Implementierungs-, UbersetzerkorrektheitHans Langmaack. it, 39(3):41-47, 1997. [doi]

1995

The Stream Boiler Case Study: Competition of Formal Program Specification and Development MethodsJean-Raymond Abrial, Egon Börger, Hans Langmaack. Dagstuhl 1996: 1-12

1992

Provably Correct Compiler Development and ImplementationBettina Buth, Karl-Heinz Buth, Martin Fränzle, Burghard von Karger, Yassine Lakhnech, Hans Langmaack, Markus Müller-Olm. cc 1992: 141-155

1984

Concatenation of program modules an algebraic approach to the semantic and implementation problemsManfred Krause, Hans Langmaack, Antoni Kreczmar, Marek Warpechowski. sct 1985: 134-156 [doi]

1983

Characterization of Acceptable by ALGOL-Like Programming LanguagesCh. Crasemann, Hans Langmaack. lop 1984: 129-146

Apects of Programs With Finite ModesHans Langmaack. fct 1983: 241-254

1982

On Termination Problems for Finitely Interpreted ALGOL-like ProgramsHans Langmaack. ACTA, 18:79-108, 1982.

1980

Present-Day Hoare-Like Systems for Programming Languages with Procedures: Power, Limits and most Likely ExpressionsHans Langmaack, Ernst-Rüdiger Olderog. icalp 1980: 363-373

1979

The Formal Termination Problem for Programs with Finite ALGOL 68-ModesHans Langmaack, Wolfram-Manfred Lippe, Franz Wagner. ipl, 9(3):155-159, 1979.

1978

On a theory of decision problems in programming languagesHans Langmaack. msi 1979: 538-558

1975

Hauptvortrag: Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?Hans Langmaack. automata 1975: 259-273

1974

Zum Begriff der Modularität von ProgrammierungssprachenHans Langmaack. programmier 1974: 1-12

On Procedures as Open Subroutines. IIHans Langmaack. ACTA, 3:227-241, 1974.

1973

Informatik - ProgrammierungPeter Kandzia, Hans Langmaack. Teubner Studienbücher: Informatik, Teubner, 1973.

On Procedures as Open Subroutines. IHans Langmaack. ACTA, 2:311-333, 1973.

On Correct Procedure Parameter Transmission in Higher Programming LanguagesHans Langmaack. ACTA, 2:110-142, 1973.

1971

Application of Regular Canonical Systems to Grammars Translatable from Left to RightHans Langmaack. ACTA, 1:111-114, 1971.

Verbandstheoretische Einbettung von Klassen unwesentlich verschiedener Ableitungen in die ZopfgruppeHans Langmaack. computing, 7(3-4):293-310, 1971. [doi]

1965

Algorithm 263 Gomory 1 [H]Hans Langmaack. CACM, 8(10):601-602, 1965. [doi]

Sign in or sign up to see more results.

runs on WebDSL