Sciweavers

185 search results - page 16 / 37
» Induction in an Abstraction Space: A Form of Constructive In...
Sort
View
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
14 years 10 days ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
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...
Ramesh Bharadwaj, Steve Sims
FUIN
2002
107views more  FUIN 2002»
13 years 8 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...
JAL
1998
85views more  JAL 1998»
13 years 8 months ago
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
Brendan D. McKay
CCS
2001
ACM
14 years 1 months ago
Events in security protocols
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the ...
Federico Crazzolara, Glynn Winskel
IDA
2003
Springer
14 years 2 months ago
Constructing Hierarchical Rule Systems
Rule systems have failed to attract much interest in large data analysis problems because they tend to be too simplistic to be useful or consist of too many rules for human interpr...
Thomas R. Gabriel, Michael R. Berthold