643 search results - page 85 / 129 » Semantic Determinism and Functional Logic Program Properties |
109
click to vote
CAV
1999
Springer
15 years 6 months 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...
111
click to vote
SIGSOFT
2004
ACM
16 years 2 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
244
click to vote
ICFP
2009
ACM
16 years 2 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
123
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
142
click to vote
CSL
2006
Springer
15 years 5 months ago
2006
Springer
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...