default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19. SAS 2012: Deauville, France
- Antoine Miné, David Schmidt:
Static Analysis - 19th International Symposium, SAS 2012, Deauville, France, September 11-13, 2012. Proceedings. Lecture Notes in Computer Science 7460, Springer 2012, ISBN 978-3-642-33124-4
Invited Talks
- Gilles Barthe, Benjamin Grégoire, Santiago Zanella-Béguelin
:
Computer-Aided Cryptographic Proofs. 1-2 - Dino Distefano:
A Voyage to the Deep-Heap. 3 - Shriram Krishnamurthi:
Semantics and Analyses for JavaScript and the Web. 4 - Jonathan K. Lee, Jens Palsberg, Rupak Majumdar, Hong Hong:
Efficient May Happen in Parallel Analysis for Async-Finish Parallelism. 5-23
Contributed Papers
- Eric Goubault, Sylvie Putot, Franck Védrine:
Modular Static Analysis with Zonotopes. 24-40 - Jacob M. Howe, Andy King:
Polyhedral Analysis Using Parametric Objectives. 41-57 - David Cachera, Thomas P. Jensen, Arnaud Jobin, Florent Kirchner:
Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases. 58-74 - Arnault Ioualalen, Matthieu Martel:
A New Abstract Domain for the Representation of Mathematically Equivalent Expressions. 75-93 - Tie Cheng, Xavier Rival:
An Abstract Domain to Infer Types over Zones in Spreadsheets. 94-110 - Aditya V. Thakur, Matt Elder, Thomas W. Reps:
Bilateral Algorithms for Symbolic Abstraction. 111-128 - Roberto Giacobazzi, Isabella Mastroeni:
Making Abstract Interpretation Incomplete: Modeling the Potency of Obfuscation. 129-145 - Alejandro Sánchez, Sriram Sankaranarayanan, César Sánchez, Bor-Yuh Evan Chang:
Invariant Generation for Parametrized Systems Using Self-reflection - (Extended Version). 146-163 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Carl Leonardsson, Ahmed Rezine:
Automatic Fence Insertion in Integer Programs via Predicate Abstraction. 164-180 - Peter Calvert, Alan Mycroft:
Control Flow Analysis for the Join Calculus. 181-197 - Nicolas Halbwachs, Julien Henry:
When the Decreasing Sequence Fails. 198-213 - Sebastian Biallas, Jörg Brauer, Andy King, Stefan Kowalewski:
Loop Leaping with Closures. 214-230 - Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas, Andrew E. Santosa:
Path-Sensitive Backward Slicing. 231-247 - Dimitra Giannakopoulou, Zvonimir Rakamaric, Vishwanath Raman:
Symbolic Learning of Component Interfaces. 248-264 - Uday P. Khedker, Alan Mycroft, Prashant Singh Rawat:
Liveness-Based Pointer Analysis. 265-282 - Julien Henry, David Monniaux, Matthieu Moy:
Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental Evaluation. 283-299 - Aws Albarghouthi, Arie Gurfinkel, Marsha Chechik:
Craig Interpretation. 300-316 - Vijay Victor D'Silva, Leopold Haller, Daniel Kroening:
Satisfiability Solvers Are Static Analysers. 317-333 - Aditya V. Thakur, Thomas W. Reps:
A Generalization of Stålmarck's Method. 334-351 - Jan Midtgaard, Michael D. Adams, Matthew Might:
A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections. 352-369 - Ravichandhran Madhavan, G. Ramalingam, Kapil Vaswani:
Modular Heap Analysis for Higher-Order Programs. 370-387 - Ruslán Ledesma-Garza, Andrey Rybalchenko:
Binary Reachability Analysis of Higher Order Functional Programs. 388-404 - Diego Esteban Alonso-Blas, Samir Genaim:
On the Limits of the Classical Approach to Cost Analysis. 405-421 - Hong Yi Chen, Shaked Flur, Supratik Mukhopadhyay:
Termination Proofs for Linear Simple Loops. 422-438 - Michael Emmi, Akash Lal:
Finding Non-terminating Executions in Distributed Asynchronous Programs. 439-455
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-05-05 20:58 CEST 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:
