622 search results - page 79 / 125 » Answer Set Programming and Bounded Model Checking |
195
click to vote
KBSE
2002
IEEE
15 years 11 months ago
2002
IEEE
GenVoca is a methodology and technology for generating product-lines, i.e. building variants of a program. The primitive components from which applications are constructed are ref...
181
Voted
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
165
Voted
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
133
click to vote
MFCS
2009
Springer
16 years 22 days ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
150
click to vote
CSFW
2006
IEEE
16 years 7 days ago
2006
IEEE
Robustness links confidentiality and integrity properties of a computing system and has been identified as a useful property for characterizing and enforcing security. Previous ...