Остановите войну!
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 121 matches
- 1985
- Martín Abadi, Zohar Manna:
Nonclausal Temporal Deduction. Logic of Programs 1985: 1-15 - Irina Bercovici:
Unsolvable Terms in Typed Lambda Calculus with Fixpoint Operators (Extended Abstract). Logic of Programs 1985: 16-22 - Val Breazu-Tannen, Albert R. Meyer:
Lambda Calculus with Constrained Types (Extended Abstract). Logic of Programs 1985: 23-40 - Stephen D. Brookes:
An Axiomatic Treatment of a Parallel Programming Language. Logic of Programs 1985: 41-60 - Robert L. Constable, Nax Paul Mendler:
Recursive Definitions in Type Theory. Logic of Programs 1985: 61-78 - E. Allen Emerson:
Automata, Tableaux and Temporal Logics (Extended Abstract). Logic of Programs 1985: 79-88 - Nissim Francez, Orna Grumberg, Shmuel Katz, Amir Pnueli:
Proving Termination of Prolog Programs. Logic of Programs 1985: 89-105 - Andreas Goerdt:
A Hoare Calculus for Functions Defined by Recursion on Higher Types. Logic of Programs 1985: 106-117 - Michal Grabowski:
On the Relative Incompleteness of Logics for Total Correctness. Logic of Programs 1985: 118-127 - Susanne Graf, Joseph Sifakis:
Frm Synchronization Tree Logic to Acceptance Model Logic. Logic of Programs 1985: 128-142 - Samuel N. Kamin:
A FASE Specification of FP. Logic of Programs 1985: 143-152 - Phokion G. Kolaitis:
On Asymptotic Probability of Inductive Queries and Their Decision Problem. Logic of Programs 1985: 153-166 - Ron Koymans, R. K. Shyamasundar, Willem P. de Roever, Rob Gerth, S. Arun-Kumar:
Compositional Semantics for Real-time Distributed Computing. Logic of Programs 1985: 167-189 - Daniel Leivant:
Partial-Correctness Theories as First-Order Theories. Logic of Programs 1985: 190-195 - Orna Lichtenstein, Amir Pnueli, Lenore D. Zuck:
The Glory of the Past. Logic of Programs 1985: 196-218 - Albert R. Meyer, Mitchell Wand:
Continuation Semantics in Typed Lambda-Calculi (Summary). Logic of Programs 1985: 219-224 - John C. Mitchell, Albert R. Meyer:
Second-Order Logical Relations (Extended Abstract). Logic of Programs 1985: 225-236 - Van Nguyen, Alan J. Demers, David Gries, Susan S. Owicki:
Behavior: A Temporal Approach to Process Modelling. Logic of Programs 1985: 237-254 - Michael J. O'Donnell:
Equational Logic as a Programming Language. Logic of Programs 1985: 255 - Rohit Parikh, Ramaswamy Ramanujam:
Distributed Processes and the Logic of Knowledge. Logic of Programs 1985: 256-268 - Vaughan R. Pratt:
Some Constructions for Order-Theoretic Models of Concurrency. Logic of Programs 1985: 269-283 - Ramaswamy Ramanujam, Kamal Lodaya:
Proving Fairness of Schedulers. Logic of Programs 1985: 284-301 - Ildikó Sain:
The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods. Logic of Programs 1985: 302-342 - Ann E. Kelley Sobel, Neelam Soundararajan:
A Proof System for Distributed Processes. Logic of Programs 1985: 343-358 - Robert S. Streett:
Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping. Logic of Programs 1985: 359-372 - Robert D. Tennent:
Semantical Analysis of Specification Logic. Logic of Programs 1985: 373-386 - Andrzej Trybulec, Howard A. Blair:
Computer Aider Reasoning. Logic of Programs 1985: 406-412 - Moshe Y. Vardi:
The Taming of Converse: Reasoning about Two-way Computations. Logic of Programs 1985: 413-423 - Rohit Parikh:
Logics of Programs, Conference, Brooklyn College, New York, NY, USA, June 17-19, 1985, Proceedings. Lecture Notes in Computer Science 193, Springer 1985, ISBN 3-540-15648-8 [contents] - 1984
- Edmund M. Clarke, Dexter Kozen:
Logics of Programs, Workshop, Carnegie Mellon University, Pittsburgh, PA, USA, June 6-8, 1983, Proceedings. Lecture Notes in Computer Science 164, Springer 1984, ISBN 3-540-12896-4 [contents]
skipping 91 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-14 21:30 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