Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-15769-1_15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Streaming Algorithms for Line Simplification

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2009English

Static Analysis of Android Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Static Analysis of Ravenscar Programs

ACM SIGAda Ada Letters
2003English

On Small Variation Formulas

Vestnik Tomskogo Gosudarstvennogo Universiteta, Matematika i Mekhanika
Computational MechanicsMathematicsMechanics of MaterialsMechanical Engineering
2017English

On Termination of Constraint Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Requirements Analysis for Large Ada Programs: Lessons Learned on CCPDS- R

1989English

Simple and Scalable Time-Table Filtering for the Cumulative Constraint

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Numerical Static Analysis of Interrupt-Driven Programs via Sequentialization

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy