Sciweavers

1422 search results - page 257 / 285
» Complementation in Abstract Interpretation
Sort
View
POPL
2012
ACM
13 years 9 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
13 years 4 months ago
Discovering Multiple Clustering Solutions: Grouping Objects in Different Views of the Data
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
Emmanuel Müller, Stephan Günnemann, Ines...
HPDC
1998
IEEE
15 years 6 months ago
A Resource Query Interface for Network-Aware Applications
Development of portable network-aware applications demands an interface to the network that allows an application to obtain information about its execution environment. This paper...
Bruce Lowekamp, Nancy Miller, Dean Sutherland, Tho...
ICLP
1997
Springer
15 years 6 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
CMSB
2006
Springer
15 years 5 months ago
Type Inference in Systems Biology
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
François Fages, Sylvain Soliman