ADVANCED SEARCH
Advanced Search
FEEDBACK
 Please provide us with feedback
Found 931 of 1,394,228
|
|
Results 1 - 20 of 931
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
1
|
|
Audit-based compliance control
|
|
March 2007
|
|
International Journal of Information Security
, Volume 6 Issue 2
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
 |
|
In this paper we introduce a new framework for controlling compliance to discretionary access control policies [Cederquist et al. in Proceedings of the International Workshop on Policies for Distributed Systems and Networks (POLICY), 2005; Corin ...
Keywords: Access control, Audit, Policy, Privacy
|
|
2
|
|
3
|
|
On proving the correctness of optimizing transformations in a digital design automation system
|
|
June 1981
|
|
DAC '81: Proceedings of the 18th Design Automation Conference
|
|
Publisher: IEEE Press
|
|
Full text available: |
 Pdf
(764.49 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 0, Downloads (12 Months): 6, Downloads (Overall): 67, Citation Count: 3 |
|
|
As part of our research for the Carnegie-Mellon University Design Automation System, we have been investigating methods for proving that the system produces correct designs from correct specifications. This paper presents a mathematical model of the ...
|
|
4
|
|
5
|
|
Automatic effective verification method for distributed and concurrent systems using timed language inclusion
|
|
January 2001
|
|
Engineering of distributed control systems
|
|
Publisher: Nova Science Publishers, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
In distributed and concurrent systems, the notions of fairness and time are important as follows: (1)Fairness is a mathematical abstraction in distributed and concurrent systems. Fairness abstracts the details of fair schedulers and the speeds of independent ...
|
|
6
|
|
Proving the correctness of a flight-director program for an airborne minicomputer
|
|
April 1976
|
|
SIGMINI '76: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment
|
Publisher: ACM
 Request Permissions
|
|
Full text available: |
Pdf
(499.35 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 0, Downloads (12 Months): 10, Downloads (Overall): 95, Citation Count: 1 |
|
|
Over the past five years, our research efforts have been devoted in large part to developing techniques for proving the correctness of assembly-language and machine-language programs running on actual computers. In this paper, we report upon an effort ...
|
Also published in: |
| April 1976 |
SIGPLAN Notices |
Volume 11 Issue 4 |
|
|
7
|
|
Annotation inference for modular checkers
|
|
February 2001
|
|
Information Processing Letters
, Volume 77 Issue 2-4
|
|
Publisher: Elsevier North-Holland, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 10 |
|
|
|
Keywords: annotation inference, modular program checking, program correctness, program specification
|
|
8
|
|
The incorrectness of the bisection algorithm
|
|
September 1991
|
|
Artificial intelligence and mathematical theory of computation
|
|
Publisher: Academic Press Professional, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
9
|
|
10
|
|
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
|
|
July 2008
|
|
Journal of Automated Reasoning
, Volume 41 Issue 1
|
|
Publisher: Kluwer Academic Publishers
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 3 |
|
|
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Beyond giving semantics to pointer-based programs, this model supports reasoning ...
Keywords: C, Compilation, Compiler correctness, Memory model, Program verification, The Coq proof assistant
|
|
11
|
|
Proof-transforming compilation of programs with abrupt termination
|
|
September 2007
|
|
SAVCBS '07: Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(1.13 MB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 2, Downloads (12 Months): 14, Downloads (Overall): 31, Citation Count: 2 |
|
|
The execution of untrusted bytecode programs can produce undesired behavior. A proof on the bytecode programs can be generated to ensure safe execution. Automatic techniques to generate proofs, such as certifying compilation, can only be used for a restricted ...
Keywords: proof-carrying code, proof-transforming compiler, trusted components
|
|
12
|
|
Generating a random cycle permutation
|
|
July 1988
|
|
BIT
, Volume 28 Issue 3
|
|
Publisher: BIT Computer Science and Numerical Mathematics
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
13
|
|
Reasoning about atomic objects
|
|
September 1988
|
|
Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
|
|
Publisher: Springer-Verlag New York, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
|
|
|
14
|
|
A New Approach to Proving the Correctness of Multiprocess Programs
|
|
January 1979
|
|
Transactions on Programming Languages and Systems (TOPLAS)
, Volume 1 Issue 1
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(827.91 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 8, Downloads (12 Months): 71, Downloads (Overall): 493, Citation Count: 19 |
|
|
A new, nonassertional approach to proving multiprocess program correctness is described by proving the correctness of a new algorithm to solve the mutual exclusion problem. The algorithm is an improved version of the bakery algorithm. It is specified ...
|
|
15
|
|
Verification techniques for mobile processes and security protocols
|
|
January 2006
|
|
Verification techniques for mobile processes and security protocols
|
|
Publisher: State University of New York at Stony Brook
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 0 |
|
|
Design of systems, whose topologies change dynamically, presents unique challenges that are substantially more difficult than the design of static topology systems. Wireless LANs, cellular networks, mobile ad hoc networks, and even wired networks must ...
|
|
16
|
|
Specifications, programs, and total correctness
|
|
July 1999
|
|
Science of Computer Programming
, Volume 34 Issue 3
|
|
Publisher: Elsevier North-Holland, Inc.
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 2 |
|
|
|
Keywords: program, specification, total correctness
|
|
17
|
|
18
|
|
Using CSP to verify sequential consistency
|
|
June 1999
|
|
Distributed Computing
, Volume 12 Issue 2-3
|
|
Publisher: Springer-Verlag
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
This paper shows how the theory of Communicating Sequential Processes (CSP) can be used to establish that a protocol guarantees sequential consistency. The protocol in question is an accepted design based upon lazy caching; it is an ideal example for ...
Keywords: CSP, lazy caching protocol, sequential consistency, specification, verification
|
|
19
|
|
Loop invariants and mathematical games
|
|
March 1995
|
|
SIGCSE '95: Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education
|
|
Publisher: ACM
Request Permissions
|
|
Full text available: |
Pdf
(399.44 KB)
|
|
|
| Bibliometrics: Downloads (6 Weeks): 16, Downloads (12 Months): 43, Downloads (Overall): 374, Citation Count: 2 |
|
|
The concept of combining loop invariants with algorithm analysis and design is a significant programming tool. However, teaching this concept is not easy. One way of motivating and supporting the introduction of such a concept, is by illustrating it ...
|
Also published in: |
| March 1995 |
SIGCSE Bulletin |
Volume 27 Issue 1 |
|
|
20
|
|
Formal Verification of Type Flaw Attacks in Security Protocols
|
|
December 2003
|
|
APSEC '03: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference
|
|
Publisher: IEEE Computer Society
|
|
|
|
| Bibliometrics: Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Downloads (Overall): n/a, Citation Count: 1 |
|
|
Security protocols are often modelled at a high levelof abstraction, potentially overlooking implementation-dependentvulnerabilities. Here we use the Z specificationlanguage's rich set of data structures to formally model potentiallyambiguous messages ...
|
|
|
Result page:
1
2
3
4
5
6
7
8
9
10
next
>>
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Refine by Keywords
Save results to a Binder
Publisher Site