3552 search results - page 186 / 711 » Proof theory in the abstract |
179
click to vote
TACS
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
217
click to vote
CAV
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
213
click to vote
ASIAN
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
198
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
209
click to vote
GRC
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...