Остановите войну!
for scientists:
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 139 matches
- 2001
- Martín Abadi, Jan Jürjens:
Formal Eavesdropping and Its Computational Interpretation. TACS 2001: 82-94 - Anindya Banerjee, Nevin Heintze, Jon G. Riecke:
Design and Correctness of Program Transformations Based on Control-Flow Analysis. TACS 2001: 420-447 - Lennart Beringer:
Typing Assembly Programs with Explicit Forwarding. TACS 2001: 514-534 - Marcello M. Bonsangue, Joost N. Kok:
Infinite Intersection and Union Types for the Lazy Lambda Calculus. TACS 2001: 448-458 - Michele Bugliesi, Giuseppe Castagna, Silvia Crafa:
Boxed Ambients. TACS 2001: 38-63 - Luís Caires, Luca Cardelli:
A Spatial Logic for Concurrency. TACS 2001: 1-37 - Javier Esparza, Antonín Kucera, Stefan Schwoon:
Model-Checking LTL with Regular Valuations for Pushdown Systems. TACS 2001: 316-339 - Martin Fränzle:
What Will Be Eventually True of Polynomial Hybrid Automata? TACS 2001: 340-359 - Didier Galmiche, Daniel Méry:
Proof-Search and Countermodel Generation in Propositional BI Logic. TACS 2001: 263-282 - Makoto Hamana:
A Logic Programming Language Based on Binding Algebras. TACS 2001: 243-262 - Daisuke Hoshina, Eijiro Sumii, Akinori Yonezawa:
A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation. TACS 2001: 64-81 - Daniel Jackson, Alan D. Fekete:
Lightweight Analysis of Object Interactions. TACS 2001: 492-513 - Barbara König, Ugo Montanari:
Observational Equivalence for Synchronized Graph Rewriting with Mobility. TACS 2001: 145-164 - Cosimo Laneve, Joachim Parrow, Björn Victor:
Solo Diagrams. TACS 2001: 127-144 - Daniel Leivant:
Termination Proofs and Complexity Certification. TACS 2001: 183-200 - Keye Martin:
A Renee Equation for Algorithmic Complexity. TACS 2001: 201-218 - Hiroshi Nakano:
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness. TACS 2001: 165-182 - Joachim Niehren, Tim Priesnitz:
Non-structural Subtype Entailment in Automata Theory. TACS 2001: 360-384 - Mizuhito Ogawa:
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders. TACS 2001: 283-297 - Christine Paulin-Mohring:
Modelisation of Timed Automata in Coq. TACS 2001: 298-315 - Benjamin C. Pierce, Jerome Vouillon:
Unison: A File Synchronizer and Its Specification. TACS 2001: 560 - Andrew M. Pitts:
Nominal Logic: A First Order Theory of Names and Binding. TACS 2001: 219-242 - Antti Puhakka:
Weakest Congruence Results Concerning "Any-Lock". TACS 2001: 400-419 - Philippe Schnoebelen:
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. TACS 2001: 385-399 - Andrei Serjantov, Peter Sewell, Keith Wansbrough:
The UDP Calculus: Rigorous Semantics for Real Networking. TACS 2001: 535-559 - Kazunori Ueda:
Resource-Passing Concurrent Programming. TACS 2001: 95-126 - Philip Wadler:
The Girard-Reynolds Isomorphism. TACS 2001: 468-491 - Yoriyuki Yamagata:
Strong Normalization of Second Order Symmetric Lambda-mu Calculus. TACS 2001: 459-467 - Naoki Kobayashi, Benjamin C. Pierce:
Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings. Lecture Notes in Computer Science 2215, Springer 2001, ISBN 3-540-42736-8 [contents] - 1997
- Martín Abadi:
Secrecy by Typing inSecurity Protocols. TACS 1997: 611-638
skipping 109 more matches
loading more results
failed to load more results, please try again later
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-05-07 13:02 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