![](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 874 matches
- 2023
- Rosa Abbasi
, Eva Darulova
:
Modular Optimization-Based Roundoff Error Analysis of Floating-Point Programs. SAS 2023: 41-64 - Vincenzo Arceri
, Greta Dolcetti
, Enea Zaffanella
:
Unconstrained Variable Oracles for Faster Numeric Static Analyses. SAS 2023: 65-83 - Jérôme Boillot, Jérôme Feret:
Symbolic Transformation of Expressions in Modular Arithmetic. SAS 2023: 84-113 - Marco Campion
, Caterina Urban
, Mila Dalla Preda
, Roberto Giacobazzi
:
A Formal Framework to Measure the Incompleteness of Abstract Interpretations. SAS 2023: 114-138 - Shangtong Cao, Ningyu He, Yao Guo, Haoyu Wang:
BREWasm: A General Static Binary Rewriting Framework for WebAssembly. SAS 2023: 139-163 - Yanbin Chen
, Yannick Stade
:
Quantum Constant Propagation. SAS 2023: 164-189 - Loris D'Antoni:
Verifying Infinitely Many Programs at Once. SAS 2023: 3-9 - Aleksandar S. Dimovski
:
Error Invariants for Fault Localization via Abstract Interpretation. SAS 2023: 190-211 - Aleksandar S. Dimovski
:
Generalized Program Sketching by Abstract Interpretation and Logical Abduction. SAS 2023: 212-230 - Shuo Ding
, Qirun Zhang
:
Mutual Refinements of Context-Free Language Reachability. SAS 2023: 231-258 - Florian Frohn
, Jürgen Giesl
:
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses. SAS 2023: 259-285 - Roberto Giacobazzi, Isabella Mastroeni
, Elia Perantoni:
How Fitting is Your Abstract Domain? SAS 2023: 286-309 - Josselin Giet
, Félix Ridoux, Xavier Rival:
A Product of Shape and Sequence Abstractions. SAS 2023: 310-342 - Colin S. Gordon
, Chaewon Yun:
Error Localization for Sequential Effect Systems. SAS 2023: 343-370 - Anastasia Isychev
, Eva Darulova
:
Scaling up Roundoff Analysis of Functional Data Structure Programs. SAS 2023: 371-402 - Daniel Kästner, Reinhard Wilhelm, Christian Ferdinand:
Abstract Interpretation in Industry - Experience and Lessons Learned. SAS 2023: 10-27 - Matthieu Lemerre
:
Reverse Template Processing Using Abstract Interpretation. SAS 2023: 403-433 - Isabella Mastroeni
, Michele Pasqua
:
Domain Precision in Galois Connection-Less Abstract Interpretation. SAS 2023: 434-459 - Daniel Schoepe
, David Seekatz
, Ilina Stoilkovska
, Sandro Stucki
, Daniel Tattersall, Pauline Bolignano, Franco Raimondi
, Bor-Yuh Evan Chang
:
Lifting On-Demand Analysis to Higher-Order Languages. SAS 2023: 460-484 - Michael Schwarz
, Helmut Seidl
:
Octagons Revisited - Elegant Proofs and Simplified Algorithms. SAS 2023: 485-507 - Thomas Seed
, Chris Coppins
, Andy King
, Neil Evans:
Polynomial Analysis of Modular Arithmetic. SAS 2023: 508-539 - Gagandeep Singh
:
Building Trust and Safety in Artificial Intelligence with Abstract Interpretation. SAS 2023: 28-38 - Xuezhou Tang
, Ye Zheng
, Jiaxiang Liu
:
Boosting Multi-neuron Convex Relaxation for Neural Network Verification. SAS 2023: 540-563 - Manuel V. Hermenegildo
, José F. Morales
:
Static Analysis - 30th International Symposium, SAS 2023, Cascais, Portugal, October 22-24, 2023, Proceedings. Lecture Notes in Computer Science 14284, Springer 2023, ISBN 978-3-031-44244-5 [contents] - 2022
- Daneshvar Amrollahi
, Ezio Bartocci, George Kenison
, Laura Kovács, Marcel Moosbrugger, Miroslav Stankovic:
Solving Invariant Generation for Unsolvable Loops. SAS 2022: 19-43 - Aditya Anand
, Manas Thakur
:
Principles of Staged Static+Dynamic Partial Analysis. SAS 2022: 44-73 - Suguman Bansal:
Specification-Guided Reinforcement Learning. SAS 2022: 3-9 - Gilles Barthe, Adrien Koutsos, Solène Mirliaz, David Pichardie, Peter Schwabe:
Semantic Foundations for Cost Analysis of Pipeline-Optimized Programs. SAS 2022: 372-396 - Iulia Bastys, Maximilian Algehed, Alexander Sjösten, Andrei Sabelfeld:
SecWasm: Information Flow Control for WebAssembly. SAS 2022: 74-103 - Santiago Bautista
, Thomas P. Jensen
, Benoît Montagu
:
Lifting Numeric Relational Domains to Algebraic Data Types. SAS 2022: 104-134
skipping 844 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-02 12:00 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