Sciweavers

585 search results - page 19 / 117
» Better Abstractions for Timed Automata
Sort
View
99
Voted
ITP
2010
179views Mathematics» more  ITP 2010»
15 years 4 months ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler
107
Voted
FM
2006
Springer
169views Formal Methods» more  FM 2006»
15 years 4 months ago
PSL Model Checking and Run-Time Verification Via Testers
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
Amir Pnueli, Aleksandr Zaks
91
Voted
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 4 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
CORR
2008
Springer
144views Education» more  CORR 2008»
14 years 12 months ago
Cooperation with Complement is Better
Abstract. In a setting where heterogeneous agents interact to accomplish a given set of goals, cooperation is of utmost importance, especially when agents cannot achieve their indi...
Ilker Yildirim, Haluk Bingol
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
15 years 4 months ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan