238 search results - page 19 / 48 » Constraint Solving and Symbolic Execution |
98
Voted
CP
1997
Springer
15 years 3 months ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
70
Voted
AIIA
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. The O-OSCAR software architecture is a problem solving environment for complex scheduling problem that is based on a constraintbased representation. On top of this core r...
105
Voted
AUSAI
2003
Springer
15 years 4 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
89
Voted
ENTCS
2007
14 years 11 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
IFM
2009
Springer
15 years 5 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...