default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches

• 

Venues:

• no matches

• 

Publications:

• no matches

• 

ask others

• Google
• Google Scholar
• Semantic Scholar
• Internet Archive Scholar
• CiteSeerX
• ORCID

Refine list

refinements active!

zoomed in on ?? of ?? records

dismiss all constraints

view refined list in

dblp search

export refined list as

XML

JSON

JSONP

BibTeX

showing all ?? records

Proceedings of the workshop on Data abstraction, databases and conceptual modelling

• 
  Michael L. Brodie, Stephen N. Zilles:
  Proceedings of the Workshop on Data Abstraction, Databases and Conceptual Modelling, Pingree Park, Colorado, USA, June 23-26, 1980. ACM Press 1981, ISBN 0-89791-031-1 [contents]

• 
  David C. Bixler:
  Los Angeles SIGSPACE/SIGSOFT/SIGPLAN December meeting. 12
• 
  Robert Ashworth:
  Prettyprinting for power. 16-17
• 
  S. K. Bandyopadhyay:
  A study on program level dependency of implemented algorithms on its potential operands. 18-25
• 
  S. K. Bandyopadhyay:
  Theoretical relationships between potential operands and basic measurable properties of algorithm structure. 26-34
• 
  Seif Haridi, John-Olof Bauner, Gert Svensson:
  An implementation and empirical evaluation of the tasking facilities in ADA. 35-47
• 
  G. V. Cormack:
  An algorithm for the selection of overloaded functions in ADA. 48-52
• 
  Stephen C. Dewhurst:
  An equivalence result for temporal logic. 53-55
• 
  Paul Rutter:
  Using a high level language as a cross assembler. 56-58
• 
  David R. Hanson:
  The Y programming language. 59-68
• 
  Douglas McLean Jones:
  Introduction to SQURL. 69-76
• 
  David V. Moffat:
  Enumerations in Pascal, ADA, and beyond. 77-82
• 
  Patrick W. Magee:
  Improving the COBOL called and calling program interface with a pre-processor: call statements are harmful, but can be controlled. 83-88
• 
  Ahmed Mahjoub:
  Some comments on ADA as a real-time programming language. 89-95
• 
  Abraham Silberschatz:
  On the synchronization mechanism of the ADA language. 96-103
• 
  William A. Whitaker:
  Summary of the ADA implementor's meeting: December 1980. 104-109
• 
  William A. Whitaker:
  Comments on portions of the ACM SIGPLAN conference on the ADA programming language not available in the proceedings. 110-112
• 
  William D. Young, Donald I. Good:
  Steelman and the verifiability of (preliminary) ADA. 113-119
• 
  J. Adrian Zimmer:
  A control form for complex iterations. 120-131

• 
  Rodney M. Bates:
  A PASCAL prettyprinter with a different purpose. 10-17
• 
  Thomas M. Dailey III:
  A procedure invocation syntax for enhanced readability. 48-52
• 
  António L. Furtado, Paulo A. S. Veloso:
  Procedural specifications and implementations for abstract data types. 53-62
• 
  Warren Harrison, Kenneth I. Magel:
  A complexity measure based on nesting level. 63-74
• 
  Bill Mengarini:
  Macro facilities in ADA. 75-81
• 
  Fernando Orejas:
  Even more on advice on structuring compilers and proving them correct: changing an arrow. 82-84
• 
  Guido Persch, Georg Winterstein, Sophia Drossopoulou, Manfred Dausmann:
  An LALR (1) grammar for (revised) Ada. 85-98
• 
  Anand R. Tripathi, William D. Young, Donald I. Good, James C. Browne:
  HAL/S/V: a verifiable subset for HAL/S. 102-112

• 
  David R. Barach, Frederick N. Webb:
  The symbol table representation of types in the PROPHET system. 17-26
• 
  Jan A. Bergstra, John-Jules Ch. Meyer:
  I/O-computable data structures. 27-32
• 
  Charles Crowley:
  A finite state machine for Western Swing. 33-35
• 
  Joseph R. Falcone:
  A vector programming language. 36-50
• 
  Warren Harrison, Kenneth I. Magel:
  A topological analysis of the complexity of computer programs with less than three binary branches. 51-63
• 
  J. G. Hunt:
  Bracketing programme constructs. 64-67
• 
  Haim I. Kylov, S. Nudelman:
  Structured programs in PL/I. 68-69
• 
  David A. Marca:
  Some Pascal style guidelines. 70-80
• 
  Hal Perkins:
  Lazy I/O is not the answer. 81-88
• 
  Murat M. Tanik:
  Prediction models for cyclomatic complexity. 89-97
• 
  Arthur H. J. Sale:
  Addition of repeat & until as identifiers. 98-103
• 
  John R. Wolberg:
  Comparing the cost of software conversion to the cost of reprogramming. 104-110

• 
  Richard L. Wexelblat:
  New books. 16-18
