![](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 28 matches
- 2011
- Elvira Albert, Puri Arenas, Samir Genaim
, Miguel Gómez-Zamalloa
, German Puebla:
Cost Analysis of Concurrent OO Programs. APLAS 2011: 238-254 - Jade Alglave, Daniel Kroening
, John Lugton, Vincent Nimal, Michael Tautschnig:
Soundness of Data Flow Analyses for Weak Memory Models. APLAS 2011: 272-288 - Patrick Baillot:
Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. APLAS 2011: 337-352 - Nikolaj S. Bjørner:
Engineering Theories with Z3. APLAS 2011: 4-16 - Benoit Boissinot, Florian Brandner
, Alain Darte, Benoît Dupont de Dinechin, Fabrice Rastello:
A Non-iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs. APLAS 2011: 137-154 - Filippo Bonchi
, Fabio Gadducci
, Giacoma Valentina Monreale:
Towards a General Theory of Barbs, Contexts and Labels. APLAS 2011: 289-304 - Zhen Cao, Yuan Dong, Shengyuan Wang:
Compiler Backend Generation for Application Specific Instruction Set Processors. APLAS 2011: 121-136 - Yun-Yan Chi, Shin-Cheng Mu
:
Constructing List Homomorphisms from Proofs. APLAS 2011: 74-88 - Thao Dang, Thomas Martin Gawlitza:
Template-Based Unbounded Time Verification of Affine Hybrid Automata. APLAS 2011: 34-49 - Lukasz Fronc, Franck Pommereau:
Towards a Certified Petri Net Model-Checker. APLAS 2011: 322-336 - Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko:
Solving Recursion-Free Horn Clauses over LI+UIF. APLAS 2011: 188-203 - Ranjit Jhala:
Software Verification with Liquid Types. APLAS 2011: 3 - Casey Klein, Jay A. McCarthy, Steven Jaconette, Robert Bruce Findler:
A Semantics for Context-Sensitive Reduction Semantics. APLAS 2011: 369-383 - Yuichiro Kokaji, Yukiyoshi Kameyama:
Polymorphic Multi-stage Language with Control Effects. APLAS 2011: 105-120 - Jonas Magazinius, Aslan Askarov, Andrei Sabelfeld:
Decentralized Delimited Release. APLAS 2011: 220-237 - Alexander Malkis
, Laurent Mauborgne:
On the Strength of Owicki-Gries for Resources. APLAS 2011: 172-187 - Ana L. Milanova, Wei Huang:
Static Object Race Detection. APLAS 2011: 255-271 - David Monniaux
, Martin Bodin
:
Modular Abstractions of Reactive Nodes Using Disjunctive Invariants. APLAS 2011: 19-33 - Akimasa Morihata
:
Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism. APLAS 2011: 204-219 - Keiko Nakata, Tarmo Uustalu
, Marc Bezem:
A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. APLAS 2011: 353-368 - Aditya V. Nori, Sriram K. Rajamani:
Program Analysis and Machine Learning: A Win-Win Deal. APLAS 2011: 1-2 - Peter W. O'Hearn:
Algebra, Logic, Locality, Concurrency. APLAS 2011: 17-18 - Hakjoo Oh, Kwangkeun Yi:
Access-Based Localization with Bypassing. APLAS 2011: 50-65 - Fernando Sáenz-Pérez
, Rafael Caballero
, Yolanda García-Ruiz:
A Deductive Database with Datalog and SQL Query Languages. APLAS 2011: 66-73 - Ulrich Schöpp
:
Computation-by-Interaction with Effects. APLAS 2011: 305-321 - Yulei Sui
, Sen Ye, Jingling Xue
, Pen-Chung Yew
:
SPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA. APLAS 2011: 155-171 - Dmitriy Traytel
, Stefan Berghofer, Tobias Nipkow
:
Extending Hindley-Milner Type Inference with Coercive Structural Subtyping. APLAS 2011: 89-104 - Hongseok Yang:
Programming Languages and Systems - 9th Asian Symposium, APLAS 2011, Kenting, Taiwan, December 5-7, 2011. Proceedings. Lecture Notes in Computer Science 7078, Springer 2011, ISBN 978-3-642-25317-1 [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-31 16:10 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