Sciweavers

844 search results - page 113 / 169
» Safraless Decision Procedures
Sort
View
SOSYM
2008
114views more  SOSYM 2008»
13 years 8 months ago
Correctly defined concrete syntax
The syntax of modeling languages is usually defined in two steps. The abstract syntax identifies modeling concepts whereas the concrete syntax clarifies how these modeling concepts...
Thomas Baar
APAL
2005
107views more  APAL 2005»
13 years 8 months ago
Uniform Heyting arithmetic
We present an extension of Heyting Arithmetic in finite types called Uniform Heyting Arithmetic (HAu) that allows for the extraction of optimized programs from constructive and cla...
Ulrich Berger
TOCL
2008
128views more  TOCL 2008»
13 years 8 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
JIFS
2007
82views more  JIFS 2007»
13 years 8 months ago
Anomaly detection in mobile communication networks using the self-organizing map
Anomaly detection is a pattern recognition task whose goal is to report the occurrence of abnormal or unknown behavior in a given system being monitored. In this paper we propose a...
Rewbenio A. Frota, Guilherme De A. Barreto, Jo&ati...
ENTCS
2002
91views more  ENTCS 2002»
13 years 8 months ago
Interval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Du...
Paritosh K. Pandya