Sciweavers

241 search results - page 22 / 49
» Bounded Nondeterminism of Logic Programs
Sort
View
ECOOP
2009
Springer
14 years 8 months ago
Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
Jan Smans, Bart Jacobs 0002, Frank Piessens
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
14 years 8 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
ASE
2004
148views more  ASE 2004»
13 years 7 months ago
TestEra: Specification-Based Testing of Java Programs Using SAT
TestEra is a framework for automated specification-based testing of Java programs. TestEra requires as input a Java method (in sourcecode or bytecode), a formal specification of th...
Sarfraz Khurshid, Darko Marinov
CSL
2006
Springer
13 years 7 months ago
Infinite State Model-Checking of Propositional Dynamic Logics
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
Stefan Göller, Markus Lohrey
APAL
2006
112views more  APAL 2006»
13 years 7 months ago
On complexity of verification of interacting agents' behavior
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...