Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15. SAS 2008: Valencia, Spain
- María Alpuente
, Germán Vidal:
Static Analysis, 15th International Symposium, SAS 2008, Valencia, Spain, July 16-18, 2008. Proceedings. Lecture Notes in Computer Science 5079, Springer 2008, ISBN 978-3-540-69163-1
Invited Papers
- Roberto Giacobazzi, Isabella Mastroeni:
Transforming Abstract Interpretations by Abstract Interpretation. 1-17 - Ben Liblit:
Reflections on the Role of Static Analysis in Cooperative Bug Isolation. 18-31
Contributed Papers
- Jörg Bauer, Flemming Nielson, Hanne Riis Nielson, Henrik Pilegaard:
Relational Analysis of Correlation. 32-46 - Jérôme Leroux:
Convex Hull of Arithmetic Automata. 47-61 - Christopher L. Conway, Dennis Dams, Kedar S. Namjoshi, Clark W. Barrett:
Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors. 62-77 - Murali Krishna Ramanathan, Koushik Sen, Ananth Grama, Suresh Jagannathan:
Protocol Inference Using Static Path Profiles. 78-92 - Akash Lal, Thomas W. Reps:
Solving Multiple Dataflow Queries Using WPDSs. 93-109 - Prakash Prabhu, Priti Shankar:
Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA. 110-127 - Salvatore Ruggieri, Frédéric Mesnard:
Typing Linear Constraints for Moding CLP() Programs. 128-143 - Marco Comini, Ferruccio Damiani, Samuel Vrech:
On Polymorphic Recursion, Type Systems, and Abstract Interpretation. 144-158 - Sebastian Nanz, Flemming Nielson, Hanne Riis Nielson:
Modal Abstractions of Concurrent Behaviour. 159-173 - Mila Dalla Preda, Roberto Giacobazzi, Enrico Visentini:
Hiding Software Watermarks in Loop Structures. 174-188 - Xavier Allamigeon, Stephane Gaubert, Eric Goubault:
Inferring Min and Max Invariants Using Max-Plus Polyhedra. 189-204 - Peter Lammich, Markus Müller-Olm:
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors. 205-220 - Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla:
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. 221-237 - Gogul Balakrishnan, Sriram Sankaranarayanan, Franjo Ivancic, Ou Wei, Aarti Gupta:
SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement. 238-254 - David Van Horn, Harry G. Mairson:
Flow Analysis, Linearity, and PTIME. 255-269 - Simon Perdrix:
Quantum Entanglement Analysis Based on Abstract Interpretation. 270-282 - Nicholas Kidd, Akash Lal, Thomas W. Reps:
Language Strength Reduction. 283-298 - Helmut Seidl, Andrea Flexeder, Michael Petter:
Analysing All Polynomial Equations in . 299-314 - Axel Simon:
Splitting the Control Flow with Boolean Flags. 315-331 - Frances Perry, David Walker:
Reasoning about Control Flow in the Presence of Transient Faults. 332-346 - Jan Midtgaard, Thomas P. Jensen:
A Calculational Approach to Control-Flow Analysis by Abstract Interpretation. 347-362 - Roman Manevich, Tal Lev-Ami, Mooly Sagiv, Ganesan Ramalingam, Josh Berdine:
Heap Decomposition for Concurrent Shape Analysis. 363-377
a service of 
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 2024-04-22 20:01 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:
