| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 22
reviews
|
|
|
 |
|
|
|
|
Feasibility of stepwise design of multitolerant programs
Ebnenasir A., Kulkarni S. ACM Transactions on Software Engineering and Methodology 21(1): 1-49, 2011. Type: Article
There is much debate in the software community about whether fault tolerance, security, privacy, and other resilience qualities should be built into the software as it is designed or added to a fully developed system. Because the fault...
|
Mar 23 2012 |
|
|
|
|
|
|
Needed foundations for assuring the desirable behavior of software-reliant systems
Northrop L., Klein M., Goodenough J., Smith D. FoSER 2010 (Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research, Santa Fe, NM, Nov 7-8, 2010) 259-262, 2010. Type: Proceedings
Since the beginning of computing, lamenting the increasing complexity of computing systems and the difficulty of delivering quality systems has been a nearly ubiquitous theme in research literature. Yet, there seems to be a consensus i...
|
Mar 23 2011 |
|
|
|
|
|
|
Processing spatial skyline queries in both vector spaces and spatial network databases
Sharifzadeh M., Shahabi C., Kazemi L. ACM Transactions on Database Systems 34(3): 1-45, 2009. Type: Article
Increasingly, various contexts call for queries where one is seeking a set of objects (points) from the database that form a skyline (no other point dominates them). These queries have been dubbed skyline queries. They are specified th...
|
Feb 16 2010 |
|
|
|
|
|
|
A flow calculus of mwp-bounds for complexity analysis
Jones N., Kristiansen L. ACM Transactions on Computational Logic 10(4): 1-41, 2009. Type: Article
Program analysis has traditionally focused on proving program termination or estimating the amount of central processing unit (CPU) or memory resources required, as a function of the size of the input. Another aspect that can be of int...
|
Oct 23 2009 |
|
|
|
|
|
|
The calculus of computation: decision procedures with applications to verification
Bradley A., Manna Z., Springer-Verlag New York, Inc., Secaucus, NJ, 2007. 366 pp. Type: Book (9783540741121)
The coming of age of program verification is finally here. Coming from pioneers in the field, who have already written many books on various aspects of program verification, this book, which addresses the verification of sequential pro...
|
Aug 1 2008 |
|
|
|
|
|
|
Trustworthy computing: analytical and quantitative engineering evaluation
Sahinoglu M., Wiley-Interscience, 2007. 320 pp. Type: Book (9780470085127)
As stated by the author, the latest ACM Computing Curricula recommendations put an increased emphasis on security as a core knowledge area in all computing fields, yet this emphasis is rarely fully reflected in the curricula offered &a...
|
Apr 3 2008 |
|
|
|
|
|
|
What design heuristics may enhance the utility of a formal specification?
van der Poll J., Kotzé P. Enablement through technology (Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists, Port Elizabeth, South Africa, Sep 16-18, 2002) 179-194, 2002. Type: Proceedings
Software specification literature is rich with recommendations for qualities that a specification must possess, and sins that must not be committed while specifying. All of these recommendations are stated in general terms....
|
Jan 3 2003 |
|
|
|
|
|
|
A Methodology for Architecture-Level Reliability Risk Analysis
Yacoub S., Ammar H. IEEE Transactions on Software Engineering 28(6): 529-547, 2002. Type: Article
In large software systems, the software architecture is an important artifact, embodying decisions with direct impact on non-functional qualities, such as availability, performance, and reliability. While the impact of architectural d...
|
Dec 16 2002 |
|
|
|
|
|
|
An inheritance-based technique for building simulation proofs incrementally
Keidar I., Khazan R., Lynch N., Shvartsman A. ACM Transactions on Software Engineering and Methodology 11(1): 63-91, 2002. Type: Article, Reviews: (1 of 2)
Most specification formalisms recognize the need to build specifications incrementally, and to provide modularity constructs such as refinement and decomposition. The modularity in specifications can be much more beneficial when it als...
|
Jun 25 2002 |
|
|
|
|
|
|
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results
Bultan T., Gerber R., Pugh W. ACM Transactions on Programming Languages and Systems 21(4): 747-789, 1999. Type: Article
The authors discuss the automatic analysis and verification of concurrent programs with unbounded integer variables. These programs are expressed in the event-action language and have their semantics defined in terms of infinite (becau...
|
Mar 1 2000 |
|
|
|
|
|
| |
|
|
| |
|
|
