Sciweavers

400 search results - page 22 / 80
» An Extensible Meta-Model for Program Analysis
Sort
View
ICFP
2005
ACM
15 years 8 months ago
Fast narrowing-driven partial evaluation for inductively sequential programs
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
219
Voted
POPL
2006
ACM
16 years 2 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
SETP
2007
15 years 3 months ago
Dimensional Inference Using Symbol Lives
Scientific equations embedded in computer programs must obey the rules for dimensional consistency. Many efforts have been made to enforce these rules within computer programs. So...
Brian Farrimond, John Collins
137
Voted
EPIA
2003
Springer
15 years 7 months ago
jcc: Integrating Timed Default Concurrent Constraint Programming into Java
Abstract. This paper describes jcc, an integration of the timed default concurrent constraint programming framework [16] (Timed Default cc) into JAVA [7]. jcc is intended for use i...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
116
Voted
SAC
2010
ACM
15 years 9 months ago
General constant expressions for system programming languages
Most mainstream system programming languages provide support for builtin types, and extension mechanisms through userdefined types. They also come with a notion of constant expre...
Gabriel Dos Reis, Bjarne Stroustrup