• 
  Michael L. Cook, Mark G. Arnold:
  A structured APL preprocessor. 22-31
• 
  Michael Levy:
  Meeting on melpomenes: a story used to introduce the theory of data types. 32-35
• 
  Samuel T. Redwine Jr.:
  A paradigm for dealing with exceptions. 36-38
• 
  Jean-Luc Rémy, Paulo A. S. Veloso:
  An economical method for comparing data type specifications. 39-42
• 
  Masataka Sassa:
  A poor man's realization of recursive structured Fortran. 43-53
• 
  Stephen L. Stepoway, Abraham Silberschatz:
  An extension to the language-based access-control mechanism of Jones and Liskov. 54-58

• 
  Paul W. Abrahams:
  Proceedings of the ACM SIGPLAN SIGOA Symposium on Text Manipulation, Portland, Oregon, USA, June 8-10, 1981. ACM 1981, ISBN 978-0-89791-050-7 [contents]

• 
  Joseph A. Goguen, José Meseguer:
  Completeness of many-sorted equational logic. 24-32
• 
  Gaston H. Gonnet:
  Coding benchmark for Utopia84. 33-34
• 
  C. L. Hankin, H. W. Glaser:
  The data flow programming language CAJOLE - an informal introduction. 35-44
• 
  Wilfried Kneis:
  Draft standard industrial real-time FORTRAN. 45-60
• 
  Kenneth I. Magel:
  Regular expressions in a program complexity metric. 61-65
• 
  David V. Moffat:
  A model for Pascal-like typing. 66-74
• 
  Ronald H. Perrott, D. K. Stevenson:
  Users' experience with the ILLIAC IV system and its programming languages. 75-88
• 
  Abraham Silberschatz:
  A note on the distributed program component cell. 89-96

• 
  Richard L. Wexelblat:
  New books: May 1981. 6-9
• 
  Richard L. Wexelblat:
  New books: June 1981. 10-13
• 
  Allan J. Payne:
  A basis for software physics? 27-30
• 
  Charles Rapin, Jacques Menu:
  The Newton language. 31-40
• 
  Bill N. Schilit:
  A solution to the great big substitution problem: subject modification during pattern matching in SNOBOL4. 41-49
• 
  Ehud Shapiro, Gregg Collins, Lewis Johnson, John Ruttenberg:
  PASES: a programming environment for PASCAL. 50-57
• 
  David Spector:
  Full LR(1) parser generation. 58-66
• 
  Peter van der Linden, Leonard K. Nicholson:
  Macro facilities in the Ada environment. 67-68
• 
  Jürgen F. H. Winkler:
  Differences between preliminary and final ADA. 69-81

• 
  Rafael Bonet, Antonio Kung, Knut Ripken, Robert K. Yates, Manfred Sommer, Jürgen Winkler:
  Ada syntax diagrams for top-down analysis. 29-41
• 
  Grady Booch:
  Describing software design in Ada. 42-47
• 
  Frank DeRemer, Thomas J. Pennello, William M. McKeeman:
  Ada syntax chart. 48-59
• 
  Aaron H. Konstam:
  A method for controlling parallelism in programming languages. 60-65
• 
  Peter E. Lauer:
  Synchronization of concurrent processes without globality assumptions. 66-80
• 
  David A. Rowland:
  An extension to Pascal read and write procedures. 81-82
• 
  Shimon Cohen:
  Simplicity = efficiency = readability a simple infix to prefix algorithm. 83-89
• 
  Charles S. Wetherell:
  Problems with the Ada reference grammar. 90-104

• 
  David A. Gustafson:
  Control flow, data flow & data independence. 13-19
• 
  B. Maher, Derek H. Sleeman:
  A data driven system for syntactic transformations. 50-52
• 
  James A. Malcolm:
  Brevity and clarity in command languages. 53-59
• 
  W. D. Maurer:
  An alternate characterization of preorder, inorder, and postorder. 60-61
• 
  K. T. Narayana, Maurice Clint:
  On the formal treatment of a permutation finding program. 62-73

• 
  Richard D. Jenks, Barry M. Trager:
  A language for computational algebra. 22-29
• 
  Alastair J. W. Mayer:
  Value receiving procedures. 30-34
• 
  Darrel C. Ince:
  The implementation of file structures in some high level languages. 49-55

• 
  D. G. Elliott:
  FORTRAN 77 and structured design. 7-9
• 
  Alfred H. Morris Jr.:
  Can Ada replace FORTRAN for numerical computation? 10-13
• 
  Patrick A. Fitzhorn, Gearold R. Johnson:
  C: toward a concise syntactic description. 14-21
• 
  Mordechai Ben-Ari, Amiram Yehudai:
  A methodology for modular use of Ada. 22-26
• 
  Mary S. Van Deusen:
  Types in red. 27-38

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

last updated on 2024-11-25 22:47 CET by the dblp team

 all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

 

since 2018, dblp has been operated and maintained by:

 

the dblp computer science bibliography is funded and supported by: