Sciweavers

3775 search results - page 593 / 755
» The Expression Problem Revisited
Sort
View
TAPSOFT
1997
Springer
15 years 8 months ago
An Applicative Module Calculus
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
Judicaël Courant
135
Voted
TIME
1994
IEEE
15 years 8 months ago
Belief Revision in a Discrete Temporal Probability-Logic
We describe a discrete time probabilitylogic for use as the representation language of a temporal knowledge base. In addition to the usual expressive power of a discrete temporal ...
Scott D. Goodwin, Howard J. Hamilton, Eric Neufeld...
CAV
1994
Springer
113views Hardware» more  CAV 1994»
15 years 8 months ago
A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
Rajeev Alur, Limor Fix, Thomas A. Henzinger
ALP
1992
Springer
15 years 8 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy
ESORICS
1992
Springer
15 years 8 months ago
ASAX: Software Architecture and Rule-Based Language for Universal Audit Trail Analysis
After a brief survey of the problems related to audit trail analysis and of some approaches to deal with them, the paper outlines the project ASAX which aims at providing an advanc...
Naji Habra, Baudouin Le Charlier, Abdelaziz Mounji...