Sciweavers

146 search results - page 21 / 30
» Reusing Program Investigation Knowledge for Code Understandi...
Sort
View
ICLP
2004
Springer
14 years 27 days ago
MProlog: An Extension of Prolog for Modal Logic Programming
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
Linh Anh Nguyen
CSL
2009
Springer
14 years 2 months ago
Nested Hoare Triples and Frame Rules for Higher-Order Store
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, H...
PLDI
2010
ACM
14 years 18 days ago
A GPGPU compiler for memory optimization and parallelism management
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
Yi Yang, Ping Xiang, Jingfei Kong, Huiyang Zhou
WCRE
2000
IEEE
13 years 12 months ago
A Structured Demonstration of Five Program Comprehension Tools: Lessons Learnt
The purpose of this panel is to report on a structured demonstration for comparing program comprehension tools. Five program comprehension tool designers applied their tools to a ...
Susan Elliott Sim, Margaret-Anne D. Storey, Andrea...
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke