Sciweavers

126 search results - page 25 / 26
» Using Formal Tools to Study Complex Circuits Behaviour
Sort
View
SCESM
2006
ACM
238views Algorithms» more  SCESM 2006»
14 years 3 days ago
Nobody's perfect: interactive synthesis from parametrized real-time scenarios
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....
Holger Giese, Stefan Henkler, Martin Hirsch, Flori...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 6 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
ICSE
2001
IEEE-ACM
13 years 10 months ago
The Coming-of-Age of Software Architecture Research
Over the past decade, software architecture research has emerged as the principled study of the overall structure of software systems, especially the relations among subsystems an...
Mary M. Shaw
SIGSOFT
2007
ACM
14 years 6 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
CONCUR
2001
Springer
13 years 10 months ago
Extended Temporal Logic Revisited
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi