By William H. Sanders (auth.), Carlos Alberto Maziero, João Gabriel Silva, Aline Maria Santos Andrade, Flávio Morais de Assis Silva (eds.)
This ebook constitutes the refereed court cases of the second one Latin-American Symposium on liable Computing, LADC 2005, held in Salvador, Brazil, in October 2005.
The sixteen revised complete papers provided including three invited talks, and descriptions of two workshops and three tutorials, have been conscientiously reviewed and chosen from 39 submissions. The papers are geared up in topical sections on assessment, certification, modelling, embedded structures, time, and allotted platforms algorithms.
Read or Download Dependable Computing: Second Latin-American Symposium, LADC 2005, Salvador, Brazil, October 25-28, 2005. Proceedings PDF
Similar international conferences and symposiums books
This publication offers 14 conscientiously reviewed revised papers chosen from greater than 50 submissions for the 1994 IEEE/ Nagoya-University international Wisepersons Workshop, WWW'94, held in August 1994 in Nagoya, Japan. the mix of methods in keeping with fuzzy good judgment, neural networks and genetic algorithms are anticipated to open a brand new paradigm of computing device studying for the conclusion of human-like info processing structures.
NGITS2002 was once the ? fth workshop of its style, selling papers that debate new applied sciences in info structures. Following the luck of the 4 p- vious workshops (1993, 1995, 1997, and 1999), the ? fth NGITS Workshop came about on June 24–25, 2002, within the old urban of Caesarea. according to the decision for Papers, 22 papers have been submitted.
This ebook constitutes the refereed complaints of the 4th overseas convention on conception and alertness of Diagrams, Diagrams 2006, held in Stanford, CA, united states in June 2006. The thirteen revised complete papers, nine revised brief papers, and 12 prolonged abstracts provided including 2 keynote papers and a pair of instructional papers have been rigorously reviewed and chosen from approximately eighty submissions.
- Secure Data Management: Second VLDB Workshop, SDM 2005, Trondheim, Norway, September 2-3, 2005. Proceedings
- Functional Imaging and Modeling of the Heart: 4th International Conference, FIHM 2007, Salt Lake City, UT, USA, June 7-9, 2007. Proceedings
- Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005
- Nonlinear world. Proc. IV Workshop on Nonlinear and Turbulent Processes in Physics
- Parallel Computer Routing and Communication: First International Workshop, PCRCW '94 Seattle, Washington, USA, May 16–18, 1994 Proceedings
- Common Semantics for Sharing Knowledge: Contributions to ICCS 2005: 13th International Conference on Conecptual Structures, ICCS 2005 Kassel, Germany, July 2005
Extra resources for Dependable Computing: Second Latin-American Symposium, LADC 2005, Salvador, Brazil, October 25-28, 2005. Proceedings
This drastically reduces the time needed to run the experiments and increases the chances of activating existing weaknesses. Figure 2 presents a visual overview of the methodology. We detail the two steps of our methodology in the following sub-sections. Software target Analysis of 1 the executable code Test information Suspect functions Software target 2 vulnerable functions Testing Fig. 2. Methodology overview. The first step consists of the analysis of the observed executable code to identify the existence of buffers in the stack and infer how such buffers are manipulated.
It is worth noting that the buffer and the instructions to fill it with data do not need to be located in the same function: the function containing a buffer may call a second function supplying the buffer to be filled within that second function. In fact, this is quite a common scenario (see example in Figure 3). Thus the relationship between functions must also be examined. The relationship between function of the type “function f has a buffer – function g has access to f’s buffer” is easily described through a graph where each node represents a function and the arcs between nodes represent an access from on function to another’s internal buffer (Figure 3).
The methodology is composed by two main phases. During the first phase we use the knowledge about the weakness leading to buffer overflow as a search pattern and analyze the executable code to identify probable locations containing this weakness. This analysis is performed in a similar way as a software fault emulation technique developed in our group [14, 15]. The main result of the first phase is the characterization of the software functions (modules) as “safe” or “suspect”. 24 J. Durães and H.
Dependable Computing: Second Latin-American Symposium, LADC 2005, Salvador, Brazil, October 25-28, 2005. Proceedings by William H. Sanders (auth.), Carlos Alberto Maziero, João Gabriel Silva, Aline Maria Santos Andrade, Flávio Morais de Assis Silva (eds.)