Sciweavers

889 search results - page 83 / 178
» Problems in Rewriting III
Sort
View
101
Voted
PODS
2010
ACM
249views Database» more  PODS 2010»
15 years 4 months ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...
MPC
2010
Springer
147views Mathematics» more  MPC 2010»
15 years 3 months ago
Designing an Algorithmic Proof of the Two-Squares Theorem
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
João F. Ferreira
ICFEM
2007
Springer
15 years 2 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
TSE
2010
148views more  TSE 2010»
14 years 9 months ago
Program Behavior Discovery and Verification: A Graph Grammar Approach
—Discovering program behaviors and functionalities can ease program comprehension and verification. Existing program analysis approaches have used text mining algorithms to infer...
Chunying Zhao, Jun Kong, Kang Zhang
128
Voted
ANSOFT
2002
126views more  ANSOFT 2002»
14 years 11 months ago
The Real-Time Process Algebra (RTPA)
Abstract. The real-time process algebra (RTPA) is a set of new mathematical notations for formally describing system architectures, and static and dynamic behaviors. It is recogniz...
Yingxu Wang