1454 search results - page 261 / 291 » Stateful traits and their formalization |
92
Voted
ICFP
2006
ACM
16 years 22 days ago
2006
ACM
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
94
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
118
click to vote
TABLEAUX
2009
Springer
15 years 7 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
143
click to vote
HASKELL
2009
ACM
15 years 7 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
110
Voted
CAV
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...