Sciweavers

1894 search results - page 340 / 379
» A TLA Proof System
Sort
View
AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
14 years 9 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
ENTCS
2002
103views more  ENTCS 2002»
14 years 9 months ago
Translation from timed Petri nets with intervals on transitions to intervals on places (with urgency)
Petri nets where, to my knowledge, the first theoretical model augmented with time constraints [Mer74], and the support of the first reachability algorithm of timed system [BM83, ...
Marc Boyer
JAR
2000
97views more  JAR 2000»
14 years 9 months ago
A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
Shang-Ching Chou, Xiao-Shan Gao, Jing-Zhong Zhang
QUESTA
2000
68views more  QUESTA 2000»
14 years 9 months ago
Ergodicity of the BMAP/PH}/s/s+K retrial queue with PH-retrial times
Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and onl...
Qi-Ming He, Hui Li, Yiqiang Q. Zhao
TAPOS
1998
83views more  TAPOS 1998»
14 years 9 months ago
A Structured Text ADT for Object-Relational Databases
There is a growing need, both for use within corporate intranets and within the rapidly evolving World Wide Web, to develop tools that are able to retrieve relevant textual inform...
L. J. Brown, Mariano P. Consens, Ian J. Davis, Chr...