Sciweavers

4541 search results - page 334 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
VMCAI
2009
Springer
15 years 11 months ago
Deciding Extensions of the Theories of Vectors and Bags
Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established ...
Patrick Maier
ICTAC
2005
Springer
15 years 9 months ago
Symbolic Model Checking of Finite Precision Timed Automata
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
Rongjie Yan, Guangyuan Li, Zhisong Tang
GISCIENCE
2004
Springer
112views GIS» more  GISCIENCE 2004»
15 years 9 months ago
Project Lachesis: Parsing and Modeling Location Histories
Abstract. A datatype with increasing importance in GIS is what we call the location history–a record of an entity’s location in geographical space over an interval of time. Thi...
Ramaswamy Hariharan, Kentaro Toyama
140
Voted
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
15 years 9 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
Arnaud Venet
SAT
2004
Springer
113views Hardware» more  SAT 2004»
15 years 9 months ago
Clause Form Conversions for Boolean Circuits
The Boolean circuits is well established as a data structure for building propositional encodings of problems in preparation for satisfiability solving. The standard method for co...
Paul Jackson, Daniel Sheridan