305 search results - page 53 / 61 » A Logical Framework to Deal with Variability |
102
click to vote
PLDI
2009
ACM
15 years 6 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
89
Voted
CADE
2002
Springer
15 years 12 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
77
Voted
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
83
Voted
TYPES
1993
Springer
15 years 3 months ago
1993
Springer
Abstract. We explore the expressive power of the formalism called Natural Operational Semantics, NOS, introduced by Burstall and Honsell for defining the operational semantics of ...
127
click to vote
CAV
2009
Springer
15 years 3 months ago
2009
Springer
tic modalities for correctness [16]. The release described in this abstract is a complete rebuild of a preliminary experimental checker [14]. The model input language includes vari...