Sciweavers

97 search results - page 4 / 20
» Making Nondeterminism Unambiguous
Sort
View
ICFP
2009
ACM
14 years 11 months ago
Purely functional lazy non-deterministic programming
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
Sebastian Fischer, Oleg Kiselyov, Chung-chieh Shan
DSN
2006
IEEE
14 years 4 months ago
CADRE: Cycle-Accurate Deterministic Replay for Hardware Debugging
One of the main reasons for the difficulty of hardware verification is that hardware platforms are typically nondeterministic at clock-cycle granularity. Uninitialized state ele...
Smruti R. Sarangi, Brian Greskamp, Josep Torrellas
SPE
2008
126views more  SPE 2008»
13 years 10 months ago
ANTLRWorks: an ANTLR grammar development environment
Programmers tend to avoid using language tools, resorting to ad-hoc methods, because tools can be hard to use, their parsing strategies can be difficult to understand and debug, a...
Jean Bovet, Terence Parr
FUIN
2006
63views more  FUIN 2006»
13 years 10 months ago
Interpreted Trajectories
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
Michael Domaratzki, Grzegorz Rozenberg, Kai Saloma...
RE
2008
Springer
13 years 9 months ago
Reusing Terminology for Requirements Specifications from WordNet
In order to make requirements comprehensible to humans and as unambiguous as possible, a glossary and/or domain model is needed for defining the terminology used. Unless these are...
Katharina Wolter, Michal Smialek, Daniel Bildhauer...