Sciweavers

441 search results - page 17 / 89
» A Method for Proving Observational Equivalence
Sort
View
SIAMJO
2010
83views more  SIAMJO 2010»
13 years 7 months ago
The Lifted Newton Method and Its Application in Optimization
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
Jan Albersmeyer, Moritz Diehl
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
14 years 10 months ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
FUIN
2006
85views more  FUIN 2006»
13 years 8 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang
POPL
2007
ACM
14 years 9 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
EUROPAR
2004
Springer
14 years 2 months ago
A Parallel PSPG Finite Element Method for Direct Simulation of Incompressible Flow
Abstract. We describe a consistent splitting approach to the pressurestabilized Petrov-Galerkin finite element method for incompressible flow. The splitting leads to (almost) exp...
Jörg Stiller, Karel Frana, Roger Grundmann, U...