Results 1 - 10 of 2,208

Boogie: A modular reusable verifier for object-oriented programs

by Mike Barnett, Bor-yuh Evan Chang, Robert Deline, Bart Jacobs, K. Rustanm. Leino - Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, volume 4111 of Lecture Notes in Computer Science , 2006
"... Abstract. A program verifier is a complex system that uses compiler technology, program semantics, property inference, verification-condition generation, automatic decision procedures, and a user interface. This paper describes the architecture of a state-of-the-art program verifier for object-orien ..."
Abstract - Cited by 309 (49 self) - Add to MetaCart
Abstract. A program verifier is a complex system that uses compiler technology, program semantics, property inference, verification-condition generation, automatic decision procedures, and a user interface. This paper describes the architecture of a state-of-the-art program verifier for object

How to leak a secret

by Ronald L. Rivest, Adi Shamir, Yael Tauman - PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON THE THEORY AND APPLICATION OF CRYPTOLOGY AND INFORMATION SECURITY: ADVANCES IN CRYPTOLOGY , 2001
"... In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and ..."
Abstract - Cited by 2580 (4 self) - Add to MetaCart
, and exceptionally efficient: adding each ring member increases the cost of signing or verifying by a single modular multiplication and a single symmetric encryption.

The omnet++ discrete event simulation system

by András Varga - In ESM’01 , 2001
"... performance analysis, computer systems, telecommunications, hierarchical The paper introduces OMNeT++, a C++-based discrete event simulation package primarily targeted at simulating computer networks and other distributed systems. OMNeT++ is fully programmable and modular, and it was designed from t ..."
Abstract - Cited by 418 (1 self) - Add to MetaCart
performance analysis, computer systems, telecommunications, hierarchical The paper introduces OMNeT++, a C++-based discrete event simulation package primarily targeted at simulating computer networks and other distributed systems. OMNeT++ is fully programmable and modular, and it was designed from

Design Pattern Implementation in Java and AspectJ

by Jan Hannemann, Gregor Kiczales , 2002
"... AspectJ implementations of the GoF design patterns show modularity improvements in 17 of 23 cases. These improvements are manifested in terms of better code locality, reusability, composability, and (un)pluggability. The degree of ..."
Abstract - Cited by 311 (3 self) - Add to MetaCart
AspectJ implementations of the GoF design patterns show modularity improvements in 17 of 23 cases. These improvements are manifested in terms of better code locality, reusability, composability, and (un)pluggability. The degree of

Modularity and Reusability in Attribute Grammars

by U. Kastens, W. M. Waite - ACTA INFORMATICA , 1992
"... An attribute grammar is a declarative specification of dependence among computations carried out at the nodes of a tree. Attribute grammars have proven remarkably difficult to decompose into logical fragments. As a result, they have not yet been accepted as a viable specification technique. By combi ..."
Abstract - Cited by 79 (5 self) - Add to MetaCart
. By combining the ideas of remote attribute access and inheritance, we have been able to define "attribution modules" that can be reused in a variety of applications. As an example, we show how to define reusable modules for name analysis that embody different scope rules.

A verifiable secret shuffle and its application to E-Voting

by C. Andrew Neff , 2001
"... We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universally verifiable, multi-authority election schemes. The output of the shuffle operation is another sequence of k modular in ..."
Abstract - Cited by 217 (0 self) - Add to MetaCart
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universally verifiable, multi-authority election schemes. The output of the shuffle operation is another sequence of k modular

Verifying aspect advice modularly

by Shriram Krishnamurthi, Kathi Fisler, Michael Greenberg - In FSE ’04
"... Aspect-oriented programming has become an increasingly important means of expressing cross-cutting program abstractions. Despite this, aspects lack support for computeraided verification. We present a technique for verifying aspect-oriented programs (expressed as state machines). Our technique assum ..."
Abstract - Cited by 65 (1 self) - Add to MetaCart
Aspect-oriented programming has become an increasingly important means of expressing cross-cutting program abstractions. Despite this, aspects lack support for computeraided verification. We present a technique for verifying aspect-oriented programs (expressed as state machines). Our technique

The probability of duplicate gene preservation by subfunctionalization.

by Michael Lynch , Allan Force - Genetics , 2000
"... ABSTRACT It has often been argued that gene-duplication events are most commonly followed by a mutational event that silences one member of the pair, while on rare occasions both members of the pair are preserved as one acquires a mutation with a beneficial function and the other retains the origin ..."
Abstract - Cited by 261 (2 self) - Add to MetaCart
for the maintenance of multiple copies of genes nated tens to hundreds of millions of years ago (Allen-(Ohta 1987; birds and mammals (Normes et al. 1998). The modular nature of the tissue-specific regulatory regions of Pax6 Provided the different subfunctions are essential for survival and/or reproduction, once

Verification of Object-Oriented Programs with Invariants

by Mike Barnett, Robert DeLine, Manuel Fähndrich, K. Rustan M. Leino, Wolfram Schulte - JOURNAL OF OBJECT TECHNOLOGY , 2004
"... ... This paper defines a programming methodology for using object invariants. The methodology, which enriches a program's state space to express when each object invariant holds, deals with owned object components, ownership transfer, and subclassing, and is expressive enough to allow many inte ..."
Abstract - Cited by 224 (36 self) - Add to MetaCart
interesting object-oriented programs to be specified and verified. Lending itself to sound modular verification, the methodology also provides a solution to the problem of determining what state a method is allowed to modify.

Fast batch verification for modular exponentiation and digital signatures

by Mihir Bellare, Juan A. Garay, Tal Rabin , 1998
"... Abstract Many tasks in cryptography (e.g., digital signature verification) call for verification of a basicoperation like modular exponentiation in some group: given ( g, x, y) check that gx = y. Thisis typically done by re-computing gx and checking we get y. We would like to do it differently,and f ..."
Abstract - Cited by 141 (2 self) - Add to MetaCart
,and faster. The approach we use is batching. Focusing first on the basic modular exponentiation oper-ation, we provide some probabilistic batch verifiers, or tests, that verify a sequence of modular exponentiations significantly faster than the naive re-computation method. This yields speedupsfor several
Results 1 - 10 of 2,208