SAS 2010 - PDF Preprint Papers

SAS 2010 International Static Analysis Symposium

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SAS-2010 Paper

click to vote

SAS
2010
Springer

82views Formal Methods» more SAS 2010»

Concurrent Separation Logic for Pipelined Parallelization

1 years 3 months ago

Download ftp.cs.princeton.edu

Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...

Christian J. Bell, Andrew W. Appel, David Walker

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	82	Concurrent Separation Logic for Pipelined Parallelization	claim
2	77	Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs	claim
3	76	Thread-Modular Counterexample-Guided Abstraction Refinement	claim
4	71	Interval Slopes as a Numerical Abstract Domain for Floating-Point Variables	claim
5	71	From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis	claim
6	71	Strictness Meets Data Flow	claim
7	68	Automatic Verification of Determinism for Structured Parallel Programs	claim
8	67	Interprocedural Analysis with Lazy Propagation	claim
9	66	Deriving Numerical Abstract Domains via Principal Component Analysis	claim
10	65	Points-to Analysis as a System of Linear Equations	claim
11	65	Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis	claim
12	63	Modelling Metamorphism by Abstract Interpretation	claim
13	62	Alternation for Termination	claim
14	61	Automatic Abstraction for Intervals Using Boolean Formulae	claim
15	61	Boxes: A Symbolic Abstract Domain of Boxes	claim
16	60	Abstract Interpreters for Free	claim
17	56	Statically Inferring Complex Heap, Array, and Numeric Invariants	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers