76 search results - page 10 / 16 » Comparing Completeness Properties of Static Analyses and The... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
ILP
2000
Springer
14 years 4 days ago
2000
Springer
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
DATE
2010
IEEE
14 years 1 months ago
2010
IEEE
—We present a new language called Precision Timed C, for predictable and lightweight multithreading in C. PRET-C supports synchronous concurrency, preemption, and a high-level co...
CAV
1999
Springer
14 years 26 days ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
SFM
2007
Springer
14 years 2 months ago
2007
Springer
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...