Sciweavers

503 search results - page 96 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
79
Voted
CCS
2004
ACM
15 years 3 months ago
Attestation-based policy enforcement for remote access
Intranet access has become an essential function for corporate users. At the same time, corporation’s security administrators have little ability to control access to corporate ...
Reiner Sailer, Trent Jaeger, Xiaolan Zhang, Leende...
KBSE
2005
IEEE
15 years 3 months ago
A context-sensitive structural heuristic for guided search model checking
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
Neha Rungta, Eric G. Mercer
ICFP
2003
ACM
15 years 9 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
POPL
2012
ACM
13 years 5 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
ATAL
2010
Springer
14 years 10 months ago
On the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko