2607 search results - page 97 / 522 » Complete Functional Synthesis |
146
click to vote
AML
2010
15 years 3 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
148
Voted
FOSSACS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
119
Voted
COMPSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
Time/utility function time constraints (or TUFs) and utility accrual (UA) scheduling optimality criteria, constitute, arguably, the most effective and broadest approach for adapti...
123
Voted
AML
2006
15 years 3 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
BIOINFORMATICS
2005
15 years 3 months ago
2005
: Recent advances in gene sequencing have provided complete sequence information for a number of genomes and as a result the amount of data in the sequence databases is growing at ...