Sciweavers

1054 search results - page 48 / 211
» Using Component Abstraction for Automatic Generation of Macr...
Sort
View
FMSD
2008
110views more  FMSD 2008»
14 years 9 months ago
Automatic symbolic compositional verification by learning assumptions
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
Wonhong Nam, P. Madhusudan, Rajeev Alur
ICAIL
2003
ACM
15 years 3 months ago
A Model Based Reasoning Approach for Generating Plausible Crime Scenarios from Evidence
Robust decision support systems (DSSs) for crime investigation are difficult to construct because of the almost infinite variation of plausible crime scenarios. Thus, existing ap...
Jeroen Keppens, John Zeleznikow
WOSP
2004
ACM
15 years 3 months ago
Performance modeling from software components
When software products are assembled from pre-defined components, performance prediction should be based on the components also. This supports rapid model-building, using previous...
Xiuping Wu, C. Murray Woodside
FASE
2009
Springer
15 years 4 months ago
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover
Abstract. We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate...
Laura Kovács, Andrei Voronkov
SP
2010
IEEE
178views Security Privacy» more  SP 2010»
15 years 1 months ago
Overcoming an Untrusted Computing Base: Detecting and Removing Malicious Hardware Automatically
The computer systems security arms race between attackers and defenders has largely taken place in the domain of software systems, but as hardware complexity and design processes ...
Matthew Hicks, Murph Finnicum, Samuel T. King, Mil...