Sciweavers

164 search results - page 6 / 33
» Executable Computational Logics: Combining Formal Methods an...
Sort
View
PPDP
2004
Springer
14 years 27 days ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
14 years 28 days ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
Ken Taniguchi, Takao Terano
PLDI
2006
ACM
14 years 1 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
ROOM
2000
13 years 9 months ago
An Overview of The Mensurae Language: Specifying Business Processes
We describe a language which can be used to model business processes (both technical and nontechnical). It has a formal semantics, so as to enable formal analysis and prediction o...
T. S. E. Maibaum
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 26 days ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi