![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 101 matches
- 1984
- André Arnold, Pascal Guitton:
Un modèle de description de protocoles: les reéseaux fermés d'atuomates triphasés. Symposium on Programming 1984: 1-12 - H. Bahsoun, Claude Bétourné, Louis Féraud:
Une expression de la synchronisatin et de l'oronnancement des processus concurrents par variables partagées. Symposium on Programming 1984: 13-22 - Patrick Bellot:
Sémantiques comparées des systeèmes de programmation fonctioneele FP et FFP de J. W. Backus. Symposium on Programming 1984: 23-34 - Alain Bossavit:
Le type abstrait vecteur et les méthodes de programmation des ordinateurs vectoriels. Symposium on Programming 1984: 35-46 - Vincenza Carchiolo
, Alberto Faro, F. Minissale, Giuseppe Scollo:
Some Topics in the Design of the Specification Language Lotos. Symposium on Programming 1984: 47-58 - Ana R. Cavalli, Luis Fariñas del Cerro:
Specification and Verification of Networks Protocols Using. Symposium on Programming 1984: 59-73 - Pierre Cointe:
Ue implémentation des coroutines en Lisp, application à Smalltalk. Symposium on Programming 1984: 74-88 - J. C. Cottet, Claude Renvoise, D. Sciamma:
Vesta: Vectorisation automatique et paramétrée de programmes. Symposium on Programming 1984: 89-100 - Paul Feautrier:
Projet Vesta: outil de calcul symbolique. Symposium on Programming 1984: 113-124 - Jeanne Ferrante, Karl J. Ottenstein, Joe D. Warren:
The program Dependence Graph and its Use in Optimization. Symposium on Programming 1984: 125-132 - J. Finet, Patrick Sallé:
L'inclusion de filtres: une approche de la création d'environnements symboliquesen Plasma. Symposium on Programming 1984: 101-112 - Pedro Guerreiro
:
Implementations of Nondeterministic Programs. Symposium on Programming 1984: 133-144 - Stephan Heilbrunner, Lothar Schmitz:
For Statements with Restricted Enumerations. Symposium on Programming 1984: 145-154 - Ryszard Janicki:
A Method for Developing Concurrent Systems. Symposium on Programming 1984: 155-166 - Martin Jourdan:
An Optimal-time Recursive Evaluator for Attribute Grammars. Symposium on Programming 1984: 167-178 - Maciej Koutny:
On the Merlin-Randell Problem of Train Journeys. Symposium on Programming 1984: 179-190 - Eric Madelaine
:
Un système d'aide à la preuve de compilateurs. Symposium on Programming 1984: 191-205 - Silvio Romero de Lemos Meira:
Optimized Combinatoric Code for Applicative Language Implementation. Symposium on Programming 1984: 206-216 - Alan Mycroft
:
Polymorphic Type Schemes and Recursive Definitions. Symposium on Programming 1984: 217-228 - M. W. Shields:
Non-Sequential Behaviour. Symposium on Programming 1984: 229-239 - Morris M. Siegel:
Proving Properties of SNOBOL 4 Patterns: Selecting the Assertion Format. Symposium on Programming 1984: 240-250 - Scott A. Smolka:
Polynomial-Time Analysis for a Class of Communicating processes. Symposium on Programming 1984: 250-262 - Manfred Paul, Bernard J. Robinet:
International Symposium on Programming, 6th Colloquium, Toulouse, France, April 17-19, 1984, Proceedings. Lecture Notes in Computer Science 167, Springer 1984, ISBN 3-540-12925-1 [contents] - 1982
- Marco Bellia, Enrico Dameri, Pierpaolo Degano, Giorgio Levi, Maurizio Martelli:
Applicative communicating processes in first order logic. Symposium on Programming 1982: 1-14 - David B. Benson:
A machine level semantics for nondeterministic, parallel programs. Symposium on Programming 1982: 15-25 - Jan A. Bergstra, Jan Willem Klop:
A formalized proof system for total correctness of while programs. Symposium on Programming 1982: 26-36 - Ernesto Costa:
Automatic program transformation viewed as theorem proving. Symposium on Programming 1982: 37-46 - Philippe Darondeau:
An enlarged definition and complete axiomatization of observational congruence of finite processes. Symposium on Programming 1982: 47-62 - Ph. Deschamp:
Perluette: A compilers producing system using abstract data types. Symposium on Programming 1982: 63-77 - Pär Emanuelson:
From abstract model to efficient compilation of patterns. Symposium on Programming 1982: 91-104
skipping 71 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-12 10:29 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint