Sciweavers

503 search results - page 36 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
POPL
2010
ACM
15 years 7 months ago
Low-Level Liquid Types
We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types. Low-Level Liquid Types combine refinement types with three key elements to automate verifi...
Ming Kawaguchi, Patrick Maxim Rondon, Ranjit Jhala
ECAI
2006
Springer
15 years 1 months ago
Modal Logics for Communicating Rule-Based Agents
In this paper, we show how to establish correctness and time bounds (e.g., quality of service guarantees) for multi-agent systems composed of communicating rule-based agents. The f...
Natasha Alechina, Mark Jago, Brian Logan
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
14 years 11 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
ECCC
2007
144views more  ECCC 2007»
14 years 9 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
ACTA
2011
14 years 4 months ago
Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking. When the shared variables behave...
Alex A. Aravind, Wim H. Hesselink