Sciweavers

3564 search results - page 118 / 713
» Evaluating a Formal Modelling Language
Sort
View
ICFP
2004
ACM
15 years 10 months ago
Relating models of backtracking
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...
Mitchell Wand, Dale Vaillancourt
KI
2002
Springer
14 years 9 months ago
Advantages, Opportunities and Limits of Empirical Evaluations: Evaluating Adaptive Systems
While empirical evaluations are a common research method in some areas of Artificial Intelligence (AI), others still neglect this approach. This article outlines both the opportun...
Stephan Weibelzahl, Gerhard Weber
CHARME
2003
Springer
73views Hardware» more  CHARME 2003»
15 years 1 months ago
Towards Diagrammability and Efficiency in Event Sequence Languages
Industrial verification teams are actively developing suitable event sequence languages for hardware verification. Such languages must be expressive, designer friendly, and hardwar...
Kathi Fisler
POPL
2010
ACM
15 years 7 months ago
Integrating Typed and Untyped Code in a Scripting Language
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and per...
Francesco Zappa Nardelli, Jan Vitek, Johan Ös...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 2 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil