Sciweavers

1461 search results - page 199 / 293
» Analysis of Constraint Logic Programs
Sort
View
JFP
2007
111views more  JFP 2007»
13 years 10 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
PASTE
2010
ACM
14 years 3 days ago
Null dereference analysis in practice
Many analysis techniques have been proposed to determine when a potentially null value may be dereferenced. But we have observed in practice that not every potential null derefere...
Nathaniel Ayewah, William Pugh
SAC
2006
ACM
13 years 10 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
PPDP
2005
Springer
14 years 3 months ago
Automatic type inference via partial evaluation
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
Aaron Tomb, Cormac Flanagan
MEMOCODE
2008
IEEE
14 years 4 months ago
From Data to Events: Checking Properties on the Control of a System
We present a component-based description language for heterogeneous systems composed of several data flow processing components and a unique eventbased controller. Descriptions a...
Christophe Jacquet, Frédéric Boulang...