Sciweavers

837 search results - page 103 / 168
» Proof Development with OMEGA
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
13 years 11 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
JOC
2002
76views more  JOC 2002»
13 years 10 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
NJC
2002
109views more  NJC 2002»
13 years 10 months ago
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
Mogens Nielsen, Catuscia Palamidessi, Frank D. Val...
RML
2002
82views Business» more  RML 2002»
13 years 10 months ago
A Nonmonotonic Rule System using Ontologies
The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the form of the DAML+OIL language whic...
Grigoris Antoniou
TCS
2002
13 years 10 months ago
A formal approach to object-oriented software engineering
We show how formal specifications can be integrated into one of the current pragmatic object-oriented software development methods. Jacobson's "Object-Oriented Software ...
Martin Wirsing, Alexander Knapp