default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17. SAS 2010: Perpignan, France
- Radhia Cousot, Matthieu Martel:
Static Analysis - 17th International Symposium, SAS 2010, Perpignan, France, September 14-16, 2010. Proceedings. Lecture Notes in Computer Science 6337, Springer 2010, ISBN 978-3-642-15768-4 - E. Allen Emerson:
Time of Time. 1 - Manuel Fähndrich:
Static Verification for Code Contracts. 2-5 - Benjamin Goldberg:
Translation Validation of Loop Optimizations and Software Pipelining in the TVOC Framework - In Memory of Amir Pnueli. 6-21 - Matthias Heizmann
, Neil D. Jones, Andreas Podelski:
Size-Change Termination and Transition Invariants. 22-50 - David Lesens:
Using Static Analysis in Space: Why Doing so? 51-70 - Bill McCloskey, Thomas W. Reps, Mooly Sagiv:
Statically Inferring Complex Heap, Array, and Numeric Invariants. 71-99 - Elvira Albert, Puri Arenas, Samir Genaim, German Puebla, Diana V. Ramírez-Deantes:
From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis. 100-116 - Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord:
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs. 117-133 - Gianluca Amato, Maurizio Parton, Francesca Scozzari:
Deriving Numerical Abstract Domains via Principal Component Analysis. 134-150 - Christian J. Bell, Andrew W. Appel, David Walker:
Concurrent Separation Logic for Pipelined Parallelization. 151-166 - Jörg Brauer, Andy King:
Automatic Abstraction for Intervals Using Boolean Formulae. 167-183 - Alexandre Chapoutot:
Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables. 184-200 - Renato Cherini, Lucas Rearte, Javier O. Blanco:
A Shape Analysis for Non-linear Data Structures. 201-217 - Mila Dalla Preda, Roberto Giacobazzi, Saumya K. Debray, Kevin Coogan, Gregg M. Townsend:
Modelling Metamorphism by Abstract Interpretation. 218-235 - Isil Dillig, Thomas Dillig, Alex Aiken:
Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis. 236-252 - Azadeh Farzan, Zachary Kincaid:
Compositional Bitvector Analysis for Concurrent Programs with Nested Locks. 253-270 - Thomas Martin Gawlitza, Helmut Seidl:
Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely. 271-286 - Arie Gurfinkel, Sagar Chaki:
Boxes: A Symbolic Abstract Domain of Boxes. 287-303 - William R. Harris, Akash Lal, Aditya V. Nori, Sriram K. Rajamani:
Alternation for Termination. 304-319 - Simon Holm Jensen, Anders Møller, Peter Thiemann:
Interprocedural Analysis with Lazy Propagation. 320-339 - Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl:
Verifying a Local Generic Solver in Coq. 340-355 - Alexander Malkis, Andreas Podelski, Andrey Rybalchenko:
Thread-Modular Counterexample-Guided Abstraction Refinement. 356-372 - Nadir Matringe, Arnaldo Vieira Moura, Rachid Rebiha:
Generating Invariants for Non-linear Hybrid Systems by Linear Algebraic Methods. 373-389 - Joost-Pieter Katoen, Annabelle McIver, Larissa Meinicke, Carroll C. Morgan:
Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods. 390-406 - Matthew Might:
Abstract Interpreters for Free. 407-421 - Rupesh Nasre, Ramaswamy Govindarajan:
Points-to Analysis as a System of Linear Equations. 422-438 - Tom Schrijvers, Alan Mycroft:
Strictness Meets Data Flow. 439-454 - Martin T. Vechev, Eran Yahav, Raghavan Raman, Vivek Sarkar:
Automatic Verification of Determinism for Structured Parallel Programs. 455-471
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-03-01 15:01 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:
