We present in this paper a pseudo functional language and a specification language both of which are designed to describe systems of synchronized processes with shared resources. the semantics of the pseudo functional...
We present in this paper a pseudo functional language and a specification language both of which are designed to describe systems of synchronized processes with shared resources. the semantics of the pseudo functional language is defined by translating its statements to the set of formulas of intensional logic. the specification language contains formulas of the logic, hence its semantics can be treated by the model theory as usual. A proof method for the program written in the language is proposed. Time dependent aspects of processes are described in terms of intensional logic. Specification of parallel systems can be described in a well structured manner in our specification language, more precisely, they are described hierarchically according to the function decomposition of the system, and at each level of the hierarchy the configuration of processes and resources and time dependent properties are separately described. Resources are defined as an abstract data type with synchronization specification. We give an example of specification and a proof of a program written in the parallel pseudo functional programming language.
the marriage of switched capacitor filter technology with fuseable links from ROM technology has resulted in a basic analog filter building block. this device is user programmable and may be used to realize a wide ran...
详细信息
the marriage of switched capacitor filter technology with fuseable links from ROM technology has resulted in a basic analog filter building block. this device is user programmable and may be used to realize a wide range of bandpass and low-pass responses.
Twenty-seven papers from this symposium cover a variety of topics, many of which fall under the general heading of programming languages. Among the subjects considered are: programminglogic, computer metatheory, attr...
详细信息
Twenty-seven papers from this symposium cover a variety of topics, many of which fall under the general heading of programming languages. Among the subjects considered are: programminglogic, computer metatheory, attribute grammars, language semantics, and data flow analysis. Twenty papers are indexed separately.
First Order programminglogic is a simple, yet powerful formal system for reasoning about recursive programs. In its simplest form, it has one major limitation: it cannot establish any property of the least fixed poin...
详细信息
A logic for a relational data manipulation language is defined by augmenting a known logic of programs with rules for two new statements: the relational assignment, which assign a relational expression to a relation, ...
the proceedings contain 27 papers. the topics discussed include: a compact, machine-independent peephole optimizer;a PL/CV PRECIS;inductively controllable constructs in very high level languages;an efficient way to fi...
the proceedings contain 27 papers. the topics discussed include: a compact, machine-independent peephole optimizer;a PL/CV PRECIS;inductively controllable constructs in very high level languages;an efficient way to find the side effects of procedure calls and the aliases of variables;principles of proving concurrent programs in gypsy;the evolution of list-copying algorithms and the need for structured program verification;first order programminglogic;recursion in logics of programs;process logic: preliminary report;and the logic of a relational data manipulation language.
We discuss problems arising in reasoning about on-going processes, using the modal constructs after, throughout, during, and preserves. Earlier work established decidability of the theory whose language included only ...
the proceedings contain 53 papers. the special focus in this conference is on Automata, Languages and programming. the topics include: Arbitration and queueing under limited shared storage requirements;on the homomorp...
ISBN:
(纸本)9783540095101
the proceedings contain 53 papers. the special focus in this conference is on Automata, Languages and programming. the topics include: Arbitration and queueing under limited shared storage requirements;on the homomorphic characterizations of families of languages;Two level grammars: CF-grammars with equation schemes;proving termination with multiset orderings;one abstract accepting algorithm for all kinds of parsers;studies in abstract/concrete mappings in proving algorithm correctness;a characterization of a dot-depth two analogue of generalized definite languages;Partitioned LL(K) grammars;sur les mots sans carré définis par un morphisme;recursion schemes and generalized interpretations;A rational theory of AFLs;on the succinctness of different representations of languages;a fixed-point theorem for recursive-enumerable languages and some considerations about fixed-point semantics of monadic programs;hierarchic index sequential search with optimal variable block size and its minimal expected number of comparisons;a unique termination theorem for a theory with generalised commutative axioms;dags and Chomsky hierarchy;recent advances in the probabilistic analysis of graph-theoretic algorithms;on the average stack size of regularly distributed binary trees;on reductions of parallel programs;a characterization of abstract data as model-theoretic invariants;on the height of derivation trees;the modal logic of programs;a comparison between two variations of a pebble game on graphs;LL(k) parsing for attributed grammars;on eliminating nondeterminism from turing machines which use less than logarithm worktape space;structure preserving transformations on non-left-recursive grammars;the complexity of restricted minimum spanning tree problems;a systematic approach to formal language theory through parallel rewriting;supercounter machines.
Twenty-seven papers from this symposium cover a variety of topics, many of which fall under the general heading of programming languages. Among the subjects considered are: programminglogic, computer metatheory, attr...
详细信息
Twenty-seven papers from this symposium cover a variety of topics, many of which fall under the general heading of programming languages. Among the subjects considered are: programminglogic, computer metatheory, attribute grammars, language semantics, and data flow analysis. Twenty papers are indexed separately.
the proceedings contain 61 papers. the special focus in this conference is on Mathematical Foundations of Computer Science. the topics include: Frequency algorithms and computations;graph-theoretic arguments in low-le...
ISBN:
(纸本)9783540083535
the proceedings contain 61 papers. the special focus in this conference is on Mathematical Foundations of Computer Science. the topics include: Frequency algorithms and computations;graph-theoretic arguments in low-level complexity;properties of complexity classes a short survey;a uniform approach to inductive posets and inductive closure;generalized probabilistic grammars;classes of structurally isomorphic np-optimization problems;pushdown-automata and families of languages generating cylinders;semantics of infinite processes using generalized trees;a comparative review of some program verification methods;characterization of recognizable families by means of regular languages;an algebraic approach to problem solution and problem semantics;complexity and minimality of context-free grammars and languages;comparison of the active visiting and the crossing complexities;arithmetical complexity of some problems in computer science;formal transformations and the development of programs;optimal rasp programs for arbitrarily complex 0–1 valued functions;the expressive power of intensional logic in the semantics of programming languages;on the complexity of equivalent transformations in programming languages;Schematology in a MJ I/T I-language OPT imizer;classification of the context-free languages;decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions;a top-down no backtrack parsing of general context-free languages;a probabilistic restriction of branching plans;reducing operators for normed general formal systems;invariant properties of informational bulks;two decidability results for deterministic pushdown automata;on the logic of incomplete information;measures of ambiguity in the analysis of complex systems;two-level meta-controlled substitution grammars;a calculus to build up correct programs;acceptors for iteration languages.
暂无评论