Sciweavers

1005 search results - page 86 / 201
» A Language for Manipulating Arrays
Sort
View
FM
2009
Springer
124views Formal Methods» more  FM 2009»
15 years 10 months ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast
GI
2004
Springer
15 years 9 months ago
Extending BPEL4WS for Multiple Instantiation
: A means to define multiple activity instantiation is an important feature of a business process modelling language. In this paper we suggest to extend BPEL4WS with structured ac...
Jan Mendling, Mark Strembeck, Gustaf Neumann
AFP
1995
Springer
128views Formal Methods» more  AFP 1995»
15 years 7 months ago
Monads for Functional Programming
Abstract. The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global st...
Philip Wadler
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
15 years 5 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
128
Voted
ACTA
2002
108views more  ACTA 2002»
15 years 4 months ago
Object type constructors
Object type constructors have been introduced as an approach to adding container object types to a language with type inference. Useful subtyping for object type constructors requ...
Dominic Duggan