48 search results - page 4 / 10 » Points-to analysis using BDDs |
DATE
1998
IEEE
13 years 10 months ago
1998
IEEE
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
ICCAD
2001
IEEE
14 years 2 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
DAC
2003
ACM
14 years 6 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
APLAS
2011
ACM
12 years 5 months ago
2011
ACM
We present a new SPAS (ScalablePAth-Sensitive)framework for resolving points-to sets in C programs that exploits recent advances in pointer analysis. SPAS enables intraprocedural p...
CAV
2003
Springer
13 years 9 months ago
2003
Springer
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...