71 search results - page 2 / 15 » Using Datalog with Binary Decision Diagrams for Program Anal... |
VOSS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper describes symbolic techniques for the construction, representation and analysis of large, probabilistic systems. Symbolic approaches derive their efficiency by...
ICSE
2004
IEEE-ACM
14 years 4 months ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
MICRO
2000
IEEE
13 years 8 months ago
2000
IEEE
Functionality and performance of EPIC architectural features depend on extensive compiler support. Predication, one of these features, promises to reduce control flow overhead and...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x...
LCPC
2007
Springer
13 years 11 months ago
2007
Springer
Binary Decision Diagrams (BDDs) have recently become widely accepted as a space-efficient method of representing relations in points-to analyses. When BDDs are used to represent re...