Full abstraction for a simple parallel programming language (Englisch)
Nationallizenz
- Neue Suche nach: Hennessy, M. C. B.
- Neue Suche nach: Plotkin, G. D.
- Neue Suche nach: Hennessy, M. C. B.
- Neue Suche nach: Plotkin, G. D.
In:
Mathematical Foundations of Computer Science 1979
;
108-120
;
1979
-
ISBN:
- Aufsatz/Kapitel (Buch) / Elektronische Ressource
-
Titel:Full abstraction for a simple parallel programming language
-
Beteiligte:Hennessy, M. C. B. ( Autor:in ) / Plotkin, G. D. ( Autor:in )
-
Erschienen in:Lecture Notes in Computer Science ; 74 ; 108-120
-
Verlag:
- Neue Suche nach: Springer Berlin Heidelberg
-
Erscheinungsort:Berlin, Heidelberg
-
Erscheinungsdatum:01.01.1979
-
Format / Umfang:13 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz/Kapitel (Buch)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis E-Book
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
A sound and complete proof system for partial program correctnessBakker, J. W. et al. | 1979
- 13
-
The problem of reachability and verification of programsBarzdin, J. M. et al. | 1979
- 26
-
Assertion programmingBlikle, Andrzej J. et al. | 1979
- 43
-
Complexity classes of formal languagesBook, Ronald V. et al. | 1979
- 57
-
Fast probabilistic algorithmsFreivalds, Rūsiņš et al. | 1979
- 70
-
Relative succinctness of representations of languages and separation of complexity classesHartmanis, Juris / Baker, T. P. et al. | 1979
- 89
-
On two types of loopsHavel, Ivan M. et al. | 1979
- 108
-
Full abstraction for a simple parallel programming languageHennessy, M. C. B. / Plotkin, G. D. et al. | 1979
- 121
-
On some developments in cryptography and their applications to computer scienceMaurer, Hermann A. et al. | 1979
- 131
-
Searching, sorting and information theoryMehlhorn, Kurt et al. | 1979
- 146
-
Lcf: A way of doing proofs with a machineMilner, Robin et al. | 1979
- 160
-
Axioms or algorithmsPratt, Vaughan R. et al. | 1979
- 170
-
Power from power seriesSalomaa, Arto et al. | 1979
- 182
-
Computational complexity of string and graph ident ificationSlisenko, A. O. et al. | 1979
- 191
-
A survey of grammar and l forms-1978Wood, Derick et al. | 1979
- 201
-
A theoretical study on the time analysis of programsAdachi, Akeo / Kasai, Takumi / Moriya, Etsuro et al. | 1979
- 208
-
Completeness problems in verification of programs and program schemesAndréka, H. / Németi, I. / Sain, I. et al. | 1979
- 219
-
Relationships between AFDL's and cylindersAutebert, Jean-Michel et al. | 1979
- 228
-
Computable data typesComyn, G. / Werner, G. et al. | 1979
- 237
-
Program equivalence and provabilityCousineau, G. / Enjalbert, P. et al. | 1979
- 246
-
Interactive L systems with almost interactionless behaviourCulik, K. II / Karhumäki, J. et al. | 1979
- 258
-
On the simplification of constructions in degrees of unsolvability via computational complexityDaley, Robert P. et al. | 1979
- 266
-
An algebraic extension of the Chomsky — hierarchyDamm, W. et al. | 1979
- 277
-
Bounds on computational complexity and approximability of initial segments of recursive setsDekhtjar, M. I. et al. | 1979
- 284
-
On the weighted path length of binary search trees for unknown access probabilitiesFischer, Thomas et al. | 1979
- 292
-
Computational complexity of approximation algorithms for combinatorial problemsGens, G. V. / Levner, E. V. et al. | 1979
- 301
-
A reduct-and-closure algorithm for graphsGoralčíková, Alla / Koubek, Václav et al. | 1979
- 308
-
Small universal Minsky machinesGregušová, Ľudmila / Korec, Ivan et al. | 1979
- 317
-
Parallel and two-way recognizers of directed acyclic graphsKamimura, Tsutomu / Slutzki, Giora et al. | 1979
- 326
-
Fully effective solutions of recursive domain equationsKanda, Akira et al. | 1979
- 337
-
A note on computational complexity of a statistical deducibility testing procedureKramosil, Ivan et al. | 1979
- 346
-
Context free normal systemsKudlek, Manfred et al. | 1979
- 354
-
New proofs for jump dpda'sLinna, Matti / Penttonen, Martti et al. | 1979
- 363
-
Synchronization and maximality for very pure subsemigroups of a free semigroupLuca, Aldo / Restivo, Antonio et al. | 1979
- 372
-
On the sets of minimal indices of partial recursive functionsMarandžjan, G. B. et al. | 1979
- 375
-
Some remarks on Boolean sumsMehlhorn, Kurt et al. | 1979
- 381
-
On the propositional algorithmic logicMirkowska, Grazyna et al. | 1979
- 390
-
Ch(k) grammars: A characterization of LL(k) languagesNijholt, Anton / Soisalon-Soininen, Eljas et al. | 1979
- 398
-
A uniform approach to balanced binary and multiway treesOttmann, Th. / Wood, D. et al. | 1979
- 408
-
On the generative capacity of some classes of grammars with regulated rewritingPăun, Gheorghe et al. | 1979
- 415
-
Validity test for Floyd's operator-precedence parsing algorithmsRužička, Peter et al. | 1979
- 425
-
On the languages of bounded Petri netsStarke, Peter H. et al. | 1979
- 434
-
Dyck language D2 is not absolutely parallelTegze, Miron et al. | 1979
- 443
-
Fixed points in the power-set algebra of infinite treesTiuryn, Jerzy et al. | 1979
- 453
-
On relaxation rules in algorithmic logicTrakhtenbrot, B. A. et al. | 1979
- 463
-
L-Fuzzy functorial automataTrnková, Věra et al. | 1979
- 474
-
Schematics of structural parallel programming and its applicationsTseytlin, G. E. et al. | 1979
- 482
-
On axiomatization of deterministic propositional dynamic logicValiev, M. K. et al. | 1979
- 492
-
Bounded recursion and complexity classesWagner, Klaus et al. | 1979
- 499
-
Characterization of rational and algebraic power seriesWechler, Wolfgang et al. | 1979
- 508
-
A crossing measure for 2-tape Turing machinesWechsung, Gerd et al. | 1979
- 517
-
The complexity of lexicographic sorting and searchingWiedermann, Juraj et al. | 1979
- 523
-
An algebraic approach to concurrenceWinkowski, Józef et al. | 1979
- 533
-
On multitape automataYamasaki, Hideki et al. | 1979
- 542
-
A turing machine oracle hierarchyŽák, Stanislav et al. | 1979
- 552
-
A survey of some syntactic results in the λ-calculusBerry, Gérard / Lévy, Jean-Jacques et al. | 1979
- 567
-
On rational expressions representing infinite rational trees : Application to the structure of flow chartsCousineau, Guy / Nivat, Maurice et al. | 1979