Sciweavers

1018 search results - page 200 / 204
» Abstraction and Refinement in Model Checking
Sort
View
CCS
2005
ACM
15 years 3 months ago
A framework for concrete reputation-systems with applications to history-based access control
In a reputation-based trust-management system, agents maintain information about the past behaviour of other agents. This information is used to guide future trust-based decisions...
Karl Krukow, Mogens Nielsen, Vladimiro Sassone
99
Voted
PLDI
2010
ACM
15 years 3 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
116
Voted
PLDI
2012
ACM
13 years 21 days ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
99
Voted
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
15 years 7 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
99
Voted
FMCAD
2004
Springer
15 years 3 months ago
Proof Styles in Operational Semantics
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
Sandip Ray, J. Strother Moore