Sciweavers

768 search results - page 47 / 154
» Symbolic and Abstract Interpretation for C C Programs
Sort
View
AML
2006
87views more  AML 2006»
13 years 8 months ago
The modal logic of continuous functions on cantor space
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
Philip Kremer
POPL
2009
ACM
14 years 8 months ago
Static contract checking for Haskell
Program errors are hard to detect and are costly both to programmers who spend significant efforts in debugging, and for systems that are guarded by runtime checks. Static verific...
Dana N. Xu, Simon L. Peyton Jones, Koen Claessen
LCR
2000
Springer
121views System Software» more  LCR 2000»
13 years 11 months ago
Optimizing Mutual Exclusion Synchronization in Explicitly Parallel Programs
Abstract. We present two new compiler optimizations for explicitly parallel programs based on the CSSAME form: Lock-Independent Code Motion (LICM) and Mutex Body Localization (MBL)...
Diego Novillo, Ronald C. Unrau, Jonathan Schaeffer
PPOPP
1999
ACM
14 years 8 days ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
POPL
2010
ACM
14 years 5 months ago
Low-Level Liquid Types
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...
Ming Kawaguchi, Patrick Maxim Rondon, Ranjit Jhala