ADT
2010
15 years 17 days ago
2010
124
Voted
ICFP
2010
ACM
15 years 18 days ago
2010
ACM
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
100
Voted
ICALP
2010
Springer
15 years 18 days ago
2010
Springer
Abstract. We propose a theory of time-bounded verification for realtime systems, in which verification queries are phrased over time intervals of fixed, bounded duration. We argue ...
96
Voted
ICALP
2010
Springer
15 years 18 days ago
2010
Springer
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
86
Voted
ICALP
2010
Springer
15 years 18 days ago
2010
Springer
82
Voted
APLAS
2010
ACM
15 years 18 days ago
2010
ACM
104
click to vote
POPL
2010
ACM
15 years 19 days ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
156
click to vote
LDTA
2010
15 years 19 days ago
2010
Workflow management systems guide and monitor tasks performed by humans and computers. The workflow specifications are usually expressed in special purpose (graphical) formalisms....
85
Voted
LDTA
2010
15 years 19 days ago
2010
90
Voted
LDTA
2010
15 years 19 days ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...