619 search results - page 120 / 124 » Formal Methods Meet Domain Specific Languages |
206
click to vote
FOSSACS
2011
Springer
14 years 5 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
152
click to vote
STACS
1993
Springer
15 years 5 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
134
Voted
TOPLAS
2008
15 years 1 months ago
2008
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
128
click to vote
SAC
2010
ACM
14 years 11 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
143
click to vote
EKAW
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...