852 search results - page 142 / 171 » entcs 2010 |
114
click to vote
ENTCS
2007
15 years 9 days ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
ENTCS
2007
15 years 9 days ago
2007
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
102
click to vote
ENTCS
2007
15 years 9 days 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...
107
Voted
ENTCS
2007
15 years 9 days ago
2007
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
ENTCS
2007
15 years 9 days ago
2007
Even with todays hardware improvements, performance problems are still common in many software systems. An approach to tackle this problem for component-based software architectur...