Search results for "SAS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
32	Dino Distefano	A Voyage to the Deep-Heap.	SAS	2012	DBLP DOI BibTeX RDF
32	Michael Emmi, Akash Lal	Finding Non-terminating Executions in Distributed Asynchronous Programs.	SAS	2012	DBLP DOI BibTeX RDF
32	Shriram Krishnamurthi	Semantics and Analyses for JavaScript and the Web.	SAS	2012	DBLP DOI BibTeX RDF
32	Hong Yi Chen, Shaked Flur, Supratik Mukhopadhyay	Termination Proofs for Linear Simple Loops.	SAS	2012	DBLP DOI BibTeX RDF
32	Eric Goubault, Sylvie Putot, Franck Védrine	Modular Static Analysis with Zonotopes.	SAS	2012	DBLP DOI BibTeX RDF
32	Jan Midtgaard, Michael D. Adams 0001, Matthew Might	A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections.	SAS	2012	DBLP DOI BibTeX RDF
32	Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas, Andrew E. Santosa	Path-Sensitive Backward Slicing.	SAS	2012	DBLP DOI BibTeX RDF
32	Aws Albarghouthi, Arie Gurfinkel, Marsha Chechik	Craig Interpretation.	SAS	2012	DBLP DOI BibTeX RDF
32	Aditya V. Thakur, Thomas W. Reps	A Generalization of Stålmarck's Method.	SAS	2012	DBLP DOI BibTeX RDF
32	Vijay Victor D'Silva, Leopold Haller, Daniel Kroening	Satisfiability Solvers Are Static Analysers.	SAS	2012	DBLP DOI BibTeX RDF
32	Jonathan K. Lee, Jens Palsberg, Rupak Majumdar, Hong Hong	Efficient May Happen in Parallel Analysis for Async-Finish Parallelism.	SAS	2012	DBLP DOI BibTeX RDF
32	Arnault Ioualalen, Matthieu Martel	A New Abstract Domain for the Representation of Mathematically Equivalent Expressions.	SAS	2012	DBLP DOI BibTeX RDF
32	Ruslán Ledesma-Garza, Andrey Rybalchenko	Binary Reachability Analysis of Higher Order Functional Programs.	SAS	2012	DBLP DOI BibTeX RDF
32	Uday P. Khedker, Alan Mycroft, Prashant Singh Rawat	Liveness-Based Pointer Analysis.	SAS	2012	DBLP DOI BibTeX RDF
32	Dimitra Giannakopoulou, Zvonimir Rakamaric, Vishwanath Raman	Symbolic Learning of Component Interfaces.	SAS	2012	DBLP DOI BibTeX RDF
32	Gilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin	Computer-Aided Cryptographic Proofs.	SAS	2012	DBLP DOI BibTeX RDF
32	Roberto Giacobazzi, Isabella Mastroeni	Making Abstract Interpretation Incomplete: Modeling the Potency of Obfuscation.	SAS	2012	DBLP DOI BibTeX RDF
32	Julien Henry, David Monniaux, Matthieu Moy	Succinct Representations for Abstract Interpretation - Combined Analysis Algorithms and Experimental Evaluation.	SAS	2012	DBLP DOI BibTeX RDF
32	Jacob M. Howe, Andy King	Polyhedral Analysis Using Parametric Objectives.	SAS	2012	DBLP DOI BibTeX RDF
32	Sebastian Biallas, Jörg Brauer, Andy King, Stefan Kowalewski	Loop Leaping with Closures.	SAS	2012	DBLP DOI BibTeX RDF
32	Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen 0001, Carl Leonardsson, Ahmed Rezine	Automatic Fence Insertion in Integer Programs via Predicate Abstraction.	SAS	2012	DBLP DOI BibTeX RDF
32	Nicolas Halbwachs, Julien Henry	When the Decreasing Sequence Fails.	SAS	2012	DBLP DOI BibTeX RDF
32	Eran Yahav (eds.)	Static Analysis - 18th International Symposium, SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings	SAS	2011	DBLP DOI BibTeX RDF
32	Guy Avni, Orna Kupferman	An Abstraction-Refinement Framework for Trigger Querying.	SAS	2011	DBLP DOI BibTeX RDF
32	Kenneth L. McMillan	Widening and Interpolation.	SAS	2011	DBLP DOI BibTeX RDF
32	Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn	The Complexity of Abduction for Separated Heap Abstractions.	SAS	2011	DBLP DOI BibTeX RDF
32	Ravichandhran Madhavan, Ganesan Ramalingam, Kapil Vaswani	Purity Analysis: An Abstract Interpretation Formulation.	SAS	2011	DBLP DOI BibTeX RDF
32	Alastair F. Donaldson, Leopold Haller, Daniel Kroening, Philipp Rümmer	Software Verification Using k-Induction.	SAS	2011	DBLP DOI BibTeX RDF
32	Matt Elder, Junghee Lim, Tushar Sharma, Tycho Andersen, Thomas W. Reps	Abstract Domains of Affine Relations.	SAS	2011	DBLP DOI BibTeX RDF
32	Ahmed Bouajjani, Michael Emmi, Gennaro Parlato	On Sequentializing Concurrent Programs.	SAS	2011	DBLP DOI BibTeX RDF
32	P. Madhusudan, Xiaokang Qiu	Efficient Decision Procedures for Heaps Using STRAND.	SAS	2011	DBLP DOI BibTeX RDF
32	Philippe Suter, Ali Sinan Köksal, Viktor Kuncak	Satisfiability Modulo Recursive Programs.	SAS	2011	DBLP DOI BibTeX RDF
32	Daniel Kästner	Astrée: Design and Experience.	SAS	2011	DBLP DOI BibTeX RDF
32	Javier Esparza, Andreas Gaiser	Probabilistic Abstractions with Arbitrary Domains.	SAS	2011	DBLP DOI BibTeX RDF
32	Sam Blackshear, Bor-Yuh Evan Chang, Sriram Sankaranarayanan 0001, Manu Sridharan	The Flow-Insensitive Precision of Andersen's Analysis in Practice.	SAS	2011	DBLP DOI BibTeX RDF
32	Kenneth L. McMillan, Lenore D. Zuck	Invisible Invariants and Abstract Interpretation.	SAS	2011	DBLP DOI BibTeX RDF
32	Peter Schrammel, Bertrand Jeannet	Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs.	SAS	2011	DBLP DOI BibTeX RDF
32	Andrea Flexeder, Michael Petter, Helmut Seidl	Side-Effect Analysis of Assembly Code.	SAS	2011	DBLP DOI BibTeX RDF
32	Florian Zuleger, Sumit Gulwani, Moritz Sinn, Helmut Veith	Bound Analysis of Imperative Programs with the Size-Change Abstraction.	SAS	2011	DBLP DOI BibTeX RDF
32	John C. Mitchell	Program Analysis for Web Security.	SAS	2011	DBLP DOI BibTeX RDF
32	Sasa Misailovic, Daniel M. Roy 0001, Martin C. Rinard	Probabilistically Accurate Program Transformations.	SAS	2011	DBLP DOI BibTeX RDF
32	David Monniaux, Laure Gonnord	Using Bounded Model Checking to Focus Fixpoint Iterations.	SAS	2011	DBLP DOI BibTeX RDF
32	Jeff Huang 0001, Charles Zhang 0001	An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs.	SAS	2011	DBLP DOI BibTeX RDF
32	Matthew Might, David Van Horn	A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs.	SAS	2011	DBLP DOI BibTeX RDF
32	Aditya V. Nori, Sriram K. Rajamani	Program Analysis and Machine Learning: A Win-Win Deal.	SAS	2011	DBLP DOI BibTeX RDF
32	Jérôme Feret	Formal Model Reduction.	SAS	2011	DBLP DOI BibTeX RDF
32	Patrice Godefroid, Shuvendu K. Lahiri, Cindy Rubio-González	Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation.	SAS	2011	DBLP DOI BibTeX RDF
32	Viktor Vafeiadis, Francesco Zappa Nardelli	Verifying Fence Elimination Optimisations.	SAS	2011	DBLP DOI BibTeX RDF
32	Sven Verdoolaege, Albert Cohen 0001, Anna Beletska	Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations.	SAS	2011	DBLP DOI BibTeX RDF
32	Kin-Keung Ma, Yit Phang Khoo, Jeffrey S. Foster, Michael Hicks 0001	Directed Symbolic Execution.	SAS	2011	DBLP DOI BibTeX RDF
32	Radhia Cousot, Matthieu Martel (eds.)	Static Analysis - 17th International Symposium, SAS 2010, Perpignan, France, September 14-16, 2010. Proceedings	SAS	2010	DBLP DOI BibTeX RDF
32	Mila Dalla Preda, Roberto Giacobazzi, Saumya K. Debray, Kevin Coogan, Gregg M. Townsend	Modelling Metamorphism by Abstract Interpretation.	SAS	2010	DBLP DOI BibTeX RDF
32	David Lesens	Using Static Analysis in Space: Why Doing so?	SAS	2010	DBLP DOI BibTeX RDF
32	E. Allen Emerson	Time of Time.	SAS	2010	DBLP DOI BibTeX RDF
32	Jörg Brauer, Andy King	Automatic Abstraction for Intervals Using Boolean Formulae.	SAS	2010	DBLP DOI BibTeX RDF
32	Gianluca Amato, Maurizio Parton, Francesca Scozzari	Deriving Numerical Abstract Domains via Principal Component Analysis.	SAS	2010	DBLP DOI BibTeX RDF
32	Renato Cherini, Lucas Rearte, Javier O. Blanco	A Shape Analysis for Non-linear Data Structures.	SAS	2010	DBLP DOI BibTeX RDF
32	Alexander Malkis, Andreas Podelski, Andrey Rybalchenko	Thread-Modular Counterexample-Guided Abstraction Refinement.	SAS	2010	DBLP DOI BibTeX RDF
32	Christian J. Bell, Andrew W. Appel, David Walker 0001	Concurrent Separation Logic for Pipelined Parallelization.	SAS	2010	DBLP DOI BibTeX RDF
32	Benjamin Goldberg	Translation Validation of Loop Optimizations and Software Pipelining in the TVOC Framework - In Memory of Amir Pnueli.	SAS	2010	DBLP DOI BibTeX RDF
32	Thomas Martin Gawlitza, Helmut Seidl	Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely.	SAS	2010	DBLP DOI BibTeX RDF
32	Christophe Alias, Alain Darte, Paul Feautrier, Laure Gonnord	Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs.	SAS	2010	DBLP DOI BibTeX RDF
32	Martin T. Vechev, Eran Yahav, Raghavan Raman, Vivek Sarkar	Automatic Verification of Determinism for Structured Parallel Programs.	SAS	2010	DBLP DOI BibTeX RDF
32	Nadir Matringe, Arnaldo Vieira Moura, Rachid Rebiha	Generating Invariants for Non-linear Hybrid Systems by Linear Algebraic Methods.	SAS	2010	DBLP DOI BibTeX RDF
32	Isil Dillig, Thomas Dillig, Alex Aiken	Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis.	SAS	2010	DBLP DOI BibTeX RDF
32	Simon Holm Jensen, Anders Møller, Peter Thiemann 0001	Interprocedural Analysis with Lazy Propagation.	SAS	2010	DBLP DOI BibTeX RDF
32	Manuel Fähndrich	Static Verification for Code Contracts.	SAS	2010	DBLP DOI BibTeX RDF
32	Alexandre Chapoutot	Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables.	SAS	2010	DBLP DOI BibTeX RDF
32	Martin Hofmann 0001, Aleksandr Karbyshev, Helmut Seidl	Verifying a Local Generic Solver in Coq.	SAS	2010	DBLP DOI BibTeX RDF
32	Rupesh Nasre, Ramaswamy Govindarajan	Points-to Analysis as a System of Linear Equations.	SAS	2010	DBLP DOI BibTeX RDF
32	Joost-Pieter Katoen, Annabelle McIver, Larissa Meinicke, Carroll C. Morgan	Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods.	SAS	2010	DBLP DOI BibTeX RDF
32	Tom Schrijvers, Alan Mycroft	Strictness Meets Data Flow.	SAS	2010	DBLP DOI BibTeX RDF
32	Matthias Heizmann, Neil D. Jones, Andreas Podelski	Size-Change Termination and Transition Invariants.	SAS	2010	DBLP DOI BibTeX RDF
32	Arie Gurfinkel, Sagar Chaki	Boxes: A Symbolic Abstract Domain of Boxes.	SAS	2010	DBLP DOI BibTeX RDF
32	Bill McCloskey, Thomas W. Reps, Mooly Sagiv	Statically Inferring Complex Heap, Array, and Numeric Invariants.	SAS	2010	DBLP DOI BibTeX RDF
32	William R. Harris, Akash Lal, Aditya V. Nori, Sriram K. Rajamani	Alternation for Termination.	SAS	2010	DBLP DOI BibTeX RDF
32	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.	SAS	2010	DBLP DOI BibTeX RDF
32	Matthew Might	Abstract Interpreters for Free.	SAS	2010	DBLP DOI BibTeX RDF
32	Azadeh Farzan, Zachary Kincaid	Compositional Bitvector Analysis for Concurrent Programs with Nested Locks.	SAS	2010	DBLP DOI BibTeX RDF
32	Jens Palsberg, Zhendong Su 0001 (eds.)	Static Analysis, 16th International Symposium, SAS 2009, Los Angeles, CA, USA, August 9-11, 2009. Proceedings	SAS	2009	DBLP DOI BibTeX RDF
32	Olivier Bouissou	Proving the Correctness of the Implementation of a Control-Command Algorithm.	SAS	2009	DBLP DOI BibTeX RDF
32	Songtao Xia, Manuel Fähndrich, Francesco Logozzo	Inferring Dataflow Properties of User Defined Table Processors.	SAS	2009	DBLP DOI BibTeX RDF
32	Liqian Chen, Antoine Miné, Ji Wang 0001, Patrick Cousot	Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships.	SAS	2009	DBLP DOI BibTeX RDF
32	Luke Simon	Optimizing Pointer Analysis Using Bisimilarity.	SAS	2009	DBLP DOI BibTeX RDF
32	David A. Schmidt	Abstract Interpretation from a Topological Perspective.	SAS	2009	DBLP DOI BibTeX RDF
32	Clément Hurlin	Automatic Parallelization and Optimization of Programs by Proof Rewriting.	SAS	2009	DBLP DOI BibTeX RDF
32	Mohamed Nassim Seghir, Andreas Podelski, Thomas Wies	Abstraction Refinement for Quantified Array Assertions.	SAS	2009	DBLP DOI BibTeX RDF
32	Kyung-Goo Doh, Hyunha Kim, David A. Schmidt	Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology.	SAS	2009	DBLP DOI BibTeX RDF
32	Martin Wehrle, Malte Helmert	The Causal Graph Revisited for Directed Model Checking.	SAS	2009	DBLP DOI BibTeX RDF
32	Shaz Qadeer	Algorithmic Verification of Systems Software Using SMT Solvers.	SAS	2009	DBLP DOI BibTeX RDF
32	Stephen Drape, Irina Voiculescu	Creating Transformations for Matrix Obfuscation.	SAS	2009	DBLP DOI BibTeX RDF	Program Transformations, Information Hiding, Obfuscation, Matrix Operations
32	Manu Sridharan, Stephen J. Fink	The Complexity of Andersen's Analysis in Practice.	SAS	2009	DBLP DOI BibTeX RDF
32	Silvian Calman, Jianwen Zhu	Increasing the Scope and Resolution of Interprocedural Static Single Assignment.	SAS	2009	DBLP DOI BibTeX RDF	dataflow, constant propagation, SSA, interprocedural
32	Daniel Grund, Jan Reineke 0001	Abstract Interpretation of FIFO Replacement.	SAS	2009	DBLP DOI BibTeX RDF	FIFO Replacement, Domain Cooperation, May/Must Reasoning, Cache Analysis
32	Bhargav S. Gulavani, Supratik Chakraborty, Ganesan Ramalingam, Aditya V. Nori	Bottom-Up Shape Analysis.	SAS	2009	DBLP DOI BibTeX RDF
32	Rastislav Bodík	Algorithmic Program Synthesis with Partial Programs and Decision Procedures.	SAS	2009	DBLP DOI BibTeX RDF
32	Andrei Voronkov, Iman Narasamdya	Inter-program Properties.	SAS	2009	DBLP DOI BibTeX RDF	assertion function, invariant, translation validation
32	Hirotoshi Yasuoka, Tachio Terauchi	Polymorphic Fractional Capabilities.	SAS	2009	DBLP DOI BibTeX RDF
32	David Niedzielski, Jeffery von Ronne, Andreas Gampe, Kleanthis Psarris	A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination.	SAS	2009	DBLP DOI BibTeX RDF
32	Matthias Heizmann, Jochen Hoenicke, Andreas Podelski	Refinement of Trace Abstraction.	SAS	2009	DBLP DOI BibTeX RDF