Sciweavers

1536 search results - page 173 / 308
» The Underlying Logic of Hoare Logic
Sort
View
PODS
1999
ACM
89views Database» more  PODS 1999»
15 years 10 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
CIE
2009
Springer
15 years 10 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
CSREAEEE
2008
64views Business» more  CSREAEEE 2008»
15 years 8 months ago
Representing IT Governance Frameworks as Metamodels
Abstract - Up to now, there is little academic support for the challenges of IT management. As a reaction, various best practice frameworks were developed, which can be subsumed un...
Matthias Goeken, Stefanie Alter
JDS
2007
104views more  JDS 2007»
15 years 6 months ago
Operational Risk Management How an I-DSS May Help
Operational Risk management, the least covered component of Enterprise Wide Risk Management, needs intelligent tools to implement Comprehensive Emergency Management Programs. In t...
Pedro A. C. Sousa, João Paulo Pimentã...
RTS
2008
131views more  RTS 2008»
15 years 6 months ago
Formal verification of multitasking applications based on timed automata model
The aim of this paper is to show, how a multitasking application running under a real-time operating system compliant with an OSEK/VDX standard can be modeled by timed automata. Th...
Libor Waszniowski, Zdenek Hanzálek