Sciweavers

24 search results - page 1 / 5
» Scalable compositional minimization via static analysis
Sort
View
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 1 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
SIGSOFT
2004
ACM
14 years 5 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
HYBRID
2010
Springer
13 years 10 months ago
Safe compositional network sketches: formal framework
NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch assists system integr...
Azer Bestavros, Assaf J. Kfoury, Andrei Lapets, Mi...
MICRO
1996
IEEE
142views Hardware» more  MICRO 1996»
13 years 9 months ago
Compiler Synthesized Dynamic Branch Prediction
Branch prediction is the predominant approach for minimizing the pipeline breaks caused by branch instructions. Traditionally, branch prediction is accomplished in one of two ways...
Scott A. Mahlke, Balas K. Natarajan
SCAM
2008
IEEE
13 years 11 months ago
User-Input Dependence Analysis via Graph Reachability
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
Bernhard Scholz, Chenyi Zhang, Cristina Cifuentes