S. Michaelson, Robin Milner
Proceedings of the Third International Colloquium on Automata, Languages and Programming
ICALP, 1976.
@proceedings{ICALP-1976, address = "Edinburgh, Scotland, United Kingdom", editor = "S. Michaelson and Robin Milner", isbn = "0-85224-308-1", title = "{Proceedings of the Third International Colloquium on Automata, Languages and Programming}", year = 1976, }
Contents (31 items)
- ICALP-1976-Linna #context-free grammar #on the
- On ω-sets Associated with Context-Free Languages (ML), pp. 1–19.
- ICALP-1976-Soisalon-SoininenU #ll
- A Characterization of LL(k) Languages (ESS, EU), pp. 20–30.
- ICALP-1976-Valiant #decidability #equivalence #problem
- The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets (LGV), pp. 31–37.
- ICALP-1976-Restivo #on the #product line
- On a Family of Codes Related to Factorization of Cyclotomic Polynomials (AR), pp. 38–44.
- ICALP-1976-Perrin #french
- Sur la longeur moyenne des codes préfixes (DP), pp. 45–51.
- ICALP-1976-Sakarovitch #french
- Sur les monoïdes syntactiques des langages algébriques déterministes (JS), pp. 52–65.
- ICALP-1976-Beauquier #french
- Générateurs algébriques non-ambigus (JB), pp. 66–73.
- ICALP-1976-ArnoldD #french
- Bi-transductions de forêts (AA, MD), pp. 74–86.
- ICALP-1976-Kroger #logic #reasoning #source code
- Logical Rules of Natural Reasoning about Programs (FK), pp. 87–98.
- ICALP-1976-Emden #source code #verification
- Verification Conditions as Programs (MHvE), pp. 99–119.
- ICALP-1976-Lipski #information management
- Informational Systems with Incomplete Information (WLJ), pp. 120–130.
- ICALP-1976-Schwarz #proving #reasoning #source code #termination
- Event Based Reasoning — A System for Proving Correct Termination of Programs (JS), pp. 131–146.
- ICALP-1976-LongoZ #formal method
- A Theory of Computation with an Identity Discriminator (GL, MVZ), pp. 147–167.
- ICALP-1976-BerryC #canonical #equivalence
- Program Equivalence and Canonical Forms in Stable Discrete Interpretations (GB, BC), pp. 168–188.
- ICALP-1976-Guessarian #equivalence #semantics
- Semantic Equivalence of Program Schemes and its Syntactic Characterization (IG), pp. 189–200.
- ICALP-1976-Brand #proving #source code
- Proving Programs Incorrect (DB), pp. 201–227.
- ICALP-1976-Cartwright #data type #lisp #source code #verification
- User-Defined Data Types as an Aid to Verifying LISP Programs (RC), pp. 228–256.
- ICALP-1976-FriedmanW
- CONS Should Not Evaluate its Arguments (DPF, DSW), pp. 257–284.
- ICALP-1976-GillS #metric #turing machine
- Ink, Dirty-Tape Turing Machines, and Quasicomplexity Measures (JG, IS), pp. 285–306.
- ICALP-1976-McColl
- The Depth of Boolean Functions (WFM), pp. 307–321.
- ICALP-1976-Schnorr #algorithm #problem #self
- Optimal Algorithms for Self-Reducible Problems (CPS), pp. 322–337.
- ICALP-1976-AltM #bound #complexity #recognition
- Lower Bounds for the Space Complexity of Context-Free Recognition (HA, KM), pp. 338–354.
- ICALP-1976-Galil #integer #on the #programming #proving #theorem proving
- On Enumeration Procedures for Theorem Proving and for Integer Programming (ZG), pp. 355–381.
- ICALP-1976-Leeuwen #on the
- On the Construction of Huffman Trees (JvL), pp. 382–410.
- ICALP-1976-Fontet #algorithm #graph #linear #morphism #testing
- A Linear Algorithm for Testing Isomorphism of Planar Graphs (MF), pp. 411–424.
- ICALP-1976-BloniarzFM #transitive
- A Note on the Average Time to Compute Transitive Closures (PAB, MJF, ARM), pp. 425–434.
- ICALP-1976-Bakker #nondeterminism #recursion #semantics #source code #termination
- Semantics and Termination of Nondeterministic Recursive Programs (JWdB), pp. 435–477.
- ICALP-1976-HennessyA #nondeterminism #semantics
- The Semantics of Nondeterminism (MH, EAA), pp. 478–493.
- ICALP-1976-Greif #on the #proving #source code
- On Proofs of Programs for Synchronization (IG), pp. 494–507.
- ICALP-1976-Ehrich #algebra
- Outline of an Algebraic Theory of Structured Objects (HDE), pp. 508–530.
- ICALP-1976-Sintzoff #backtracking #source code
- Eliminating Blind Alleys from Backtrack Programs (MS), pp. 531–557.
8 ×#source code
5 ×#on the
4 ×#french
4 ×#proving
3 ×#equivalence
3 ×#semantics
2 ×#algorithm
2 ×#nondeterminism
2 ×#problem
2 ×#reasoning
5 ×#on the
4 ×#french
4 ×#proving
3 ×#equivalence
3 ×#semantics
2 ×#algorithm
2 ×#nondeterminism
2 ×#problem
2 ×#reasoning