| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465668503316 |
|
|
Autore |
Tarlecki Andrzej |
|
|
Titolo |
Mathematical Foundations of Computer Science 1991 [[electronic resource] ] : 16th International Symposium, Kazimierz Dolny, Poland, September 9-13, 1991. Proceedings / / by Andrzej Tarlecki |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1991.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XI, 437 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 520 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Software engineering |
Architecture, Computer |
Algorithms |
Computer logic |
Theory of Computation |
Software Engineering/Programming and Operating Systems |
Computer System Implementation |
Computation by Abstract Devices |
Algorithm Analysis and Problem Complexity |
Logics and Meanings of Programs |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
Elimination of negation in term algebras -- Rewrite orderings and termination of rewrite systems -- On the faithfulness of formal models -- Models for concurrency -- On a hierarchy of file types and a tower of their theories -- Strong conjunction and intersection types -- Partial higher-order specifications -- Unification in incompletely specified theories: A case study -- Observing localities -- Abstract dynamic data types: A temporal logic approach -- Generating words by cellular automata -- Atomic refinement in process description languages -- Recognizable complex trace languages (abstract) -- Solving systems of linear diophantine equations: An algebraic approach -- A second-order pattern matching algorithm for the cube of typed ?-calculi -- The lazy |
|
|
|
|
|
|
|
|
|
|
|
call-by-value ?-calculus -- The limit of split n -bisimulations for CCS agents -- Stochastic automata and length distributions of rational languages -- Towards a categorical semantics of type classes -- Single-path Petri nets -- The bisection problem for graphs of degree 4 (configuring transputer systems) -- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata -- Infinite normal forms for non-linear term rewriting systems -- Two algorithms for approxmate string matching in static texts -- Efficient constructions of test sets for regular and context-free languages -- The complexity of the reliable connectivity problem -- Pattern matching in order-sorted languages -- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus -- A solution of the complement problem in associatiue-commutatiue theories -- A model for real-time systems -- On strict codes -- A decidable case of the semi-unification problem -- Maintaining dictionaries in a hierarchical memory -- Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ?-BRANCHING PROGRAMs -- CCS dynamic bisimulation is progressing -- Syntax and semantics of a monotonic framework for non-monotonic reasoning -- On the cardinality of sets of infinite trees recognizable by finite automata -- Extending temporal logic by explicit concurrency -- An extensional partial combinatory algebra based on ?-terms -- Once more on order-sorted algebras -- Composition of two semi commutations -- An efficient decision algorithm for the uniform semi-unification problem extended abstract -- Different modifications of pointer machines and their computational power. |
|
|
|
|
|
|
Sommario/riassunto |
|
This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers. |
|
|
|
|
|
|
|
| |