Sciweavers

1486 search results - page 236 / 298
» A Logically Saturated Extension of
Sort
View
ICFEM
2009
Springer
15 years 3 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
ICTAC
2009
Springer
15 years 3 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
171
Voted
NJC
2000
169views more  NJC 2000»
15 years 5 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann
ICDE
1999
IEEE
107views Database» more  ICDE 1999»
16 years 7 months ago
Using Codewords to Protect Database Data from a Class of Software Errors
Increasingly, for extensibility and performance, specialpurpose application code is being integrated with database system code. Such application code has direct access to database...
Philip Bohannon, Rajeev Rastogi, S. Seshadri, Abra...
DAC
2008
ACM
16 years 6 months ago
Automated transistor sizing for FPGA architecture exploration
The creation of an FPGA requires extensive transistor-level design. This is necessary for both the final design, and during architecture exploration, when many different logic and...
Ian Kuon, Jonathan Rose