default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th SAS 2017: New York, NY, USA
- Francesco Ranzato:
Static Analysis - 24th International Symposium, SAS 2017, New York, NY, USA, August 30 - September 1, 2017, Proceedings. Lecture Notes in Computer Science 10422, Springer 2017, ISBN 978-3-319-66705-8 - Aws Albarghouthi:
Probabilistic Horn Clause Verification. 1-22 - Alexey Bakhirkin, David Monniaux:
Combining Forward and Backward Abstract Interpretation of Horn Clauses. 23-45 - Ahmed Bouajjani, Constantin Enea, Shuvendu K. Lahiri:
Abstract Semantic Diffing of Evolving Concurrent Programs. 46-65 - Marc Brockschmidt, Yuxin Chen, Pushmeet Kohli, Siddharth Krishna
, Daniel Tarlow:
Learning Shape Analysis. 66-87 - Chaoqiang Deng, Kedar S. Namjoshi:
Securing the SSA Transform. 88-105 - Leandro Facchinetti, Zachary Palmer, Scott F. Smith:
Relative Store Fragments for Singleton Abstraction. 106-127 - Marius Greitschus, Daniel Dietsch, Andreas Podelski:
Loop Invariants from Counterexamples. 128-147 - Arie Gurfinkel, Jorge A. Navas:
A Context-Sensitive Memory Model for Verification of C/C++ Programs. 148-168 - Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff:
Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic. 169-191 - Colas Le Guernic:
Toward a Sound Analysis of Guarded LTI Loops with Inputs by Abstract Acceleration. 192-211 - Alexandre Maréchal, David Monniaux, Michaël Périn:
Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming. 212-231 - Isabella Mastroeni, Michele Pasqua:
Hyperhierarchy of Semantics - A Formal Framework for Hyperproperties Verification. 232-252 - Suvam Mukherjee, Oded Padon, Sharon Shoham, Deepak D'Souza, Noam Rinetzky:
Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs. 253-276 - Abdelraouf Ouadjaout, Antoine Miné:
Quantitative Static Analysis of Communication Protocols Using Abstract Markov Chains. 277-298 - Hernán Ponce de León, Florian Furbach, Keijo Heljanko, Roland Meyer:
Portability Analysis for Weak Memory Models. PORTHOS: One Tool for all Models. 299-320 - Sriram Sankaranarayanan, Mohamed Amin Ben Sassi:
Template Polyhedra with a Twist. 321-341 - Tushar Sharma, Thomas W. Reps:
A New Abstraction Framework for Affine Transformers. 342-363 - Sunbeom So, Hakjoo Oh:
Synthesizing Imperative Programs from Examples Guided by Static Analysis. 364-381 - Matías Toro, Éric Tanter:
A Gradual Interpretation of Union Types. 382-404 - Anna Trostanetski, Orna Grumberg, Daniel Kroening:
Modular Demand-Driven Analysis of Semantic Difference for Program Versions. 405-427 - Supratik Chakraborty, Ashutosh Gupta, Divyesh Unadkat:
Verifying Array Manipulating Programs by Tiling. 428-449 - Jieyuan Zhang, Yulei Sui, Jingling Xue:
Incremental Analysis for Probabilistic Programs. 450-472
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.
last updated on 2025-11-28 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
