![](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 25 matches
- 1991
- Luca Aceto:
Full Abstraction for Series-Parallel Pomsets. TAPSOFT, Vol.1 1991: 1-25 - Roberto M. Amadio:
Domains in a Realizability Framework. TAPSOFT, Vol.1 1991: 241-263 - Egidio Astesiano, Maura Cerioli
:
Non-Strict Don't Care Algebras and Specifications. TAPSOFT, Vol.1 1991: 121-142 - Hubert Baumeister:
Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution. TAPSOFT, Vol.1 1991: 103-120 - Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras (Extended Abstract). TAPSOFT, Vol.1 1991: 264-274 - Frank S. de Boer, Catuscia Palamidessi
:
A Fully Abstract Model for Concurrent Constraint Programming. TAPSOFT, Vol.1 1991: 296-319 - Franck van Breugel:
Comparative Semantics for a Real-Time Programming Language with Integration. TAPSOFT, Vol.1 1991: 397-411 - P. M. van den Broek:
Algebraic Graph Rewriting Using a Single Pushout. TAPSOFT, Vol.1 1991: 90-102 - Anne-Cécile Caron
:
Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties. TAPSOFT, Vol.1 1991: 74-89 - Andrea Corradini, Francesca Rossi, Francesco Parisi-Presicce:
Logic Programming as Hypergraph Rewriting. TAPSOFT, Vol.1 1991: 275-295 - Gian-Luigi Ferrari
:
On Causality Observed Incrementally, Finally. TAPSOFT, Vol.1 1991: 26-41 - Maurizio Gabbrielli
, Giorgio Levi:
A Solved Form Algorithm for Ask and Tell Herbrand Constraints. TAPSOFT, Vol.1 1991: 320-337 - Philippe Granger:
Static Analysis of Linear Congruence Equalities among Variables of a Program. TAPSOFT, Vol.1 1991: 169-192 - Bengt Jonsson, Kim Guldstrand Larsen:
On the Complexity of Equation Solving in Process Algebra. TAPSOFT, Vol.1 1991: 381-396 - Stefano Kasangian, Sebastiano Vigna:
Introducing a Calculus of Trees. TAPSOFT, Vol.1 1991: 215-240 - Pekka Kilpeläinen, Heikki Mannila:
The Tree Inclusion Problem. TAPSOFT, Vol.1 1991: 202-214 - Emmanuel Kounalis, Denis Lugiez:
Compilation of Pattern Matching with Associative-Commutative Functions. TAPSOFT, Vol.1 1991: 57-73 - Marta Z. Kwiatkowska:
On the Domain of Traces and Sequential Composition. TAPSOFT, Vol.1 1991: 42-56 - Fabrizio Luccio, Linda Pagli:
Simple Solutions for Approximate Tree Matching Problems. TAPSOFT, Vol.1 1991: 193-201 - Zhaohui Luo:
Program Specification and Data Refinement in Type Theory. TAPSOFT, Vol.1 1991: 143-168 - Elie Najm, Jean-Bernard Stefani:
Object-Based Concurrency: A Process Calculus Analysis. TAPSOFT, Vol.1 1991: 359-380 - Yolanda Ortega-Mallén, David de Frutos-Escrig
:
A Complete Proof System for Timed Observations. TAPSOFT, Vol.1 1991: 412-440 - K. V. S. Prasad:
A Calculus of Broadcasting Systems. TAPSOFT, Vol.1 1991: 338-358 - Michael I. Schwartzbach:
Type Inference with Inequalities. TAPSOFT, Vol.1 1991: 441-455 - Samson Abramsky, T. S. E. Maibaum:
TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'91). Lecture Notes in Computer Science 493, Springer 1991, ISBN 3-540-53982-4 [contents]
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-08-26 07:18 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