Sciweavers

259 search results - page 45 / 52
» Bounded Model Checking for Timed Automata
Sort
View
ALT
2006
Springer
15 years 9 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
86
Voted
SPIN
2000
Springer
15 years 4 months ago
Modeling the ASCB-D Synchronization Algorithm with SPIN: A Case Study
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
Nicholas Weininger, Darren D. Cofer
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
15 years 4 months ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
139
Voted
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
14 years 10 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
SIGSOFT
2005
ACM
16 years 1 months ago
Reasoning about confidentiality at requirements engineering time
Growing attention is being paid to application security at requirements engineering time. Confidentiality is a particular subclass of security concerns that requires sensitive inf...
Renaud De Landtsheer, Axel van Lamsweerde