Abstract is missing.
- Static Program Analysis via 3-Valued LogicThomas W. Reps. 1 [doi]
- Open Modeling in Multi-stakeholder Distributed Systems: Research and Tool ChallengesRobert J. Hall. 2 [doi]
- An Algebraic Approach to the Static Analysis of Concurrent SoftwareJavier Esparza. 3 [doi]
- Polynomial Constants Are DecidableMarkus Müller-Olm, Helmut Seidl. 4-19 [doi]
- Normalizable Horn Clauses, Strongly Recognizable Relations, and SpiFlemming Nielson, Hanne Riis Nielson, Helmut Seidl. 20-35 [doi]
- Nonuniform Alias Analysis of Recursive Data Structures and ArraysArnaud Venet. 36-51 [doi]
- Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous DatatypesBertrand Jeannet. 52-68 [doi]
- Automated Verification of Concurrent Linked Lists with CountersTuba Yavuz-Kahveci, Tevfik Bultan. 69-84 [doi]
- Backward Type Inference Generalises Type CheckingLunjin Lu, Andy King. 85-101 [doi]
- More Precise Yet Efficient Type Inference for Logic ProgramsClaudio Vaucheret, Francisco Bueno. 102-116 [doi]
- A Few Graph-Based Relational Numerical Abstract DomainsAntoine Miné. 117-132 [doi]
- Static Analysis of the Numerical Stability of LoopsMatthieu Martel. 133-150 [doi]
- On Termination of Logic Programs with Floating Point ComputationsAlexander Serebrenik, Danny De Schreye. 151-164 [doi]
- Modular Control Flow Analysis for LibrariesChristian W. Probst. 165-179 [doi]
- An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed LanguagesJohn Whaley, Monica S. Lam. 180-195 [doi]
- Compactly Representing First-Order Structures for Static AnalysisRoman Manevich, Ganesan Ramalingam, John Field, Deepak Goyal, Shmuel Sagiv. 196-212 [doi]
- Possibly Not Closed Convex Polyhedra and the Parma Polyhedra LibraryRoberto Bagnara, Elisa Ricci 0002, Enea Zaffanella, Patricia M. Hill. 213-229 [doi]
- Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer AnalysisStephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, Westley Weimer. 230-246 [doi]
- Improving the Precision of Equality-Based Dataflow AnalysesErik Ruf. 247-262 [doi]
- Guaranteed Optimization: Proving Nullspace Properties of CompilersTodd L. Veldhuizen, Andrew Lumsdaine. 263-277 [doi]
- Representation Analysis for Coercion PlacementKarl-Filip Faxén. 278-293 [doi]
- Pipeline Modeling for Timing AnalysisMarc Langenbach, Stephan Thesing, Reinhold Heckmann. 294-309 [doi]
- Analysing Approximate Confinement under Uniform AttacksAlessandra Di Pierro, Chris Hankin, Herbert Wiklicky. 310-325 [doi]
- An Improved Constraint-Based System for the Verification of Security ProtocolsRicardo Corin, Sandro Etalle. 326-341 [doi]
- From Secrecy to Authenticity in Security ProtocolsBruno Blanchet. 342-359 [doi]
- Security Typings by Abstract InterpretationMirko Zanotti. 360-375 [doi]
- Securing Communication in a Concurrent LanguageAndrei Sabelfeld, Heiko Mantel. 376-394 [doi]
- Refinement of LTL Formulas for Abstract Model CheckingMaría-del-Mar Gallardo, Pedro Merino, Ernesto Pimentel. 395-410 [doi]
- Making Abstract Model Checking Strongly PreservingFrancesco Ranzato, Francesco Tapparo. 411-427 [doi]
- Semantics for Abstract Interpretation-Based Static Analyzes of Temporal PropertiesDamien Massé. 428-443 [doi]
- Checking Safety Properties of Behavioral VHDL Descriptions by Abstract InterpretationCharles Hymans. 444-460 [doi]
- States vs. Traces in Model Checking by Abstract InterpretationRoberto Giacobazzi, Francesco Ranzato. 461-476 [doi]
- Reuse of Results in Termination Analysis of Typed Logic ProgramsMaurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof. 477-492 [doi]
- Finiteness Analysis in Polynomial TimeChin Soon Lee. 493-508 [doi]
- Detecting Optimal Termination Conditions of Logic ProgramsFrédéric Mesnard, Étienne Payet, Ulrich Neumerkel. 509-526 [doi]