2162 search results - page 320 / 433 » Automated Reasoning on Feature Models |
114
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
136
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
155
click to vote
LOPSTR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
148
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
It is estimated that ninety percent of the world’s species have yet to be discovered and described. The main reason for the slow pace of new species description is that the scie...
157
click to vote
XIMEP
2005
ACM
15 years 10 months ago
2005
ACM
Markup languages, representations, schemas, and tools have significantly increased the ability for organizations to share their information. Languages such as the Extensible Marku...