1111 search results - page 123 / 223 » Program Analysis as Model Checking of Abstract Interpretatio... |
135
click to vote
LCPC
2007
Springer
15 years 9 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...
113
click to vote
ACSD
2006
IEEE
15 years 9 months ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
105
click to vote
CAV
2008
Springer
15 years 5 months ago
2008
Springer
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
131
Voted
HYBRID
2010
Springer
15 years 9 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
101
click to vote
PLILP
1993
Springer
15 years 7 months ago
1993
Springer
Chaotic iteration sequences is a method for approximating fixpoints of monotonic functions proposed by Patrick and Radhia Cousot. It may be used in specialisation algorithms for ...