3333 search results - page 273 / 667 » Abstract Proof Search |
227
click to vote
TACAS
2000
Springer
15 years 10 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
181
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
199
click to vote
ATVA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
161
click to vote
FMCO
2008
Springer
15 years 8 months ago
2008
Springer
The Bytecode Modeling Language (BML) is a specication for Java bytecode, that provides a high level of abstraction, while not restricting the format of the bytecode. Notably, BML s...
191
click to vote
COMMA
2006
15 years 8 months ago
2006
Abstract. In 2005, Gordon and Walton presented initial ideas for a computational model of defeasible argument [12, 26], which builds on and elaborates Walton's theory of argum...