Sciweavers

49 search results - page 8 / 10
» Temporal Logic with Forgettable Past
Sort
View
162
Voted
ICTAC
2009
Springer
15 years 1 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu
FPL
2008
Springer
116views Hardware» more  FPL 2008»
15 years 5 months ago
Shared reconfigurable architectures for CMPS
This paper investigates reconfigurable architectures suitable for chip multiprocessors (CMPs). Prior research has established that augmenting a conventional processor with reconfi...
Matthew A. Watkins, Mark J. Cianchetti, David H. A...
TIME
2009
IEEE
15 years 10 months ago
Event-Oriented Data Models and Temporal Queries in Transaction-Time Databases
—Past research on temporal databases has primarily focused on state-based representations and on relational query language extensions for such representations. This led to many d...
Carlo Zaniolo
FM
2003
Springer
174views Formal Methods» more  FM 2003»
15 years 9 months ago
Model-Checking TRIO Specifications in SPIN
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
Angelo Morzenti, Matteo Pradella, Pierluigi San Pi...
ATVA
2006
Springer
133views Hardware» more  ATVA 2006»
15 years 7 months ago
Branching-Time Property Preservation Between Real-Time Systems
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
Jinfeng Huang, Marc Geilen, Jeroen Voeten, Henk Co...