Sciweavers

47 search results - page 9 / 10
» Preorder Relations
Sort
View
VMCAI
2009
Springer
14 years 17 days ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman
ICDE
2005
IEEE
160views Database» more  ICDE 2005»
13 years 11 months ago
NXS: Native XML processing in Sybase RDBMS
Sybase's flagship database product, Adaptive Server Enterprise provides Native XML processing (NXS) support. In this paper we present our experience related to query processi...
Anupam Singh, Srikanth Sampath, Vadiraja Bhatt, Fr...
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
13 years 9 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
JLP
2008
98views more  JLP 2008»
13 years 5 months ago
Comparing disjunctive modal transition systems with an one-selecting variant
models, used for specification, analysis and verification, usually describe sets of implementations by means of a refinement relation. In the branching time setting, implementatio...
Harald Fecher, Heiko Schmidt
JAIR
2008
102views more  JAIR 2008»
13 years 5 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang