Sciweavers

213 search results - page 38 / 43
» Logic programs with annotated disjunctions
Sort
View
PLDI
2009
ACM
14 years 8 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...
POPL
2005
ACM
14 years 8 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
ASPLOS
2006
ACM
14 years 1 months ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
ECOOP
2006
Springer
13 years 11 months ago
codeQuest:  Scalable Source Code Queries with Datalog
Abstract. Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor
HICSS
2005
IEEE
117views Biometrics» more  HICSS 2005»
14 years 1 months ago
MobCon: A Generative Middleware Framework for Java Mobile Applications
While dedicated technologies such as e.g., Sun’s J2ME MIDP offer a simple programming model for mobile applications, appropriate support for modularizing the implementation of t...
Vasian Cepa, Mira Mezini