Sciweavers

1050 search results - page 76 / 210
» Generating Executable Scenarios from Natural Language
Sort
View
IFL
2007
Springer
128views Formal Methods» more  IFL 2007»
15 years 10 months ago
The Structure of the Essential Haskell Compiler, or Coping with Compiler Complexity
In this paper we describe the structure of the Essential Haskell Compiler (EHC) and how we manage its complexity, despite its growth from essentials to a full Haskell compiler. Our...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra
MODELS
2009
Springer
15 years 10 months ago
HiLA: High-Level Aspects for UML State Machines
UML state machines are widely used for modeling software behavior. However state-crosscutting behaviors, such as synchronization or execution history dependence, are hard to model...
Gefei Zhang, Matthias M. Hölzl
RIDE
2003
IEEE
15 years 9 months ago
ABHIDHA: An extended WordNet for Indo-Aryan Languages
– A lexical knowledge base is an important component of any intelligent information processing system. The WordNet developed at the Cognitive Systems Laboratories at Princeton ha...
Shireesh Reddy Annam, Monojit Choudhury, Sudeshna ...
SBMF
2010
Springer
205views Formal Methods» more  SBMF 2010»
14 years 10 months ago
A High-Level Language for Modeling Algorithms and Their Properties
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
Sabina Akhtar, Stephan Merz, Martin Quinson
ALT
2003
Springer
16 years 24 days ago
On the Learnability of Erasing Pattern Languages in the Query Model
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Steffen Lange, Sandra Zilles