1226 search results - page 153 / 246 » Proofs, Programs and Abstract Complexity |
107
Voted
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
121
click to vote
SEFM
2006
IEEE
15 years 9 months ago
2006
IEEE
We present an operational model for describing random reactive systems. Some models have already been proposed for this purpose, but they generally aim at performing global reason...
147
click to vote
ISSAC
2004
Springer
15 years 8 months ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
137
click to vote
COMPSAC
2003
IEEE
15 years 8 months ago
2003
IEEE
Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineeri...
FSTTCS
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...