scientific article; zbMATH DE number 3388535

MaRDI QIDQ5657644zbMATH OpenFDO

Authors John Cocke, Jacob T. Schwartz

Publication date 1970

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(26)

• Purging in an equality data base
• Pathlistings applied to data flow analysis
• Finite constants: Characterizations of a new decidable set of constants
• Semantic decomposition of computer programs: An aid to program testing
• The analysis of Quicksort programs
• Profitability computations on program flow graphs
• Monotone data flow analysis frameworks
• Conditional congruence closure over uninterpreted and interpreted symbols
• Fast algorithms for the elimination of common subexpressions
• Some properties of fully reducible graphs
• One-variable context-free hedge automata
• Formal languages for integer programming modeling of shift scheduling problems
• Products of weighted logic programs
• On digraphs with a rooted tree structure
• Experience with a conversational parser generating system
• Applications of graph theory in computer systems
• Optimization of structured programs
• If the current clique algorithms are optimal, so is Valiant's parser
• Representations of the language recognition problem for a theorem prover
• Sparse RNA folding: time and space efficient algorithms
• Efficient parallel and incremental parsing of practical context-free languages
• Dynamic Programming Algorithms as Products of Weighted Logic Programs
• Online context-free recognition in OMv time
• A region analysis algorithm for the live variables problem
• On graph rewritings
• A large neighbourhood search approach to the multi-activity shift scheduling problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657644)